Analysis and comparison of two general sparse solvers for distributed memory computers

1 December 2001

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software

Vol. 27 (4) , 388-421
https://doi.org/10.1145/504210.504212

Abstract

This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for large sparse sets of linear equations on large-scale distributed-memory computers. One is a multifrontal solver called MUMPS, the other is a supernodal solver called superLU. We describe the main algorithmic features of the two solvers and compare their performance characteristics with respect to uniprocessor speed, interprocessor communication, and memory requirements. For both solvers, preorderings for numerical stability and sparsity play an important role in achieving high parallel efficiency. We analyse the results with various ordering algorithms. Our performance analysis is based on data obtained from runs on a 512-processor Cray T3E using a set of matrices from real applications. We also use regular 3D grid problems to study the scalability of the two solvers.

Keywords

This publication has 19 references indexed in Scilit:

Design, implementation and testing of extended and mixed precision BLAS
ACM Transactions on Mathematical Software, 2002
Multifrontal parallel distributed symmetric and unsymmetric solvers
Computer Methods in Applied Mechanics and Engineering, 2000
Preconditioning Highly Indefinite and Nonsymmetric Matrices
SIAM Journal on Scientific Computing, 2000
Efficient sparse LU factorization with partial pivoting on distributed memory architectures
IEEE Transactions on Parallel and Distributed Systems, 1998
Highly scalable parallel algorithms for sparse matrix factorization
IEEE Transactions on Parallel and Distributed Systems, 1997
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications, 1996
Elimination Structures for Unsymmetric Sparse $LU$ Factors
SIAM Journal on Matrix Analysis and Applications, 1993
Memory Management Issues in Sparse Multifrontal Methods On Multiprocessors
The International Journal of Supercomputing Applications, 1993
Solving Sparse Linear Systems with Sparse Backward Error
SIAM Journal on Matrix Analysis and Applications, 1989
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software, 1985