Lifting sequential graph algorithms for distributed-memory parallel computation

This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algorithms and supporting data structures, but it was not originally designed with parallelism in mind. In this parevisit the abstractions comprising the BGL in the context of distributed-memory parallelism, lifting away the implicit requirements of sequential execution and a single shared address space. We illustrate our approach by describing the process as applied to one of the core algorithms in the BGL, breadth-first search. The result is a generic algorithm that is unchanged from the sequential algorithm, re

• Type: Conference
• Year: 2005
• Where: OOPSLA
• Authors: Douglas Gregor, Andrew Lumsdaine
• Keywords: Boost Graph Library, Generic Graph Algorithms, OOPSLA 2005, Single Shared Address