Skip to main content
SpringerLink
Log in

Communication-Efficient Parallel Gaussian Elimination

  • Conference paper
Parallel Computing Technologies (PaCT 2003)

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

Included in the following conference series:

Abstract

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of two matrix problems: Gaussian elimination with pairwise pivoting, and orthogonal matrix decomposition by Givens rotations. We define a common framework that unifies both problems, and present a new communication-efficient BSP algorithm for their solution. Apart from being a useful addition to the growing collection of efficient BSP algorithms, our result can be viewed as a refinement of the classical “parallelism-communication tradeoff”.

Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., Chandra, A.K., Snir, M.: Communication complexity of PRAMs. Theoretical Computer Science 71(1), 3–28 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bunch, J.R., Hopcroft, J.E.: Triangular factorization and inversion by fast matrix multiplication. Mathematics of Computation 21(125), 231–236 (1974)

    Article  MathSciNet  Google Scholar 

  3. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  4. Calinescu, R., Evans, D.J.: Bulk-synchronous parallel algorithms for QR and QZ matrix factorisation. Parallel Algorithms and Applications 11, 97–112 (1997)

    Article  MathSciNet  Google Scholar 

  5. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cosnard, M., Daoudi, E.M.: Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM. Journal of the ACM 41(2), 399–421 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Demmel, J.W., Higham, N.J., Schreiber, R.S.: Block LU factorization. Numerical Linear Algebra with Applications 2(2) (1995)

    Google Scholar 

  8. Gallivan, K.A., Plemmons, R.J., Sameh, A.H.: Parallel algorithms for dense linear algebra computations. SIAM Review 32(1), 54–135 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Irony, D., Toledo, S.: Trading replication for communication in parallel distributed-memory dense solvers. Parallel Processing Letters 12, 79–94 (2002)

    Google Scholar 

  10. McColl, W.F.: Scalable computing. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 46–61. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. McColl, W.F.: A BSP realisation of Strassen’s algorithm. In: Kara, M., et al. (eds.) Abstract Machine Models for Parallel and Distributed Computing, pp. 43–46. IOS Press, Amsterdam (1996)

    Google Scholar 

  12. McColl, W.F.: Universal computing. In: Fraigniaud, P., Mignotte, A., Bougé, L., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 25–36. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  13. Modi, J.J.: Parallel Algorithms and Matrix Computation. Oxford Applied Mathematics and Computing Science Series. Clarendon Press, Oxford (1988)

    MATH  Google Scholar 

  14. Ortega, J.M.: Introduction to Parallel and Vector Solution of Linear Systems. Frontiers of Computer Science. Plenum Press, New York (1988)

    Book  MATH  Google Scholar 

  15. Sameh, A.H., Kuck, D.J.: On stable parallel linear system solvers. Journal of the ACM 25(1), 81–91 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schönhage, A.: Unitäre Transformationen großer Matrizen. Numerische Mathematik 20, 409–417 (1973)

    Article  MATH  Google Scholar 

  17. Sorensen, D.C.: Analysis of pairwise pivoting in Gaussian elimination. IEEE Transactions on Computers C-34(3), 274–278 (1985)

    Article  MathSciNet  Google Scholar 

  18. Tiskin, A.: Bulk-synchronous parallel Gaussian elimination. Journal of Mathematical Sciences 108(6), 977–991 (2002)

    Article  MathSciNet  Google Scholar 

  19. Valiant, L.G.: A bridging model for parallel computation. Communications of the ACM 33(8), 103–111 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Alexander Tiskin

Authors
  1. Alexander Tiskin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Novosibirsk State Technical University, Russia

    Victor E. Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiskin, A. (2003). Communication-Efficient Parallel Gaussian Elimination. In: Malyshkin, V.E. (eds) Parallel Computing Technologies. PaCT 2003. Lecture Notes in Computer Science, vol 2763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45145-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45145-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40673-0

  • Online ISBN: 978-3-540-45145-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation