Families of Graph Algorithms: SSSP Case Study

Conference · Mon Aug 28 00:00:00 EDT 2017 · Lecture Notes in Computer Science

DOI:https://doi.org/10.1007/978-3-319-64203-1_31· OSTI ID:1434879

Zalewski, Marcin J.; Lumsdaine, Andrew

Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploring semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.

• Research Organization: Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 1434879
• Report Number(s): PNNL-SA-125369
• Journal Information: Lecture Notes in Computer Science, Vol. 10417, Issue none; Conference: 23rd International Conference on Parallel and Distributed Computing (Euro-Par 2017), Santiago de Compostela, Spain., August 28-September 1, 2017; Related Information: 10417:428-441; ISSN 0302-9743
• Publisher: Springer
• Country of Publication: United States
• Language: English

Related Subjects

Single-Source Shortest Paths (SSSP)
distributed-memory graph algorithms