Analysis, tuning and comparison of two general sparse solvers for distributed memory computers
We describe the work performed in the context of a Franco-Berkeley funded project between NERSC-LBNL located in Berkeley (USA) and CERFACS-ENSEEIHT located in Toulouse (France). We discuss both the tuning and performance analysis of two distributed memory sparse solvers (superlu from Berkeley and mumps from Toulouse) on the 512 processor Cray T3E from NERSC (Lawrence Berkeley National Laboratory). This project gave us the opportunity to improve the algorithms and add new features to the codes. We then quite extensively analyze and compare the two approaches on a set of large problems from real applications. We further explain the main differences in the behavior of the approaches on artificial regular grid problems. As a conclusion to this activity report, we mention a set of parallel sparse solvers on which this type of study should be extended.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director, Office of Science. Office of Advanced Scientific Computing Research (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 776597
- Report Number(s):
- LBNL-45992; R&D Project: 618310; TRN: AH200118%%442
- Resource Relation:
- Other Information: PBD: 30 Jun 2000
- Country of Publication:
- United States
- Language:
- English
Similar Records
Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems