A scalable parallel algorithm for sparse Cholesky factorization

We describe a scalable parallel algorithm for sparse Cholesky factorization, analyze its performance and scalability, and present experimental results of its implementation on a 1024-processor nCUBE2 parallel computer. Through our analysis and experimental results, we demonstrate that our algorithm improves the state of the art in parallel direct solution of sparse linear systems by an order of magnitude, both in terms of speedups and the number of processors that can be utilized effectively for a given problem size. This algorithm incurs strictly less communication overhead and is more scalable than any known parallel formulation of sparse matrix factorization. We show that our algorithm is optimally scalable on hypercube and mesh architectures and that its asymptotic scalability is the same as that of dense matrix factorization for a wide class of sparse linear systems, including those arising in all two- and three-dimensional finite element problems.<<ETX>>

[1]  Cleve Ashcraft,et al.  The Fan-Both Family of Column-Based Distributed Cholesky Factorization Algorithms , 1993 .

[2]  Anoop Gupta,et al.  An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization , 1994, SIAM J. Sci. Comput..

[3]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[4]  Laurie A. Hulbert,et al.  Limiting Communication in Parallel Sparse Cholesky Factorization , 1991, SIAM J. Sci. Comput..

[5]  Joseph W. H. Liu,et al.  The Multifrontal Method for Sparse Matrix Solution: Theory and Practice , 1992, SIAM Rev..

[6]  G. Stewart,et al.  Assignment and scheduling in parallel matrix factorization , 1986 .

[7]  Cleve Ashcraft,et al.  A Fan-In Algorithm for Distributed Sparse Numerical Factorization , 1990, SIAM J. Sci. Comput..

[8]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .

[9]  Vipin Kumar,et al.  Isoefficiency: measuring the scalability of parallel algorithms and architectures , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[10]  Michael T. Heath,et al.  Parallel Algorithms for Sparse Linear Systems , 1991, SIAM Rev..

[11]  Michael T. Heath,et al.  Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .

[12]  E. Rothberg,et al.  Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[13]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[14]  Alex POTHENy,et al.  SPECTRAL NESTED DISSECTION , 1992 .

[15]  Vipin Kumar,et al.  A high performance sparse Cholesky factorization algorithm for scalable parallel computers , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[16]  Vijay K. Naik,et al.  Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems , 1989, ICS '89.

[17]  Alex Pothen,et al.  Distributed Multifrontal Factorization Using Clique Trees , 1991, SIAM Conference on Parallel Processing for Scientific Computing.

[18]  Alan George,et al.  Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..

[19]  Robert Schreiber,et al.  Scalability of Sparse Direct Solvers , 1993 .

[20]  Vipin Kumar,et al.  A Scalable Parallel Algorithm for Sparse Matrix Factorization , 1994 .

[21]  Vijay K. Naik,et al.  SHAPE: A Parallelization Tool for Sparse Matrix Computations , 1992 .

[22]  I. Duff,et al.  The factorization of sparse symmetric indefinite matrices , 1991 .

[23]  Vipin Kumar,et al.  A parallel formulation of interior point algorithms , 1994, Proceedings of Supercomputing '94.

[24]  Joseph W. H. Liu,et al.  A Comparison of Three Column-Based Distributed Sparse Factorization Schemes. , 1990 .

[25]  Lie Wang,et al.  Parallel Sparse Cholesky Factorization with Spectral Nested Dissection Ordering. Chapter 1 , 1994 .

[26]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[27]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[28]  K. A. Gallivan,et al.  Parallel Algorithms for Dense Linear Algebra Computations , 1990, SIAM Rev..

[29]  A. Gupta,et al.  An efficient block-oriented approach to parallel sparse Cholesky factorization , 1993, Supercomputing '93.

[30]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[31]  Robert F. Lucas,et al.  A Parallel Solution Method for Large Sparse Systems of Equations , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.