An efficient block-oriented approach to parallel sparse Cholesky factorization

Conference · Fri Dec 31 04:00:00 EST 1993

OSTI ID:46246

Rothberg, E ^[1]; Gupta, A ^[2]

---

1. Intel Supercomputer Systems Division, Beaverton, OR (United States)
2. Stanford Univ., CA (United States). Computer Systems Lab.

This paper explores the use of a sub-block decomposition strategy for parallel sparse Cholesky factorization, in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over more traditional column-oriented and panel-oriented decompositions. However, little progress has been made in producing a practical sub-block method. This paper proposes and evaluates an approach that is simple to implement, provides slightly higher performance than column (and panel) methods on small parallel machines, and has the potential to provide much higher performance on large parallel machines.

• OSTI ID: 46246
• Report Number(s): CONF-931115--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
ARRAY PROCESSORS
DATA TRANSMISSION
FACTORIZATION
MATRICES
PARALLEL PROCESSING
SUPERCOMPUTERS