Parallel Gaussian elimination on an MIMD computer (Q1096997)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4032906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Gaussian elimination on an MIMD computer |
scientific article; zbMATH DE number 4032906 |
Statements
Parallel Gaussian elimination on an MIMD computer (English)
0 references
1988
0 references
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 \textit{J. J. Dongarra}, \textit{F. G. Gustavson} and \textit{A. Karp} [SIAM Rev. 26, 91-112 (1984; Zbl 0539.65009)], as well as parallel versions of the \(LDM^ t\), \(LDL^ t\), 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.
0 references
parallel algorithms
0 references
Gaussian elimination
0 references
computational complexity
0 references
parallel Gaussian-like triangularization algorithms
0 references
MIMD computer
0 references
task graph models
0 references
asymptotic performances
0 references
0.8675233721733093
0 references
0.8329987525939941
0 references
