Performance analysis of parallel supernodal sparse LU factorization
Conference
·
OSTI ID:822182
We investigate performance characteristics for the LU factorization of large matrices with various sparsity patterns. We consider supernodal right-looking parallel factorization on a bi-dimensional grid of processors, making use of static pivoting. We develop a performance model and we validate it using the implementation in SuperLU-DIST, the real matrices and the IBM Power3 machine at NERSC. We use this model to obtain performance bounds on parallel computers, to perform scalability analysis and to identify performance bottlenecks. We also discuss the role of load balance and data distribution in this approach.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Director. Office of Science. Computational and Technology Research (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 822182
- Report Number(s):
- LBNL-54497; R&D Project: KS1210; TRN: US200412%%466
- Resource Relation:
- Conference: PARA'04 Workshop on State-of-the-Art in Scientific Computing, Lyngby, Copenhagen (DK), 06/20/2004--06/23/2004; Other Information: PBD: 5 Feb 2004
- Country of Publication:
- United States
- Language:
- English
Similar Records
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
Conference
·
Tue Aug 20 00:00:00 EDT 2002
·
OSTI ID:822182
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Journal Article
·
Wed Mar 27 00:00:00 EST 2002
· ACM Transaction on Mathematical Software
·
OSTI ID:822182
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
Journal Article
·
Sat Jun 03 00:00:00 EDT 2017
· Parallel Computing
·
OSTI ID:822182
+1 more