Parallel Gaussian elimination on a MIMD computer

Abstract : This paper introduces a graph-theoretic approach to analyse the performances of several parallel Gaussian-like triangularization algorithms on an MIMD computer. We show that the SAXPY, GAXPY and DOT algorithms of Dongarra, Gustavson and Karp, as well as parallel versions of the LDMt, LDLt, Doolittle and Cholesky algorithms, can be classified into four task graph models. We derive new complexity results and compare the asymptotic performances of these parallel versions.
Complete list of metadatas

https://hal.inria.fr/hal-00857005
Contributor : Equipe Roma <>
Submitted on : Monday, September 2, 2013 - 5:52:58 PM
Last modification on : Saturday, March 30, 2019 - 1:32:37 AM

Links full text

Identifiers

Collections

Citation

Michel Cosnard, Mounir Marrakchi, Yves Robert, Denis Trystram. Parallel Gaussian elimination on a MIMD computer. Parallel Computing, Elsevier, 1988, 6 (3), pp.275-296. ⟨10.1016/0167-8191(88)90070-1⟩. ⟨hal-00857005⟩

Share

Metrics

Record views

254