The open archive for STFC research publications

ePubs will be undergoing scheduled maintenance on 19/06/2024 between 10:00-12:00 and the service will be unavailable during this time.

Full Record Details

Persistent URL http://purl.org/net/epubs/work/29533
Record Status Checked
Record Id 29533
Title Analysis and comparison of two general sparse solvers for distributed memory computers
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.
Organisation CCLRC
Funding Information
Related Research Object(s): 32971
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2001-003. 2001. raltr-2001003.pdf 2001