Abstract
Parallel programming is elusive. The relative performance of different parallel implementations varies with machine architecture, system and problem size. How to compare different implementations over a wide range of machine architectures and problem sizes has never been well addressed due to its difficulty. Scalability has been proposed in recent years to reveal scaling properties of parallel algorithms and machines. In this paper, based on scalability analysis, the concepts of crossing point analysis and range comparison are introduced. Crossing point analysis finds slow/fast performance crossing points of parallel algorithms and machines. Range comparison compares performance over a wide range of ensemble and problem size via scalability and crossing point analysis. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP2 parallel computer. Experimental and theoretical results show the combination of scalability, crossing point analysis, and range comparison provides a practical solution for scalable performance evaluation. While our testings are conducted on homogeneous parallel computers, the proposed methodology applies to heterogeneous and network computing as well.
Preview
Unable to display preview. Download preview PDF.
References
Grama, A. Y., Gupta, A., and Kumar, V. Isoefficiency: Measuring the Scalability of parallel algorithms and architectures. IEEE Parallel & Distributed Technology 1, 3 (Aug. 1993), 12–21.
Gustafson, J. Reevaluating Amdahl's law. Communications of the ACM 31 (May 1988), 532–533.
Hwang, K.Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
Sahni, S., And Thanvantri, V. Performance metrics: Keeping the focus on runtime. IEEE Parallel & Distributed Technology (Spring 1996), 43–56.
Sun, X.-H. Application and accuracy of the parallel diagonal dominant algorithm. Parallel Computing (Aug. 1995), 1241–1267.
Sun, X.-H. The relation of scalability and execution time. In Proc. of the International Parallel Processing Symposium'96 (April 1996).
Sun, X.-H. Scalability versus execution time in scalable systems. Louisiana State University, Computer Science TR-97-003, 1997.
Sun, X.-H., and Rover, D. Scalability of parallel algorithm-machine combinations. IEEE Transactions on Parallel and Distributed Systems (June 1994), 599–613.
Sun, X.-H., and Zhu, J. Performance considerations of shared virtual memory machines. IEEE Transactions on Parallel and Distributed Systems (Nov. 1995), 1185–1194.
Sun, X.-H., and Zhu, J. Performance prediction: A case study using a scalable shared-virtual-memory machine. IEEE Parallel & Distributed Technology (Winter 1996),36–49.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, XH. (1998). Performance range comparison via crossing point analysis. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_768
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_768
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive