Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2

Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence for applications involving large-scale networks. In this paper, we present fast parallel implementations of three...

Full description

Saved in:
Bibliographic Details
Published in:2006 International Conference on Parallel Processing (ICPP'06) pp. 523 - 530
Main Authors: Bader, D.A., Madduri, K.
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.08.2006
Subjects:
Algorithm design and analysis
Clustering algorithms
Delay
Design optimization
Graph theory
High performance computing
Large-scale systems
Parallel processing
Scalability
Very large scale integration
ISBN:0769526365, 9780769526362
ISSN:0190-3918
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence 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
ISBN:0769526365
9780769526362
ISSN:0190-3918
DOI:10.1109/ICPP.2006.34