Robust scalability analysis and SPM case studies

  • Authors:
  • Dejiang Jin;Sotirios G. Ziavras

  • Affiliations:
  • Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, USA 07102;Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, USA 07102

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scalability has become an attribute of paramount importance for computer systems used in business, scientific and engineering applications. Although scalability has been widely discussed, especially for pure parallel computer systems, it conveniently focuses on improving performance when increasing the number of computing processors. In fact, the term "scalable" is so much abused that it has become a marketing tool for computer vendors independent of the system's technical qualifications. Since the primary objective of scalability analysis is to determine how well a system can work on larger problems with an increase in its size, we introduce here a generic definition of scalability. For illustrative purposes only, we apply this definition to PC clusters, a rather difficult subject due to their long communication latencies. Since scalability does not solely depend on the system architecture but also on the application programs and their actual management by the run-time environment, for the sake of illustration, we evaluate scalability for programs developed under the super-programming model (SPM) (Jin and Ziavras in IEEE Trans. Parallel Distrib. Syst. 15(9):783---794, 2004; J. Parallel Distrib. Comput. 65(10):1281---1289, 2005; IEICE Trans. Inf. Syst. E87-D(7):1774---1781, 2004).