Skip to main content

Gaussian elimination on message passing architecture

  • Session 6B: Parallel Numeric Methods
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 297))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. BROCHARD, Communication and control costs on loosely coupled multiprocessors, Preprint, Ecole Nationale des Ponts et Chaussées, 1986.

    Google Scholar 

  2. M. COSNARD, M. DAOUDI, B. TOURANCHEAU, Communication dans les Reseaux de Processeurs et Complexité d'Algorithmes, RR 636, IMAG Grenoble, 1986

    Google Scholar 

  3. M. COSNARD, M. MARRAKCHI, Y. ROBERT, D. TRYSTRAM, Parallel Gaussian elimination on an MIMD Computer, to appear in Parallel Computing

    Google Scholar 

  4. D. GANNON, J. VAN ROSENDALE, On the impact of communication in the design of parallel algorithms, IEEE T.C. 33, 12 (1984) 1180–1194

    Google Scholar 

  5. G.A. GEIST, Efficient parallel LU factorisation with pivoting on a hypercube multiprocessor, ORNL Preprint 6211 (1985)

    Google Scholar 

  6. G.A. GEIST, M.T. HEATH, Parallel Cholesky factorisation on a hypercube multiprocessor, ORNL Preprint 6190 (1985)

    Google Scholar 

  7. W.M. GENTLEMAN, Some complexity results for matrix computations on parallel processors, JACM 25, 1 (1978), 112–115

    Google Scholar 

  8. G.H. GOLUB, C.F. VAN LOAN, Matrix Computations, The John Hopkins Univ. Press, 1983

    Google Scholar 

  9. C.A.R. HOARE, Communicating Sequential Processes, Prentice Hall, Series in Computer Science (1985)

    Google Scholar 

  10. K. HWANG, F. BRIGGS, Parallel Processing and Computer Architecture, Mc Graw Hill 1984

    Google Scholar 

  11. I.C.F. IPSEN, Y. SAAD, M.H. SCHULTZ, Complexity of dense linear system solution on a multiprocessor ring, Lin. Alg. Appl. (1986).

    Google Scholar 

  12. R.E. LORD, J.S. KOWALIK, S.P. KUMAR, Solving linear algebraic equations on an MIMD computer, J. ACM 30 (1), 1983, p 103–117

    Google Scholar 

  13. D. ROWETH, Design and performance analysis of transputer arrays, J. Syst. Softw. 1,2 (1986) 21–22

    Google Scholar 

  14. Y. SAAD, Communication complexity of the Gaussian elimination algorithm on multiprocessors, Research report 348, Computer Science Dpt., Yale University (1985)

    Google Scholar 

  15. Y. SAAD, Gaussian elimination on hypercubes, in Parallel Algorithms and Architectures, Eds. M. Cosnard et all., North-Holland (1986) 5–18

    Google Scholar 

  16. Y. SAAD, M.H. SCHULTZ, Topological properties of hypercubes, Research Report 389, Computer Science Dpt., Yale University (1985)

    Google Scholar 

  17. D.C. SORENSEN, Analysis of pairwise pivoting in Gaussian elimination, MCS-TM-26, Argonne National Laboratory, 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

E. N. Houstis T. S. Papatheodorou C. D. Polychronopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cosnard, M., Tourancheau, B., Villard, G. (1988). Gaussian elimination on message passing architecture. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-18991-2_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18991-6

  • Online ISBN: 978-3-540-38888-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics