skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Distributed-Memory Breadth-First Search on Massive Graphs

Abstract

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

Authors:
 [1];  [2];  [3];  [2];  [2]
  1. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division
  2. Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences
  3. Pennsylvania State Univ., University Park, PA (United States). Computer Science & Engineering Dept.
Publication Date:
Research Org.:
Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21); National Science Foundation (NSF)
OSTI Identifier:
1398519
Report Number(s):
arXiv:1705.04590
ark:/13030/qt3dr541g6
DOE Contract Number:
AC02-05CH11231; ACI-1253881
Resource Type:
Program Document
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Buluc, Aydin, Beamer, Scott, Madduri, Kamesh, Asanovic, Krste, and Patterson, David. Distributed-Memory Breadth-First Search on Massive Graphs. United States: N. p., 2017. Web.
Buluc, Aydin, Beamer, Scott, Madduri, Kamesh, Asanovic, Krste, & Patterson, David. Distributed-Memory Breadth-First Search on Massive Graphs. United States.
Buluc, Aydin, Beamer, Scott, Madduri, Kamesh, Asanovic, Krste, and Patterson, David. Tue . "Distributed-Memory Breadth-First Search on Massive Graphs". United States. doi:.
@article{osti_1398519,
title = {Distributed-Memory Breadth-First Search on Massive Graphs},
author = {Buluc, Aydin and Beamer, Scott and Madduri, Kamesh and Asanovic, Krste and Patterson, David},
abstractNote = {This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Sep 26 00:00:00 EDT 2017},
month = {Tue Sep 26 00:00:00 EDT 2017}
}

Program Document:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that may hold this item.

Save / Share: