Scalability of parallel algorithm-machine combinations

• Published in: IEEE transactions on parallel and distributed systems Vol. 5; no. 6; pp. 599 - 613
• Main Authors: Xian-He Sun, Rover, D.T.
• Format: Journal Article
• Language: English
• Published: United States IEEE 01-06-1994
• Subjects: 990200 - Mathematics & Computers; Algorithm design and analysis; Application software; Array processors; Computer architecture; Concurrent computing; High performance computing; Mathematical logic; MATHEMATICS AND COMPUTING; NASA; Parallel algorithms; Parallel processing; Programming; Scalability; Scaling laws; Sun
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/71.285606

Scalability has become an important consideration in parallel algorithm and machine designs. The word scalable, or scalability, has been widely and often used in the parallel processing community. However, there is no adequate, commonly accepted definition of scalability available. Scalabilities of computer systems and programs are difficult to quantify, evaluate, and compare. In this paper, scalability is formally defined for algorithm-machine combinations. A practical method is proposed to provide a quantitative measurement of the scalability. The relation between the newly proposed scalability and other existing parallel performance metrics is studied. A harmony between speedup and scalability has been observed. Theoretical results show that a large class of algorithm-machine combinations is scalable and the scalability can be predicted through premeasured machine parameters. Two algorithms have been studied on an nCUBE 2 multicomputer and on a MasPar MP-1 computer. These case studies have shown how scalabilities can be measured, computed, and predicted. Performance instrumentation and visualization tools also have been used and developed to understand the scalability related behavior.< >