Abstract
Program environments are now commonly used for parallelism on networks of workstations. That is the reason why there is a need for simple and consistent tools to measure algorithm performance on heterogeneous networks. In this work we propose a generalization to heterogeneous networks of the classical efficiency formula E(N)=S(N)/N, where S(N) is the speedup on N processors.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Amdahl, Validity of the single-processor approach to achieving large scal computing capabilities., in IAFIPS Conference Proceedings, D. Evans, G. Joubert, and H. Liddell, eds., vol. 30, AFIPS press, 1967, pp. 483–485.
M. Atallah, C. Black, D. Marinescu, H. Siegel, and T. Casavant, Models and Algorithms for coscheduling compute-intensive tasks on a network of workstations, J. Parallel Distrib. Comput., 16 (1992).
P. Bastien and F. Ménard, On the Interpretation of Polarization Maps of Young Stellar Objects., Ap. J., 326 (1988), pp. 334–338.
-, Parameters of Disks Around Young Stellar Objects from Polarization Observations., Ap. J., 364 (1990), pp. 232–241.
D. Bradley and J. Larson, A parallelism-based analytic approach to performance evaluation using application programs, Proc. IEEE, 81 (1993), pp. 1126–1135.
R. Bulter and E. Lusk, User's Guide to the p4 Programming System, Tech. Rep. ANL-92/17, Argonne National Laboratory, 1992.
C. Cap and V. Strumpen, The Parform: A High Performance Platform for Parallel Computing in Distributed Workstation Environment, tech. rep., Institut für Informatik, UniversitÄt Zürich, 1992.
L. Colombet, L. Desbat, and F. Ménard, Star Modeling on IBM RS6000 Networks using PVM, in HPDC2, 1993, pp. 121–128.
D. Delesalle, L. Desbat, and D. Trystram, Résolution de grands systèmes linéaires creux par méthodes itératives parallèles, RAIRO-M2AN, 27 (1993), pp. 651–671.
V. Donaldson, F. Berman, and R. Paturi, Program Speedup in a Heterogeneous Computing Network, Journal of Parallel and Distributed Computing, 21 (1994), pp. 316–322.
J. Dongarra et al., A Users' Guide to PVM Parallel Virtual Machine, Oak Ridge National Laboratory, July 1991.
D. Fischer, On superlinear speedups., Parallel Computing, 17 (1991), pp. 695–697.
T. Freeman and C. Phillips, Parallel Numerical Algorithms, Prentice Hall, 1992.
G. A. Geist and V. S. Sunderam, Network Based Concurrent Computing on the PVM System. Oak Ridge National Laboratory and Emory University Atlanta, 1992.
J. Gustafson, Reevaluating amdahl's law, Communications of the ACM, 31 (1988).
Hockney and Jesshope, Parallel Computers, Adam Higler, Bristol and Philadelphia, 1988.
R. Hockney, Performance parameters and benchmarking of supercomputers., Parallel Computing, 17 (1991), pp. 1111–1130.
L. Kale, The CHARM (3.2) Programming Language Manual, tech. rep., University of Illinois at Urbana Champaign, (e-mail: kale@cs.uiuc.edu), Dec. 1992.
T. Lewis and H. El-Rewini, Introduction to Parallel Computing, Prentice-Hall, 1992.
M. Sakarovitch, Graphes et programmation linéaire, Hermann, 1984.
H. Stone, High-Performance Computer Architecture, Addison&Wesley, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colombet, L., Desbat, L. (1996). Speedup and efficiency of large size applications on heterogeneous networks. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024762
Download citation
DOI: https://doi.org/10.1007/BFb0024762
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive