A supernodal all-pairs shortest path algorithm

Sao, Piyush; Kannan, Ramakrishnan {ramki}; Gera, Prasun; Vuduc, Richard

doi:10.1145/3332466.3374533

A supernodal all-pairs shortest path algorithm

Conference · Fri Jan 31 23:00:00 EST 2020

DOI:https://doi.org/10.1145/3332466.3374533· OSTI ID:1648874

^[1]; ^[1]; Gera, Prasun ^[2]; Vuduc, Richard ^[3]

ORNL
Georgia Institute of Technology
Georgia Institute of Technology, Atlanta

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

View Conference

Research Organization:: Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Sponsoring Organization:: USDOE

DOE Contract Number:: AC05-00OR22725

OSTI ID:: 1648874

Country of Publication:: United States

Language:: English

References (27)

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications Federickson, Greg N. SIAM Journal on Computing, Vol. 16, Issue 6 https://doi.org/10.1137/0216064	journal	December 1987
Communication complexity of PRAMs Aggarwal, Alok; Chandra, Ashok K.; Snir, Marc Theoretical Computer Science, Vol. 71, Issue 1 https://doi.org/10.1016/0304-3975(90)90188-N	journal	March 1990
A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices Sao, Piyush; Li, Xiaoye Sherry; Vuduc, Richard 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) https://doi.org/10.1109/IPDPS.2018.00100	conference	May 2018
Faster All-Pairs Shortest Paths via Circuit Complexity Williams, R. Ryan SIAM Journal on Computing, Vol. 47, Issue 5 https://doi.org/10.1137/15M1024524	journal	January 2018
A Separator Theorem for Planar Graphs Lipton, Richard J.; Tarjan, Robert Endre SIAM Journal on Applied Mathematics, Vol. 36, Issue 2 https://doi.org/10.1137/0136016	journal	April 1979
Regular Algebra Applied to Path-finding Problems Backhouse, R. C.; CarrÉ, B. A. IMA Journal of Applied Mathematics, Vol. 15, Issue 2 https://doi.org/10.1093/imamat/15.2.161	journal	January 1975
A CPU–GPU hybrid approach for the unsymmetric multifrontal method Yu, Chenhan D.; Wang, Weichung; Pierce, Dan’l Parallel Computing, Vol. 37, Issue 12 https://doi.org/10.1016/j.parco.2011.09.002	journal	December 2011
An Algebra for Network Routing Problems CarrÉ, B. A. IMA Journal of Applied Mathematics, Vol. 7, Issue 3 https://doi.org/10.1093/imamat/7.3.273	journal	January 1971
Spectral partitioning works: planar graphs and finite element meshes Spielman, Daniel A. Proceedings of 37th Conference on Foundations of Computer Science https://doi.org/10.1109/SFCS.1996.548468	conference	January 1996
Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes Lacoste, Xavier; Faverge, Mathieu; Bosilca, George 2014 IEEE International Parallel & Distributed Processing Symposium Workshops https://doi.org/10.1109/IPDPSW.2014.9	conference	May 2014
All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters Djidjev, Hristo; Chapuis, Guillaume; Andonov, Rumen Journal of Parallel and Distributed Computing, Vol. 85 https://doi.org/10.1016/j.jpdc.2015.06.008	journal	November 2015
Computing the Girth of a Planar Graph in $O(n \logn)$ Time Weimann, Oren; Yuster, Raphael SIAM Journal on Discrete Mathematics, Vol. 24, Issue 2 https://doi.org/10.1137/090767868	journal	January 2010
All-Pairs Shortest Paths Computation in the BSP Model Tiskin, Alexandre Automata, Languages and Programming https://doi.org/10.1007/3-540-48224-5_15	book	January 2001
Multifrontal Factorization of Sparse SPD Matrices on GPUs George, Thomas; Saxena, Vaibhav; Gupta, Anshul 2011 IEEE International Parallel & Distributed Processing Symposium https://doi.org/10.1109/IPDPS.2011.44	conference	May 2011
Programming parallel algorithms Blelloch, Guy E. Communications of the ACM, Vol. 39, Issue 3 https://doi.org/10.1145/227234.227246	journal	March 1996
Highly scalable parallel algorithms for sparse matrix factorization Gupta, A.; Karypis, G.; Kumar, V. IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 5 https://doi.org/10.1109/71.598277	journal	May 1997
New Scheduling Strategies and Hybrid Programming for a Parallel Right-looking Sparse LU Factorization Algorithm on Multicore Cluster Systems Yamazaki, Ichitaro; Li, Xiaoye S. 2012 IEEE 26th International Parallel and Distributed Processing Symposium https://doi.org/10.1109/IPDPS.2012.63	conference	May 2012
Expander graphs and their applications Hoory, Shlomo; Linial, Nathan; Wigderson, Avi Bulletin of the American Mathematical Society, Vol. 43, Issue 04 https://doi.org/10.1090/S0273-0979-06-01126-8	journal	August 2006
Nested Dissection of a Regular Finite Element Mesh George, Alan SIAM Journal on Numerical Analysis, Vol. 10, Issue 2 https://doi.org/10.1137/0710032	journal	April 1973
Scheduling a Parallel Sparse Direct Solver to Multiple GPUs Kim, Kyungjoo; Eijkhout, Victor 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum https://doi.org/10.1109/IPDPSW.2013.26	conference	May 2013
Parallel Algorithms for Sparse Linear Systems Heath, Michael T.; Ng, Esmond; Peyton, Barry W. SIAM Review, Vol. 33, Issue 3 https://doi.org/10.1137/1033099	journal	September 1991
Subcubic Equivalences between Path, Matrix and Triangle Problems Williams, Virginia Vassilevska; Williams, Ryan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science https://doi.org/10.1109/FOCS.2010.67	conference	October 2010
Minimizing Communication in All-Pairs Shortest Paths Solomonik, Edgar; Buluc, Aydin; Demmel, James https://doi.org/10.21236/ADA580350	report	February 2013
On the dimension of a graph Erdös, Paul; Harary, Frank; Tutte, William T. Mathematika, Vol. 12, Issue 2 https://doi.org/10.1112/S0025579300005222	journal	December 1965
A Distributed CPU-GPU Sparse Direct Solver Sao, Piyush; Vuduc, Richard; Li, Xiaoye Sherry Lecture Notes in Computer Science https://doi.org/10.1007/978-3-319-09873-9_41	book	January 2014
High-speed graph analytics with the galois system Pingali, Keshav Proceedings of the first workshop on Parallel programming for analytics applications https://doi.org/10.1145/2567634.2567648	conference	February 2014
Solving path problems on the GPU Buluç, Aydın; Gilbert, John R.; Budak, Ceren Parallel Computing, Vol. 36, Issue 5-6 https://doi.org/10.1016/j.parco.2009.12.002	journal	June 2010

Similar Records

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

Conference · Mon Jun 01 00:00:00 EDT 2020 · OSTI ID:1814306

On finding supernodes for sparse matrix computations

Technical Report · Fri Jun 01 00:00:00 EDT 1990 · OSTI ID:6756314

Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

Journal Article · Thu Aug 14 00:00:00 EDT 2003 · Parallel Computing · OSTI ID:5456424

A supernodal all-pairs shortest path algorithm

Citation Formats

References (27)

Similar Records

Related Subjects