Abstract
This paper uses a graph-theoretic approach to analyse the performances of several parallel variations of the Gaussian triangularization algorithm on an MIMD computer. Dongarra et al. [DGK] have studied various parallel implementations of this method for a vector pipeline machine. We obtain complexity results permitting to select among these parallel algorithms.
This work has been supported by the CNRS through the GRECOC3.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. COSNARD, Y. ROBERT, D. TRYSTRAM, Résolution parallèle de systèmes linéaires denses par diagonalisation, Bulletin EDF série C, no 2, 1986
M. COSNARD, Y. ROBERT, D. TRYSTRAM, Comparaison des méthodes parallèles de diagonalisation pour la résolution de systèmes linéaires denses, C. R. A. S. Paris 301, I, 16, 1985, 781–784
M. COSNARD, J.M. MULLER, Y. ROBERT, D. TRYSTRAM, Communication costs versus computation costs in parallel Gaussian elimination, Proc. of Conf. Parallel Algorithms and Architectures, M. Cosnard et al. eds, North Holland, to appear
J.J. DONGARRA, F.G. GUSTAVSON, A. KARP, Implementing linear algebra algorithms for dense matrices on a vector pipeline machine, SIAM Review 26, 1, 1984, 91–112
M. FEILMEIER, Parallel computers — Parallel mathematics, IMACS North Holland, 1977
M.J. FLYNN, Very high-speed computing systems, Proc. IEEE 54, 1966, 1901–1909
D.D. GAJSKI, J.K. PEIR, Essential issues in multiprocessors systems, IEEE Computer, June 1985, 9–27
G. H. GOLUB, C. F. VAN LOAN, Matrix computation, The Johns Hopkins University Press, 1983
D. HELLER, A survey of parallel algorithms in numerical linear algebra, SIAM Review 20, 1978, 740–777
R.W. HOCKNEY, C.R. JESSHOPE, Parallel computers: architectures, programming and algorithms, Adam Helger, Bristol, 1981
K. HWANG, F. BRIGGS, Parallel processing and computer architecture, MC Graw Hill, 1984
S.P. KUMAR, Parallel algorithms for solving linear equations on MIMD computers, PhD. Thesis, Washington State University, 1982
S.P. KUMAR, J.S. KOWALIK, Parallel factorization of a positive definite matrix on an MIMD computer, Proc. ICCD 84, 410–416
R.E. LORD, J.S. KOWALIK, S.P. KUMAR, Solving linear algebraic equations on an MIMD computer, J. ACM 30, 1, 1983, 103–117
G. ROTE, Personnal Communication
Y. SAAD, Communication complexity of the Gaussian elimination algorithm on multiprocessors, Report DCS/348, Yale University, 1985
A. SAMEH, An overview of parallel algorithms, Bulletin EDF, 1983, 129–134
U. SCHENDEL, Introduction to Numerical Methods for Parallel Computers, Ellis Horwood Series, J. Wiley & Sons, New York, 1984
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cosnard, M., Marrakchi, M., Robert, Y., Trystram, D. (1986). Gauss elimination algorithms for mimd computers. In: Händler, W., Haupt, D., Jeltsch, R., Juling, W., Lange, O. (eds) CONPAR 86. CONPAR 1986. Lecture Notes in Computer Science, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16811-7_177
Download citation
DOI: https://doi.org/10.1007/3-540-16811-7_177
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16811-9
Online ISBN: 978-3-540-44856-3
eBook Packages: Springer Book Archive