Skip to main content

Parallel Numerical Algorithms for Distributed Memory Machines

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1999)

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

  • 399 Accesses

Abstract

Distributed memory machines consisting of multiple autonomous processors connected by a network are becoming commonplace. Unlike specialized machines like systolic arrays, such systems of autonomous processors provide virtual parallelism through standard message passing libraries (PVM[GBD+94], MPI [GLS94]). Their very high level of flexibility, scalability and performance has allowed many parallel algorithms to be designed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM: Parallel Virtual Machine A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press, year 1994.

    Google Scholar 

  2. William Gropp, Ewing Lusk, and Anthony Skjellum. Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press, year 1994.

    Google Scholar 

  3. J.H Moreno and T. Lang. Graph-based partitioning for matrix algorithms for systolic arrays: Application to transitive closure. ICPP, 1:28–31, 1988.

    Google Scholar 

  4. D.I Moldovan. On the design of algorithms for vlsi systolic arrays. Proc.IEEE, 71:113–120, 1983.

    Article  Google Scholar 

  5. W. L. Miranker and A. Winkler. Space-time representation of computational structures. Computing, 32:93–114, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Quinton. The systematic design of systolic arrays. Technical Report 193, IRISA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bassomo, P., Sakho, I., Corbel, A. (1999). Parallel Numerical Algorithms for Distributed Memory Machines. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-49164-3_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65641-8

  • Online ISBN: 978-3-540-49164-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics