An efficient block-oriented approach to parallel sparse Cholesky factorization

The authors explore the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over more traditional column-oriented and panel-oriented decompositions. However, little progress has been made in producing a practical sub-block method. The authors propose and evaluate an approach that is simple to implement, provides slightly higher performance than column (and panel) methods on small parallel machines, and has the potential to provide much higher performance on large parallel machines.

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

[2]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[3]  Robert Schreiber,et al.  A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.

[4]  Mark A. Johnson,et al.  Solving problems on concurrent processors. Vol. 1: General techniques and regular problems , 1988 .

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

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

[7]  Anoop Gupta,et al.  An Evaluation of Left-Looking, Right-Looking and Multifrontal Approaches to Sparse Cholesky Factorization on Hierarchical-Memory Machines , 1991, Int. J. High Speed Comput..

[8]  Vijay K. Naik,et al.  Effects of partitioning and scheduling sparse matrix factorization on communication and load balance , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[9]  Joseph W. H. Liu.  The role of elimination trees in sparse factorization , 1990 .

[10]  Robert Francis Lucas,et al.  Solving planar systems of equations on distributed-memory multiprocessors , 1988 .

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

[12]  Anoop Gupta,et al.  The Stanford Dash multiprocessor , 1992, Computer.

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

[14]  A. George,et al.  Solution of sparse positive definite systems on a hypercube , 1989 .

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

[16]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[17]  Roger Grimes,et al.  The influence of relaxed supernode partitions on the multifrontal method , 1989, TOMS.

[18]  Anoop Gupta,et al.  Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations , 1990, Proceedings SUPERCOMPUTING '90.