DMCA
Parallel breadth-first search on distributed memory systems (2011)
Cached
Download Links
| Citations: | 33 - 9 self |
BibTeX
@TECHREPORT{Buluç11parallelbreadth-first,
author = {Aydın Buluç and Kamesh Madduri},
title = {Parallel breadth-first search on distributed memory systems},
institution = {},
year = {2011}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 levelsynchronous 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. 1.
Keyphrases
distributed memory system parallel breadth-first search design space hybrid version intra-node multithreading graph-based computation breadth-first search several scientific application edge visit common vertex high performance bfs performance rate distributed-memory parallel system highly-tuned parallel approach skewed degree distribution parallel algorithm key subroutine two-dimensional sparse matrix partitioning-based approach large parallel system levelsynchronous strategy undirected graph amd magny-cours simple vertex-based partitioning several graph algorithm parallel communication overhead experimental study identifies 000-core parallel execution
