Abstract
At present, there exist at least two problems in parallel computing:
-
1
Lack of a unifying parallel computing model Although many parallel computation models are proposed, such as PRAM [7], BSP [19], logP [3], C3 [11] etc., parallel computing has no acceptably accurate model whose algorithms run as well on the model as on a real parallel computer.
-
2
Lack of appropriate performance metrics Without a unifying parallel computing model, users cannot consider a parallel algorithm independently of the architecture for which it is designed. Performance metrics for parallel algorithms consequently are tied to the target parallel architectures, thus it becomes very complicated to evaluate the performance of parallel algorithms and parallel computers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G.M. Amdahl, Validity of the single-processor approach to achieving large scale computing capabilities, In: Proc. of AFIPS Conf., 1967, 483–485.
M. Barton and G. Withers, Computing performance as a function of the speed, quantity, and cost of the processors, In: Proc. of Supercomputing89, 1989, 759–764.
D. E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, LogP: Towards a realistic model of parallel computation. In: Proc. of 4th ACM SIGPLAN Symp. On Principles & Practices of Parallel Programming, 1993, 1–12.
V. Donaldson, F. Berman, and R. Paturi, Program speedup in a heterogeneous computing network, Journal of Parallel and Distributed Computing 21, 1994, 316–3
D. Eager, J. Zahorjan and E. Lazowska, Speedup versus efficiency in parallel system, IEEE Trans. Computer, March 1989, 403–423.
H.P. Flatt and K. Kennedy, Performance of parallel processors, Parallel Computing 12, 1989, 1–
S. Fortune and J. Wyllie, Parallelism in random access machines, In: Proc. of 10th Annual Symposium on Theory of Computing, 1978, 114–118.
R.F. Freund, Optimal selection theory for superconcurrency, In: Proc. of Supercomputing 89, Reno, NV. 1989.
J. Gustafson, Reevaluating Amdahl’s law, Communication of the ACM, Vol.31, No.5, May 1988.
J. Gustafson, G.R. Montry, and R.E. Benner, Development of parallel methods for a 1024-processor hypercube, SIAM Journal on Scientific and Statistical Computing, Vol.9, No.4. July 1988, 609–638.
S.E. Hambrusch and A.K. Khokhar, C 3: An architecture-independent model for coarse-grained parallel machines, Dept. of Computer Science, Purdue University, Nov. 1993.
Kai Hwang and Zhiwei Xu, Scalable Parallel Computing: Technology, Architecture, and Programming, WCB/McGraw-Hill, 1998.
D.I. Moldovan, Parallel Processing: From Applications to Systems, Morgan Kauf. Publ., 1993.
R.W. Moore, Distributing applications across wide area networks, In: Proc. Los Alamos Gigabit Testbed Workshop, Santa Fe. NM, Jan. 1990.
S. Sahni and V. Thanvantri, Performance metrics: keeping the focus on runtime, IEEE Parallel & Distributed Technology, Spring, 1996.
X.H. Sun and L. Ni, Another view on parallel speedup, In: Proc. Supercomputing90, New York, 1990, 324–333.
Sun and J.L. Gustafson, Toward a better parallel performance metric, Parallel Computing 17, 1991, 1093–11
X.H. Sun and L. Ni, Scalable problems and memory-bounded speedup, Journal of Parallel and Distributed Computing 19, 1993, 27–
L.G. Valiant, A bridging model for parallel computation, Communication of the ACM, 33(8), 1990.
F.A. Van-Catledge, Toward a general model for evaluating the relative performance of computer systems, International Journal Supercomputer Applications 3(2), 1989, 100–108.
M.-C. Wang, S.-D. Kim, M.A. Nichols, R.F. Freund, H.J. Siegel, and W.G. Nation, Augmenting the optimal selection theory for superconcurrency. In: Proc. of Workshop on Heterogeneous Processing, Beverly Hills, CA, Mar. 1992, 13–22.
P.T. Worley, The effect of time constraints on scaled speedup, SIAM Journal Scientific and Statistical Computing 11, Sep. 1990, 838–858.
Xingfu Wu, Scalable Parallel Computing Performance Models and Their Applications, Ph.D thesis, Beijing University of Aeronautics & Astronautics, 1996.
Xingfu Wu, An approach to parallel speedup models on cluster systems, In: Proc. of International Workshop on Computational Science and Engineering’97 (IWCSE’97), China, May 1997, 124–131.
Xingfu Wu and Wei Li, Performance models for scalable cluster computing, Journal of System Architectures, Elsevier Science B.V. (North-Holland), Vol. 44, No. 3, Dec. 1997, 189–205.
X. Zhou, Bridging the gap between Amdahl’s law and Sandia Laboratory’s result, Communication of the ACM 32, No. 8, 1989, 1024–1
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wu, X. (1999). Speedup. In: Performance Evaluation, Prediction and Visualization of Parallel Systems. The Kluwer International Series on Asian Studies in Computer and Information Science, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5147-8_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5147-8_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7343-8
Online ISBN: 978-1-4615-5147-8
eBook Packages: Springer Book Archive