Performance prediction of scalable computing: a case study
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 456-465 vol.2
- https://doi.org/10.1109/hicss.1995.375511
Abstract
While computers with tens of thousands of processors have successfully delivered high performance power for solving some of the so-called "grand-challenge" applications, the notion of scalability is becoming an important metric in the evaluation of parallel machine architectures and algorithms. In this study the prediction of scalability and its application are carefully investigated. A simple formula is presented to show the relation between scalability, single processor computing power, and degradation of parallelism. A case study is conducted on a multi-ring KSR-1 shared virtual memory machine. Experimental and theoretical results show that the influence of topology variation of an architecture is predictable. Therefore, the performance of an algorithm on a sophisticated hierarchical architecture can be predicted and a good algorithm-machine combination can be selected for a given application.Keywords
This publication has 10 references indexed in Scilit:
- Shared virtual memory and generalized speedupPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Latency Metric: An Experimental Method for Measuring and Evaluating Parallel Program and Architecture ScalabilityJournal of Parallel and Distributed Computing, 1994
- 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
- Toward a better parallel performance metricParallel Computing, 1991
- The Effect of Time Constraints on Scaled SpeedupSIAM Journal on Scientific and Statistical Computing, 1990
- Distributed Orthogonal Factorization: Givens and Householder AlgorithmsSIAM Journal on Scientific and Statistical Computing, 1989
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988
- Fat-trees: Universal networks for hardware-efficient supercomputingIEEE Transactions on Computers, 1985