Parallel breadth-first search on distributed memory systems


Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned parallel… (More)
DOI: 10.1145/2063384.2063471


7 Figures and Tables


Citations per Year

142 Citations

Semantic Scholar estimates that this publication has 142 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bulu2011ParallelBS, title={Parallel breadth-first search on distributed memory systems}, author={Aydin Buluç and Kamesh Madduri}, journal={2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)}, year={2011}, pages={1-12} }