Designing multithreaded algorithms for Breadth-First Search and si-connectivity on the Cray MTA-2

David A. Bader, Kamesh Madduri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

147 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationICPP 2006
Subtitle of host publicationProceedings of the 2006 International Conference on Parallel Processing
Pages523-530
Number of pages8
DOIs
StatePublished - Dec 1 2006
EventICPP 2006: 2006 International Conference on Parallel Processing - Columbus, OH, United States
Duration: Aug 14 2006Aug 18 2006

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Other

OtherICPP 2006: 2006 International Conference on Parallel Processing
CountryUnited States
CityColumbus, OH
Period8/14/068/18/06

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering(all)

Fingerprint Dive into the research topics of 'Designing multithreaded algorithms for Breadth-First Search and si-connectivity on the Cray MTA-2'. Together they form a unique fingerprint.

Cite this