TY - GEN

T1 - An experimental study of a parallel shortest path algorithm for solving large-scale graph instances

AU - Madduri, Kamesh

AU - Bader, David A.

AU - Jonathan, W. Berry

AU - Crobak, Joseph R.

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2007

Y1 - 2007

N2 - We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs using the △-stepping parallel algorithm, We report performance results on the Cray MTA-2, a multithreaded parallel computer. The MTA-2 is a high-end shared memory system offering two unique features that aid the efficient parallel implementation of irregular algorithms: the ability to exploit fine-grained parallelism, and low-overhead synchronization primitives. Our implementation exhibits remarkable parallel speedup when compared with competitive sequential algorithms, for low-diameter sparse graphs. For instance, △-stepping on a directed scalefree graph of 100 million vertices and 1 billion edges takes less than ten seconds on 40 processors of the MTA-2, with a relative speedup of close to 30. To our knowledge, these are the first performance results of a shortest path problem on realistic graph instances in the order of billions of vertices and edges.

AB - We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs using the △-stepping parallel algorithm, We report performance results on the Cray MTA-2, a multithreaded parallel computer. The MTA-2 is a high-end shared memory system offering two unique features that aid the efficient parallel implementation of irregular algorithms: the ability to exploit fine-grained parallelism, and low-overhead synchronization primitives. Our implementation exhibits remarkable parallel speedup when compared with competitive sequential algorithms, for low-diameter sparse graphs. For instance, △-stepping on a directed scalefree graph of 100 million vertices and 1 billion edges takes less than ten seconds on 40 processors of the MTA-2, with a relative speedup of close to 30. To our knowledge, these are the first performance results of a shortest path problem on realistic graph instances in the order of billions of vertices and edges.

UR - http://www.scopus.com/inward/record.url?scp=34547953707&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547953707&partnerID=8YFLogxK

U2 - 10.1137/1.9781611972870.3

DO - 10.1137/1.9781611972870.3

M3 - Conference contribution

AN - SCOPUS:34547953707

SN - 0898716284

SN - 9780898716283

T3 - Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

SP - 23

EP - 35

BT - Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

PB - Society for Industrial and Applied Mathematics Publications

T2 - 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics

Y2 - 6 January 2007 through 6 January 2007

ER -