Parallel Gaussian elimination on a MIMD computer - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Parallel Computing Year : 1988

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.

Dates and versions

hal-00857005 , version 1 (02-09-2013)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More