Name
Abstract | ||
|---|---|---|
This paper presents a new distributed-memory algorithm called FastSV for finding connected components in an undirected graph. Our algorithm simplifies the classic Shiloach-Vishkin algorithm and employs several novel and efficient hooking strategies for faster convergence. We map different steps of FastSV to linear algebraic operations and implement them with the help of scalable graph libraries. FastSV uses sparse operations to avoid redundant work and optimized MPI communication to avoid bottlenecks. The resultant algorithm shows high-performance and scalability as it can find the connected components of a hyperlink graph with over 134B edges in 30 seconds using 262K cores on a Cray XC40 supercomputer. FastSV outperforms the state-of-the-art algorithm by an average speedup of 2.21x (max 4.27x) on a variety of real-world graphs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1137/1.9781611976137.5 | PPSC |
DocType | Citations | PageRank |
Conference | 4 | 0.40 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhang Yongzhe | 1 | 4 | 0.40 |
| Ariful Azad | 2 | 138 | 15.71 |
| Zhenjiang Hu | 3 | 1341 | 99.25 |