A scalable parallel block algorithm for band Cholesky factorization
Conference
·
OSTI ID:125547
- IBM T.J. Watson Research Center, Yorktown Heights, NY (United States)
In this paper, we present an algorithm for computing the Cholesky factorization of large banded matrices on the IBM distributed memory parallel machines. The algorithm aims at optimizing the single node performance and minimizing the communication overheads. An important result of our paper is that the proposed algorithm is strongly scalable. As the bandwidth of the matrix increases, the number of processors that can be efficiently utilized has a quadratic relationship.
- OSTI ID:
- 125547
- Report Number(s):
- CONF-950212--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A scalable parallel algorithm for sparse Cholesky factorization
Optimally scalable parallel sparse Cholesky factorization
Highly parallel sparse Cholesky factorization
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87680
Optimally scalable parallel sparse Cholesky factorization
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125549
Highly parallel sparse Cholesky factorization
Technical Report
·
Wed Aug 01 00:00:00 EDT 1990
·
OSTI ID:6204789