Near optimal Cholesky factorization on orthogonal multiprocessors.

DOI10.1016/S0020-0190(02)00222-3MaRDI QIDQ1853099zbMATH OpenFDO

Authors Yanyan Li

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(02)00222-3

zbMATH Keywords

Cholesky factorizationOrthogonal multiprocessorsParallel algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Review text

The effect of data allocation strategies on the running time of parallel Cholesky factorization algorithms on orthogonal multiprocessors has been studied. Four new strategies which give better running time are proposed and their time complexities are analyzed. Finally it is shown that near optimal performance can be obtained using two of our strategies.

Recommendations

• Parallel Cholesky factorization on orthogonal multiprocessors
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Performance of parallel Cholesky factorization algorithms using BLAS

Cites work

• A collection of parallel linear equations routines for the Denelcor HEP
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Parallel Cholesky factorization on orthogonal multiprocessors

Cited in

(2)

• Parallel Cholesky factorization on orthogonal multiprocessors
• Supernodal symbolic Cholesky factorization on a local-memory multiprocessor

This page was built for publication: Near optimal Cholesky factorization on orthogonal multiprocessors.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853099)