Measuring the scalability of parallel computer systems

Authors:
J. R. Zirbas;D. J. Reble;R. E. vanKooten
Affiliations:
Myrias Research Corporation, #900, 10611 - 98 Avenue, Edmonton, Alberta, Canada T5K 2P7;Myrias Research Corporation, #900, 10611 - 98 Avenue, Edmonton, Alberta, Canada T5K 2P7;Myrias Research Corporation, #900, 10611 - 98 Avenue, Edmonton, Alberta, Canada T5K 2P7
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 7
Cited 5

The connection machine

The connection machine
Effects of synchronization barriers on multiprocessor performance

Parallel Computing
Designing efficient algorithms for parallel computers

Designing efficient algorithms for parallel computers
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds

IEEE Transactions on Computers
The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems

IEEE Transactions on Computers
The control mechanism for the Myrias parallel computer system

ACM SIGARCH Computer Architecture News - Special Issue: Architectural Support for Operating Systems
Fast Transforms: Algorithms, Analyses, Applications

Fast Transforms: Algorithms, Analyses, Applications

Analysis of scalability of parallel algorithms and architectures: a survey

ICS '91 Proceedings of the 5th international conference on Supercomputing
Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
The Scalability of FFT on Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
High Level Simulation & Modeling for Medical Applications - Ultrasound Case

MICCAI '02 Proceedings of the 5th International Conference on Medical Image Computing and Computer-Assisted Intervention-Part II
Scalability of heterogeneous parallel systems

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses scalability and outlines a specific approach to measuring the scalability of parallel computer systems. The relationship between scalability and speedup is described. It is shown that a parallel system is scalable for a given algorithm if and only if its speedup is unbounded. A technique is proposed that can be used to help determine whether a candidate model is correct, that is, whether it adequately approximates the system's scalability. Experimental results illustrate this technique for both a poorly scalable and a very scalable system.