Skip to main content
SpringerLink
Log in

Memory efficiency of parallel programs and memory bounded speedup

  • 3. Computer Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1998)

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

Included in the following conference series:

Abstract

We introduce the concept of memory efficiency of a parallel program. Memory efficiency is a measure of the amount of data replication in a parallel program. It describes how well a parallel program is equipped to exploit the available memory in (distributed memory) parallel computers, and whether a parallel program is scalable in its memory usage. We apply memory efficiency in the memory bounded speedup model as introduced by Sun and Ni. We show how the memory efficiency concept simplifies the analysis of the memory bounded speedup model.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. X.H. Sun and D.T. Rover, “Scalability of Parallel Algorithm-Machine Combinations,” IEEE Trans. Parallel Distrib. Systems. 5, 599–613 (1994).

    Google Scholar 

  2. V. Kumar and A. Gupta, “Analyzing Scalability of Parallel Algoritms and Architectures,” J. Parallel Distrib. Computing 22, 379–391 (1994).

    Google Scholar 

  3. W. Ware, “The ultimate computer,” IEEE Spectrum 9, 84–91 (1972).

    Google Scholar 

  4. G. Amdahl, “Validity of the single processor approach to achieving large scale computing capabilities,” in Proc. AFIPS Conference, 1967, pp. 483–485.

    Google Scholar 

  5. J.L. Gustafson, “Reevaluating Amdahl's Law,” Communications of the ACM 31, 532–533 (1988).

    Google Scholar 

  6. X.H. Sun and L.M. Ni, “Scalable Problems and Memory-Bounded Speedup,” J. Parallel Distrib. Comput. 19, 27–37 (1993).

    Google Scholar 

  7. G.C. Fox, S.W. Otto, and A.J.G. Hey, “Matrix algorithms on a hypercube I: Matrix multiplication,” Parallel Computing 4, 17–31 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of Indonesia, Kampus UI, Depok, Depok, Indonesia

    M. A. Kartawidjaja

  2. Parallel Scientific Computing and Simulation group, Faculty of Mathematics and Computer Science, University of Amsterdam, Kruislaan 403, 1098, SJ Amsterdam, the Netherlands

    A. G. Hoekstra

Authors
  1. M. A. Kartawidjaja
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Hoekstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kartawidjaja, M.A., Hoekstra, A.G. (1998). Memory efficiency of parallel programs and memory bounded speedup. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037204

Download citation

  • DOI: https://doi.org/10.1007/BFb0037204

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation