Distributed-Memory Breadth-First Search on Massive Graphs. IN: Parallel Graph Algorithms

Book · Tue Sep 26 00:00:00 EDT 2017

OSTI ID:1398519

Buluc, Aydin ^[1]; Beamer, Scott ^[2]; Madduri, Kamesh ^[3]; Asanovic, Krste ^[2]; Patterson, David ^[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.

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.

• Research Organization: Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
• Sponsoring Organization: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Science Foundation (NSF)
• DOE Contract Number: AC02-05CH11231; ACI-1253881
• OSTI ID: 1398519
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING