Sciweavers

PPOPP
2012
ACM

Massively parallel breadth first search using a tree-structured memory model

11 years 11 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be used to perform breadth-first search of large undirected graphs. Overall, the computation can be expressed as a data flow process wherein a set of vertices to be searched is partitioned into a set of sub-domains and processed independently by many concurrent tasks. The main contributions of the paper are listed below. • We present the first case study demonstrating the power of the Fresh Breeze program execution model (PXM) in the exploitation of fine-grain parallelism found in irregular applications such as graph algorithms. • We present a novel parallel breadth-first search algorithm which is fully determinate. • We describe a unique sparse vector representation that represents the set of adjacencies for each vertex. • We provide an experimental study and analysis of our implementation. An est...
Tom St. John, Jack B. Dennis, Guang R. Gao
Added 25 Apr 2012
Updated 25 Apr 2012
Type Journal
Year 2012
Where PPOPP
Authors Tom St. John, Jack B. Dennis, Guang R. Gao
Comments (0)