The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, andarXiv:1104.4518v2 fatcat:a7nvtwil35dbtohgpnsfldeeki