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.
Preview
Unable to display preview. Download preview PDF.
References
X.H. Sun and D.T. Rover, “Scalability of Parallel Algorithm-Machine Combinations,” IEEE Trans. Parallel Distrib. Systems. 5, 599–613 (1994).
V. Kumar and A. Gupta, “Analyzing Scalability of Parallel Algoritms and Architectures,” J. Parallel Distrib. Computing 22, 379–391 (1994).
W. Ware, “The ultimate computer,” IEEE Spectrum 9, 84–91 (1972).
G. Amdahl, “Validity of the single processor approach to achieving large scale computing capabilities,” in Proc. AFIPS Conference, 1967, pp. 483–485.
J.L. Gustafson, “Reevaluating Amdahl's Law,” Communications of the ACM 31, 532–533 (1988).
X.H. Sun and L.M. Ni, “Scalable Problems and Memory-Bounded Speedup,” J. Parallel Distrib. Comput. 19, 27–37 (1993).
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).
Author information
Authors and Affiliations
Editor information
Rights 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