Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-04-22
Proceedings of The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 2011)
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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, and a two-dimensional sparse matrix-partitioning-based approach that mitigates parallel communication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execution regimes in which these approaches will be competitive, and we demonstrate extremely high performance on leading distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny-Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.
Buluc Aydin
Madduri Kamesh
No associations
LandOfFree
Parallel Breadth-First Search on Distributed Memory Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Breadth-First Search on Distributed Memory Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Breadth-First Search on Distributed Memory Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-483799