A mapping algorithm for parallel sparse Cholesky factorization
Journal Article
·
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
- Univ. of Waterloo, Ontario (Canada)
- Cornell Univ., Ithaca, NY (United States). Advanced Computing Research Inst.
A task-to-processor mapping algorithm is described for computing the parallel multifrontal Cholesky factorization of irregular sparse problems on distributed-memory multiprocessor. The performance of the mapping algorithm is compared with the only general mapping algorithm previously reported. Using this mapping, the distributed multifrontal algorithm is nearly as efficient on a collection of problems with irregular sparsity structure as it is for the regular grid problems.
- OSTI ID:
- 6107258
- Journal Information:
- SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States), Journal Name: SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States) Vol. 14:5; ISSN 0196-5204; ISSN SIJCD4
- Country of Publication:
- United States
- Language:
- English
Similar Records
Highly parallel sparse Cholesky factorization
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Technical Report
·
Wed Aug 01 00:00:00 EDT 1990
·
OSTI ID:6204789
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
Journal Article
·
Thu Jul 01 00:00:00 EDT 1993
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:7369124
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Conference
·
Wed Jul 01 00:00:00 EDT 1992
·
OSTI ID:10159845