✦ LIBER ✦

Data-Parallel Sparse Factorization

✍ Scribed by Conroy, John M.; Kratzer, Steven G.; Lucas, Robert F.; Naiman, Aaron E.

Book ID: 118188874
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 700 KB
Volume: 19
Category: Article
ISSN: 1064-8275
DOI: 10.1137/s1064827594276412

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel symbolic factorization of spars

Parallel symbolic factorization of sparse linear systems

✍ John R Gilbert; Hjálmtýr Hafsteinsson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 691 KB

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

Towards an accurate performance modeling

Towards an accurate performance modeling of parallel sparse factorization

✍ Laura Grigori; Xiaoye S. Li 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 407 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

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