research-article

Scalability versus Execution Time in Scalable Systems

Author:

Xian-He SunAuthors Info & Claims

Journal of Parallel and Distributed Computing, Volume 62, Issue 2

Pages 173 - 192

https://doi.org/10.1006/jpdc.2001.1773

Published: 01 February 2002 Publication History

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 not 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, the relation between scalability and execution time is carefully studied. 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 how the combination of scalability, crossing point analysis, and range comparison provides a practical solution for scalable performance evaluation and prediction. While our testings are conducted on homogeneous parallel computers, the proposed methodology applies to heterogeneous and network computing as well.

References

[1]

1. P. Worley, The effect of time constraints on scaled speedup, SIAM J. Sci. Stat. Comput. 11 (Sept. 1990), 838-858.]]

Digital Library

[2]

2. A. Y. Grama, A. Gupta, and V. Kumar, Isoefficiency: Measuring the scalability of parallel algorithms and architectures, IEEE Parallel Distrib. Technol. 1 (Aug. 1993), 12-21.]]

Digital Library

[3]

3. X.-H. Sun and D. Rover, Scalability of parallel algorithm-machine combinations, IEEE Trans. Parallel Distrib. Systems5 (June 1994), 599-613.]]

Digital Library

[4]

4. X. Zhang, Y. Yan, and K. He, Latency metric: An experimental method for measuring d evaluating parallel program and architecture scalability, J. Parallel Distrib. Comput. 22 (Sept. 1994), 392-410.]]

Digital Library

[5]

5. S. Sahni and V. Thanvantri, Performance metrics: Keeping the focus on runtime, IEEE Parallel Distrib. Technol. (Spring 1996), 43-56.]]

Digital Library

[6]

6. K. Hwang and Z. Xu, "Scalable Parallel Computing," McGraw-Hill, New York, 1998.]]

Digital Library

[7]

7. X.-H. Sun and J. Zhu, Performance considerations of shared virtual memory machines, IEEE Trans. Parallel Distrib. Systems (Nov. 1995), 1185-1194.]]

Digital Library

[8]

8. X.-H. Sun and J. Zhu, Performance prediction: A case study using a scalable shared-virtual-memory machine, IEEE Parallel Distrib. Technol. (Winter 1996), 36-49.]]

Digital Library

[9]

9. X.-H. Sun, "Scalability versus Execution Time in Scalable Systems," Louisiana State Uiversity, Computer Science TR-97-003, 1997. {Revised May 1998.}]]

[10]

10. C. Ho and S. Johnsson, Optimizing tridiagonal solvers for alternating direction methods on boolean cube multiprocessors, SIAM J. of. of Sci. and Stat. Computing11 (1990), 563-592.]]

[11]

11. X.-H. Sun, Application and accuracy of the parallel diagonal dominant algorithm, Parallel Computing (Aug. 1995), 1241-1267.]]

Digital Library

[12]

12. X.-H. Sun, H. Zhang, and L. Ni, Efficient tridiagonal solvers on multicomputers, IEEE Transactions on Computers41 (1992), 286-296.]]

Digital Library

[13]

13. V. Kumar et al., "Introduction to Parallel Computing: Design and Analysis of Algorithms," Benjamin-Commings, Redwood City, CA, 1994.]]

Digital Library

[14]

14. V. Bala et al., Ccl: A portable and tunable collective communication library for scalable parallel computers, IEEE Trans. Parallel Distrib. Systems6 (Feb. 1995), 154-164.]]

Digital Library

[15]

15. C. Hirsch, "Numerical Computation of Internal and External Flows," Wiley, New York, 1988.]]

Digital Library

[16]

16. X.-H. Sun, M. Pantano, and T. Fahringer, Integrated range comparison for data-parallel compilation systems, IEEE Trans. Parallel Distrib. Systems10 (May, 1999), 448-458.]]

Digital Library

Cited By

Sun XLu X(2023)The Memory-Bounded Speedup Model and Its Impacts in ComputingJournal of Computer Science and Technology10.1007/s11390-022-2911-138:1(64-79)Online publication date: 31-Jan-2023
https://dl.acm.org/doi/10.1007/s11390-022-2911-1
Hossain MSaddik A(2008)Scalability measurement of a proxy-based multimedia content repurposing systemInternational Journal of Advanced Media and Communication10.1504/IJAMC.2008.0201802:3(267-287)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.1504/IJAMC.2008.020180
Lastovetsky AReddy R(2004)On performance analysis of heterogeneous parallel algorithmsParallel Computing10.1016/j.parco.2004.07.00730:11(1195-1216)Online publication date: 1-Nov-2004
https://dl.acm.org/doi/10.1016/j.parco.2004.07.007

Index Terms

Scalability versus Execution Time in Scalable Systems

Recommendations

MPPs and clusters for scalable computing
ISPAN '96: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks

This article assess the state-of-the-art technology in massively parallel processors (MPPs) and clusters of workstations (COWs) for scalable parallel computing. We evaluate the IBM SP2, the Intel Paragon, the Cray T3D/T3E, and the ASCI TeraFLOPS system ...
A study of average-case speedup and scalability of parallel computations on static networks

A parallel system consists of a parallel algorithm and a parallel machine that supports the implementation of the algorithm. The scalability of a parallel system is a measure of its capability to increase speedup in proportion to the number of ...
Effectiveness of Parallel Joins

The effectiveness of parallel processing of relational join operations is examined. The skew in the distribution of join attribute values and the stochastic nature of the task processing times are identified as the major factors that can affect the ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Parallel and Distributed Computing

Journal of Parallel and Distributed Computing Volume 62, Issue 2

February 2002

154 pages

ISSN:0743-7315

Issue’s Table of Contents

Copyright © Elsevier Science (USA).

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 February 2002

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sun XLu X(2023)The Memory-Bounded Speedup Model and Its Impacts in ComputingJournal of Computer Science and Technology10.1007/s11390-022-2911-138:1(64-79)Online publication date: 31-Jan-2023
https://dl.acm.org/doi/10.1007/s11390-022-2911-1
Hossain MSaddik A(2008)Scalability measurement of a proxy-based multimedia content repurposing systemInternational Journal of Advanced Media and Communication10.1504/IJAMC.2008.0201802:3(267-287)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.1504/IJAMC.2008.020180
Lastovetsky AReddy R(2004)On performance analysis of heterogeneous parallel algorithmsParallel Computing10.1016/j.parco.2004.07.00730:11(1195-1216)Online publication date: 1-Nov-2004
https://dl.acm.org/doi/10.1016/j.parco.2004.07.007

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents