We design succinct encodings of {\it series-parallel, block-cactus} and 3-leaf power} graphs while supporting the basic navigational queries such as degree, adjacency neighborhood optimally} in RAM model with logarithmic word size. One salient feature our representation is that it can achieve optimal space even though exact lower bound for these graph classes not known. For classes, we provide ...

Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include increasing fault tolerance of a (possibly heterogeneous) system and alleviating the problems associated with critical sections such as priority inversion and deadlock. For parallel computers with tightly-coupled processors and ...

PAWS (Parallel Application WorkSpace) is a software infrastructure for use in connecting separate parallel applications within a component-like model. A central PAWS Controller coordinates the linking of serial or parallel applications across a network to allow them to share parallel data structures such as multidimensional arrays. Applications use the PAWS API to indicate which data structures...