TY - GEN
T1 - Designing multithreaded algorithms for Breadth-First Search and si-connectivity on the Cray MTA-2
AU - Bader, David A.
AU - Madduri, Kamesh
PY - 2006
Y1 - 2006
N2 - Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence in recent years for applications involving large-scale networks. In this paper, we present fast parallel implementations of three fundamental graph theory problems, Breadth-First Search, st-connectivity and shortest paths for unweighted graphs, on multithreaded architectures such as the Cray MTA-2. The architectural features of the MTA-2 aid the design of simple, scalable and high-performance graph algorithms. We test our implementations on large scale-free and sparse random graph instances, and report impressive results, both for algorithm execution time and parallel performance. For instance, Breadth-First Search on a scale-free graph of 400 million vertices and 2 billion edges takes less than 5 seconds on a 40-processor MTA-2 system with an absolute speedup of close to 30. This is a significant result in parallel computing, as prior implementations of parallel graph algorithms report very limited or no speedup on irregular and sparse graphs, when compared to the best sequential implementation.
AB - Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence in recent years for applications involving large-scale networks. In this paper, we present fast parallel implementations of three fundamental graph theory problems, Breadth-First Search, st-connectivity and shortest paths for unweighted graphs, on multithreaded architectures such as the Cray MTA-2. The architectural features of the MTA-2 aid the design of simple, scalable and high-performance graph algorithms. We test our implementations on large scale-free and sparse random graph instances, and report impressive results, both for algorithm execution time and parallel performance. For instance, Breadth-First Search on a scale-free graph of 400 million vertices and 2 billion edges takes less than 5 seconds on a 40-processor MTA-2 system with an absolute speedup of close to 30. This is a significant result in parallel computing, as prior implementations of parallel graph algorithms report very limited or no speedup on irregular and sparse graphs, when compared to the best sequential implementation.
UR - http://www.scopus.com/inward/record.url?scp=34547399946&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547399946&partnerID=8YFLogxK
U2 - 10.1109/ICPP.2006.34
DO - 10.1109/ICPP.2006.34
M3 - Conference contribution
AN - SCOPUS:34547399946
SN - 0769526365
SN - 9780769526362
T3 - Proceedings of the International Conference on Parallel Processing
SP - 523
EP - 530
BT - ICPP 2006
T2 - ICPP 2006: 2006 International Conference on Parallel Processing
Y2 - 14 August 2006 through 18 August 2006
ER -