The relation of scalability and execution time

Author

Sun, Xian-He

Author_Institution

Dept. of Comput. Sci., Louisiana State Univ. Baton Rouge, LA, USA

fYear

1996

fDate

15-19 Apr 1996

Firstpage

457

Lastpage

462

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

computational complexity; natural sciences computing; parallel algorithms; parallel architectures; performance evaluation; software metrics; IBM SP2 parallel computer; Intel Paragon; distributed systems; execution time; isospeed scalability; metric; parallel algorithm evaluation; parallel architecture evaluation; performance criterion; scientific computing; Computer architecture; Computer science; Concurrent computing; Distributed computing; Parallel algorithms; Parallel processing; Power measurement; Scalability; Scientific computing; Sun; Time measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Conference_Location

Honolulu, HI

Print_ISBN

0-8186-7255-2

Type

conf

DOI

10.1109/IPPS.1996.508095

Filename

508095