✦ LIBER ✦

Communication results for parallel sparse Cholesky factorization on a hypercube

✍ Scribed by Alan George; Joseph W.H Liu; Esmond Ng

Book ID: 107919249
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 647 KB
Volume: 10
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(89)90101-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on communication analysis of para

A note on communication analysis of parallel sparse Cholesky factorization on a hypercube

✍ Feng Gao; Beresford N. Parlett 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Minimum communication cost reordering fo

Minimum communication cost reordering for parallel sparse Cholesky factorization

✍ Wen-Yang Lin; Chuen-Liang Chen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 279 KB

In this paper, we consider the problem of reducing the communication cost for the parallel factorization of a sparse symmetric positive de®nite matrix on a distributed-memory multiprocessor. We de®ne a parallel communication cost function and show that, with a contrived example, simply minimizing th

Task scheduling for parallel sparse Chol

Task scheduling for parallel sparse Cholesky factorization

✍ G. A. Geist; E. Ng 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 932 KB

A Mapping Algorithm for Parallel Sparse

A Mapping Algorithm for Parallel Sparse Cholesky Factorization

✍ Pothen, Alex; Sun, Chunguang 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 656 KB

Parallel sparse Cholesky factorization o

Parallel sparse Cholesky factorization on a shared memory multiprocessor

✍ G Zhang; H.C Elman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 766 KB

A parallel algorithm for sparse symbolic

A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor

✍ Earl Zmijewski; John R Gilbert 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 829 KB