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.
Type de document :
Article dans une revue
Parallel Computing, Elsevier, 1988, 6 (3), pp.275-296. 〈10.1016/0167-8191(88)90070-1〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00857005
Contributeur : Equipe Roma <>
Soumis le : lundi 2 septembre 2013 - 17:52:58
Dernière modification le : jeudi 8 février 2018 - 11:09:26

Lien texte intégral

Identifiants

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〉

Partager

Métriques

Consultations de la notice

194