The relation of scalability and execution time
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 457-462
- https://doi.org/10.1109/ipps.1996.508095
Abstract
Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. In this paper, the relation between scalability and execution time is carefully studied. Results show that isospeed scalability well characterizes the variation of execution time. Three algorithms from scientific computing are implemented on an Intel Paragon and an IBM SP2 parallel computer. Experimental and theoretical results show that scalability is an important, distinct metric for parallel and distributed systems, and may be as important as execution time in a scalable parallel and distributed environment.Keywords
This publication has 5 references indexed in Scilit:
- Performance considerations of shared virtual memory machinesIEEE Transactions on Parallel and Distributed Systems, 1995
- Scalability of parallel algorithm-machine combinationsIEEE Transactions on Parallel and Distributed Systems, 1994
- Scalable Problems and Memory-Bounded SpeedupJournal of Parallel and Distributed Computing, 1993
- Isoefficiency: measuring the scalability of parallel algorithms and architecturesIEEE Parallel & Distributed Technology: Systems & Applications, 1993
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988