✦ LIBER ✦

Task scheduling for parallel sparse Cholesky factorization

✍ Scribed by G. A. Geist; E. Ng

Publisher: Springer
Year: 1989
Tongue: English
Weight: 932 KB
Volume: 18
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01407861

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Task scheduling using a block dependency

Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization

✍ Heejo Lee; Jong Kim; Sung Je Hong; Sunggu Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 608 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

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

Approximation algorithms for general par

Approximation algorithms for general parallel task scheduling

✍ Oh-Heum Kwon; Kyung-Yong Chwa 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot

Dynamic levelwise scheduling for sparse

Dynamic levelwise scheduling for sparse matrix factorization on vector computers

✍ M. Montagna; G.P. Granelli; G.T. Vuong; R. Chahine 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 755 KB

In this paper the problem of the efficient implementation of sparse matrix factorization on vector computers is considered. A fine-grain dynamic levelwise scheduling algorithm (DLSA) is proposed. DLSA takes into account the dependences between update operations, thus avoiding the recurrence problem.