Parallel Cholesky factorization on orthogonal multiprocessors
From MaRDI portal
The author presents the parallel Cholesky factorization algorithm on orthogonal multiprocessors. Two data allocation strategies --- simple and uniform --- are considered. Three theorems are proved in this context. Studying the asymptotic efficiency, the author shows when each of the strategies should be used.
Recommendations
- Near optimal Cholesky factorization on orthogonal multiprocessors.
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- scientific article; zbMATH DE number 434521
Cited in
(9)- Parallel Cholesky factorization on a shared-memory multiprocessor
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
- Efficient and optimal parallel algorithms for Cholesky decomposition
- Near optimal Cholesky factorization on orthogonal multiprocessors.
- scientific article; zbMATH DE number 434521 (Why is no real title available?)
- An orthogonal multiprocessor for parallel scientific computations
- scientific article; zbMATH DE number 720649 (Why is no real title available?)
- Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
This page was built for publication: Parallel Cholesky factorization on orthogonal multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186181)