A Parallel Solver for Graph Laplacians

Konolige, Tristan; Brown, Jed

doi:10.1145/3218176.3218227

A Parallel Solver for Graph Laplacians

Conference · Mon Jan 01 04:00:00 EST 2018

DOI:https://doi.org/10.1145/3218176.3218227· OSTI ID:1544266

Konolige, Tristan ^[1]; Brown, Jed ^[1]

University of Colorado, Boulder (United States)

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

🛈

OSTI does not have a digital full text copy available. For more information, please see document availability, search WorldCat, or search Google Scholar.

Research Organization:: Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)

Sponsoring Organization:: USDOE Office of Science (SC)

OSTI ID:: 1544266

Country of Publication:: United States

Language:: English

References (22)

A Maxent-Stress Model for Graph Layout Gansner, E. R.; North, S. IEEE Transactions on Visualization and Computer Graphics, Vol. 19, Issue 6 https://doi.org/10.1109/TVCG.2012.299	journal	June 2013
Scalable matrix computations on large scale-free graphs using 2D graph partitioning Boman, Erik G.; Devine, Karen D.; Rajamanickam, Sivasankaran Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13 https://doi.org/10.1145/2503210.2503293	conference	January 2013
Defining and evaluating network communities based on ground-truth Yang, Jaewon; Leskovec, Jure Knowledge and Information Systems, Vol. 42, Issue 1 https://doi.org/10.1007/s10115-013-0693-z	journal	October 2013
The university of Florida sparse matrix collection Davis, Timothy A.; Hu, Yifan ACM Transactions on Mathematical Software, Vol. 38, Issue 1 https://doi.org/10.1145/2049662.2049663	journal	November 2011
Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing Koutis, Ioannis; Miller, Gary L.; Tolliver, David Computer Vision and Image Understanding, Vol. 115, Issue 12 https://doi.org/10.1016/j.cviu.2011.05.013	journal	December 2011
The Combinatorial BLAS: design, implementation, and applications Buluç, Aydın; Gilbert, John R. The International Journal of High Performance Computing Applications, Vol. 25, Issue 4 https://doi.org/10.1177/1094342011403516	journal	May 2011
Spectral Graph Theory and its Applications Spielman, Daniel A. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) https://doi.org/10.1109/FOCS.2007.56	conference	October 2007
Four degrees of separation Backstrom, Lars; Boldi, Paolo; Rosa, Marco Proceedings of the 3rd Annual ACM Web Science Conference on - WebSci '12 https://doi.org/10.1145/2380718.2380723	conference	January 2012
Flexible Conjugate Gradients Notay, Yvan SIAM Journal on Scientific Computing, Vol. 22, Issue 4 https://doi.org/10.1137/S1064827599362314	journal	January 2000
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries Balay, Satish; Gropp, William D.; McInnes, Lois Curfman Modern Software Tools for Scientific Computing https://doi.org/10.1007/978-1-4612-1986-6_8	book	January 1997
Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems Vaněk, P.; Mandel, J.; Brezina, M. Computing, Vol. 56, Issue 3 https://doi.org/10.1007/BF02238511	journal	September 1996
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver Livne, Oren E.; Brandt, Achi SIAM Journal on Scientific Computing, Vol. 34, Issue 4 https://doi.org/10.1137/110843563	journal	January 2012
Recursive Krylov-based multigrid cycles Notay, Yvan; Vassilevski, Panayot S. Numerical Linear Algebra with Applications, Vol. 15, Issue 5 https://doi.org/10.1002/nla.542	journal	January 2008
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems Li, Xiaoye S.; Demmel, James W. ACM Transactions on Mathematical Software, Vol. 29, Issue 2 https://doi.org/10.1145/779359.779361	journal	June 2003
Four Degrees of Separation, Really Boldi, P.; Vigna, S. 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining https://doi.org/10.1109/ASONAM.2012.211	conference	August 2012
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling Amestoy, Patrick R.; Duff, Iain S.; L'Excellent, Jean-Yves SIAM Journal on Matrix Analysis and Applications, Vol. 23, Issue 1 https://doi.org/10.1137/S0895479899358194	journal	January 2001
Parallel multigrid smoothing: polynomial versus Gauss–Seidel Adams, Mark; Brezina, Marian; Hu, Jonathan Journal of Computational Physics, Vol. 188, Issue 2 https://doi.org/10.1016/S0021-9991(03)00194-3	journal	July 2003
Mathematical foundations of the GraphBLAS Kepner, Jeremy; Aaltonen, Peter; Bader, David 2016 IEEE High-Performance Extreme Computing Conference (HPEC), 2016 IEEE High Performance Extreme Computing Conference (HPEC) https://doi.org/10.1109/HPEC.2016.7761646	conference	September 2016
Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods Bell, Nathan; Dalton, Steven; Olson, Luke N. SIAM Journal on Scientific Computing, Vol. 34, Issue 4 https://doi.org/10.1137/110838844	journal	January 2012
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time Kelner, Jonathan A.; Orecchia, Lorenzo; Sidford, Aaron Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 https://doi.org/10.1145/2488608.2488724	conference	January 2013
Parallel Unsmoothed Aggregation Algebraic Multigrid Algorithms on GPUs Brannick, James; Chen, Yao; Hu, Xiaozhe Numerical Solution of Partial Differential Equations: Theory, Algorithms, and Their Applications https://doi.org/10.1007/978-1-4614-7172-1_5	book	January 2013
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems Spielman, Daniel A.; Teng, Shang-Hua Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 https://doi.org/10.1145/1007352.1007372	conference	January 2004

Similar Records

Algebraic multigrid for directed graph Laplacian linear systems (NS‐LAMG)

Journal Article · Tue Jan 30 19:00:00 EST 2018 · Numerical Linear Algebra with Applications · OSTI ID:1418882

Partitioning sparse matrices with eigenvectors of graphs

Journal Article · Sun Jul 01 00:00:00 EDT 1990 · SIAM Journal on Matrix Analysis and Applications · OSTI ID:6696852

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

Journal Article · Wed Oct 25 20:00:00 EDT 2017 · SIAM Journal on Scientific Computing · OSTI ID:1438732

A Parallel Solver for Graph Laplacians

Citation Formats

References (22)

Similar Records

Related Subjects