Skip to main content
Log in

Robust scalability analysis and SPM case studies

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondi AB (2000) Characteristics of scalability and their impact on performance. In: Proceedings of the 2nd international workshop on software and performance, Ottawa, Ontario, Canada, pp 195–203, September 2000

  2. Brataas G, Hughes P (2004) Exploring architectural scalability. ACM SIGSOFT Softw Eng Notes 29(1):125–129

    Article  Google Scholar 

  3. Deters R (2001) Scalability and information agents. ACM SIGAPP Appl Comput Rev 9(3):13–20

    Article  Google Scholar 

  4. Engelmann C, Geist A (2005) Super-scalable algorithms for computing on 100,000 processors. Lect Notes Comput Sci 3514(I):313–321

    Article  Google Scholar 

  5. Fang B, Deng Y, Martyna G (2007) Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer. Comput Phys Commun 176(8):531–538

    Article  Google Scholar 

  6. Goodyer CE, Berzins M (2007) Parallelization and scalability issues of a multilevel elastohydrodynamic lubrication solver. Concurr Comput Pract Experience 19(4):369–396

    Article  Google Scholar 

  7. Greenberg MD (1988) Advanced engineering mathematics. Prentice-Hall, Englwood Cliffs

    MATH  Google Scholar 

  8. Gustafson JL (1988) Reevaluating Amdahl’s law. Comm ACM 31(5):18–21

    Article  Google Scholar 

  9. Hill MD (1990) What is scalability? ACM SIGARCH Comput Archit News 18(4):18–21

    Article  Google Scholar 

  10. Jin D, Ziavras SG (2004) A super-programming approach for mining association rules in parallel on PC clusters. IEEE Trans Parallel Distributed Syst 15(9):783–794

    Article  Google Scholar 

  11. Jin D, Ziavras SG (2004) A super-programming technique for large sparse matrix multiplication on PC clusters. IEICE Trans Inf Syst E87-D(7):1774–1781

    Google Scholar 

  12. Jin D, Ziavras SG (2005) Modeling distributed data representation and its effect on parallel data accesses. J Parallel Distributed Comput. (Special issue on design and performance of networks for super-, cluster-, and grid-computing) 65(10):1281–1289

    Article  Google Scholar 

  13. Karp AH, Flatt HP (1990) Measuring parallel processor performance. Comm ACM 33(5):539–543

    Article  Google Scholar 

  14. Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing. Benjamin/Cummings, Redwood City

    MATH  Google Scholar 

  15. Kumar V, Rao VN (1987) Parallel depth-first search. Int J Parallel Program 16(6):501–519

    Article  MATH  MathSciNet  Google Scholar 

  16. Law DR (1998) Scalable means more than more: a unifying definition of simulation scalability. In: Proceedings of the 30th conference on winter simulation, Washington, DC, pp 781–788, December 1998

  17. Mavriplis DJ, Aftosmis MJ, Berger M (2007) High resolution aerospace applications using the NASA Columbia supercomputer. Int J High Perform Comput Appl 21(1):106–126

    Article  Google Scholar 

  18. Nussbaum D, Agarwal A (1991) Scalability of parallel machines. Comm ACM 34(3):57–61

    Article  MathSciNet  Google Scholar 

  19. Sivasubramaniam A, Singla A, Ramachandran U, Venkateswaran H (1994) An approach to scalability study of shared memory parallel systems. ACM SIGMETRICS Perform Eval Rev 22(1):171–180

    Article  Google Scholar 

  20. Sun X-H, Gustafson JL (1991) Towards a better parallel performance metric. Parallel Comput 17:1093–1109

    Article  MATH  Google Scholar 

  21. Vetter JS, McCracken MO (2001) Statistical scalability analysis of communication operations in distributed applications. ACM SIGPLAN Not 36(7):123–132

    Article  Google Scholar 

  22. Ziavras SG (1992) On the problem of expanding hypercube-based systems. J Parallel Distributed Comput 16(1):41–53

    Article  MATH  MathSciNet  Google Scholar 

  23. Ziavras SG (1994) RH: a versatile family of reduced hypercube interconnection networks. IEEE Trans Parallel Distributed Syst 5(11):1210–1220

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sotirios G. Ziavras.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, D., Ziavras, S.G. Robust scalability analysis and SPM case studies. J Supercomput 43, 199–223 (2008). https://doi.org/10.1007/s11227-007-0140-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-007-0140-6

Keywords