71 research outputs found
A Parallel Solver for Graph Laplacians
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.Comment: PASC '18, Code: https://github.com/ligmg/ligm
Recommended from our members
Algebraic Multigrid(amg) for Graph Laplacian Linear Systems: Extensions of Amg for Signed, Undirected and Unsigned, Directed Graphs
Relational datasets are often modeled as an unsigned, undirected graph due the nice properties of the resulting graph Laplacian, but information is lost if certain attributes of the graph are not represented. This thesis presents two generalizations of Algebraic Multigrid (AMG) solvers with graph Laplacian systems for different graph types: applying Gremban’s expansion to extend unsigned graph Laplacian solvers to signed graph Laplacian systems and generalizing techniques in Lean Algebraic Multigrid (LAMG) to a new multigrid solver for unsigned, directed graph Laplacian systems.Signed graphs extend the traditional notion of connections and disconnections to in- clude both favorable and adverse relationships, such as friend-enemy social networks or social networks with “likes” and “dislikes.” Gremban’s expansion is used to transform the signed graph Laplacian into an unsigned graph Laplacian with twice the number of unknowns. By using Gremban’s expansion, we extend current unsigned graph Laplacian solvers’ to signed graph Laplacians. This thesis analyzes the numerical stability and applicability of Grem- ban’s expansion and proves that the error of the solution of the original linear system can be tightly bounded by the error of the expanded system.In directed graphs, some subset of relationships are not reciprocal, such as hyperlink graphs, biological neural networks, and electrical power grids. A new algebraic multigrid algorithm, Nonsymmetric Lean Algebraic Multigrid (NS-LAMG), is proposed, which uses ideas from Lean Algebraic Multigrid, nonsymmetric Smoothed Aggregation, and multigrid solvers for Markov chain stationary distribution systems. Low-degree elimination, intro- duced in Lean Algebraic Multigrid for undirected graphs, is redefined for directed graphs.A semi-adaptive multigrid solver, inspired by low-degree elimination, is instrumented in the setup phase, which can be adapted for Markov chain stationary distributions systems. Nu- merical results shows that NS-LAMG out performs GMRES(k) for real-world, directed graph Laplacian linear systems. Both generalizations enable more choices in modeling decisions for graph Laplacian systems.Due the successfulness of NS-LAMG and other various nonsymmetric AMG (NS-AMG) solvers, a further study of theoretical convergence properties are discussed in this thesis. In particular, a necessary condition known as “weak approximation property”, and a sufficient one, referred to as “strong approximation property” as well as the “super strong approx- imation property” are generalized to nonsymmetric matrices and the various relationships between the approximation properties are proved for the nonsymmetric case. In NS-AMG, if P ̸= R the two-grid error propagation operator for the coarse-grid correction is an oblique projection with respect to any reasonable norm, which can cause the error to increase. A main focal point of this paper is a discussion on the conditions in which the error propagation operator is bounded, as the stability of the error propagation operator and the approxima- tion properties play an important role in proving convergence of the two-grid method for NS-AMG, which was studied in [37]
Fast Iterative Solution of the Optimal Transport Problem on Graphs
In this paper, we address the numerical solution of the Optimal Transport
Problem on undirected weighted graphs, taking the shortest path distance as
transport cost. The optimal solution is obtained from the long-time limit of
the gradient descent dynamics. Among different time stepping procedures for the
discretization of this dynamics, a backward Euler time stepping scheme combined
with the inexact Newton-Raphson method results in a robust and accurate
approach for the solution of the Optimal Transport Problem on graphs. It is
found experimentally that the algorithm requires solving between
and linear systems involving weighted
Laplacian matrices, where is the number of edges. These linear systems are
solved via algebraic multigrid methods, resulting in an efficient solver for
the Optimal Transport Problem on graphs
Aggregation-based aggressive coarsening with polynomial smoothing
This paper develops an algebraic multigrid preconditioner for the graph
Laplacian. The proposed approach uses aggressive coarsening based on the
aggregation framework in the setup phase and a polynomial smoother with
sufficiently large degree within a (nonlinear) Algebraic Multilevel Iteration
as a preconditioner to the flexible Conjugate Gradient iteration in the solve
phase. We show that by combining these techniques it is possible to design a
simple and scalable algorithm. Results of the algorithm applied to graph
Laplacian systems arising from the standard linear finite element
discretization of the scalar Poisson problem are reported
HIGH-PERFORMANCE SPECTRAL METHODS FOR COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS
Recent research shows that by leveraging the key spectral properties of eigenvalues and eigenvectors of graph Laplacians, more efficient algorithms can be developed for tackling many graph-related computing tasks. In this dissertation, spectral methods are utilized for achieving faster algorithms in the applications of very-large-scale integration (VLSI) computer-aided design (CAD)
First, a scalable algorithmic framework is proposed for effective-resistance preserving spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original graph. Our framework is built upon the following three key components: a spectrum-preserving node aggregation and reduction scheme, a spectral graph sparsification framework with iterative edge weight scaling, as well as effective-resistance preserving post-scaling and iterative solution refinement schemes. We show that the resultant spectrally-reduced graphs can robustly preserve the first few nontrivial eigenvalues and eigenvectors of the original graph Laplacian and thus allow for developing highly-scalable spectral graph partitioning and circuit simulation algorithms.
Based on the framework of the spectral graph reduction, a Sparsified graph-theoretic Algebraic Multigrid (SAMG) is proposed for solving large Symmetric Diagonally Dominant (SDD) matrices. The proposed SAMG framework allows efficient construction of nearly-linear sized graph Laplacians for coarse-level problems while maintaining good spectral approximation during the AMG setup phase by leveraging a scalable spectral graph sparsification engine. Our experimental results show that the proposed method can offer more scalable performance than existing graph-theoretic AMG solvers for solving large SDD matrices in integrated circuit (IC) simulations, 3D-IC thermal analysis, image processing, finite element analysis as well as data mining and machine learning applications.
Finally, the spectral methods are applied to power grid and thermal integrity verification applications. This dissertation introduces a vectorless power grid and thermal integrity verification framework that allows computing worst-case voltage drop or thermal profiles across the entire chip under a set of local and global workload (power density) constraints. To address the computational challenges introduced by the large 3D mesh-structured thermal grids, we apply the spectral graph reduction approach for highly-scalable vectorless thermal (or power grids) verification of large chip designs. The effectiveness and efficiency of our approach have been demonstrated through extensive experiments
- …