A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Conference
·
OSTI ID:822956
- LBNL Library
In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of L' and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU{_}DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.
- Research Organization:
- Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
- Sponsoring Organization:
- USDOE Director. Office of Science. Computational and Technology Research (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 822956
- Report Number(s):
- LBNL--50520
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance analysis of parallel supernodal sparse LU factorization
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
A parallel algorithm for sparse unsymmetric LU factorization
Conference
·
Wed Feb 04 23:00:00 EST 2004
·
OSTI ID:822182
SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
Journal Article
·
Tue Mar 26 23:00:00 EST 2002
· ACM Transaction on Mathematical Software
·
OSTI ID:836786
A parallel algorithm for sparse unsymmetric LU factorization
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6037134