Sparse Cholesky factorization on a local-memory multiprocessor
SIAM Journal on Scientific and Statistical Computing
A fan-in algorithm for distributed sparse numerical factorization
SIAM Journal on Scientific and Statistical Computing
Task scheduling for parallel sparse Cholesky factorization
International Journal of Parallel Programming
Limiting communication in parallel sparse Cholesky factorization
SIAM Journal on Scientific and Statistical Computing
Parallel algorithms for sparse linear systems
SIAM Review
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
An efficient block-oriented approach to parallel sparse Cholesky factorization
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems
ICS '89 Proceedings of the 3rd international conference on Supercomputing
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
A parallel formulation of interior point algorithms
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
Distributed Multifrontal Factorization Using Clique Trees
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing
Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
IEEE Transactions on Parallel and Distributed Systems
Parallel multilevel k-way partitioning scheme for irregular graphs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
In this paper, 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.