Skip to main content

Scalability Model Based on the Concept of Granularity

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9574))

  • 1173 Accesses

Abstract

In the recent years it can be observed increasing popularity of parallel processing using multi-core processors, local clusters, GPU and others. Moreover, currently one of the main requirements the IT users is the reduction of maintaining cost of the computer infrastructure. It causes that the performance evaluation of the parallel applications becomes one of the most important problem. Then obtained results allows efficient use of available resources. In traditional methods of performance evaluation the results are based on wall-clock time measurements. This approach requires consecutive application executions and includes a time-consuming data analysis. In the paper an alternative approach is proposed. The decomposition of parallel application execution time onto computation time and overheads related to parallel execution is use to calculate the granularity of application and then determine its efficiency. Finally the application scalability can be evaluates.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jogalekar, P., Woodside, M.: Evaluating the scalability of distributed systems. IEEE Trans. Parallel Distrib. Syst. 11(6), 589–603 (2000)

    Article  Google Scholar 

  2. Kwiatkowski, J.: Parallel applications performance evaluation using the concept of granularity. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds.) PPAM 2013, Part II. LNCS, vol. 8385, pp. 215–224. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Kwiatkowski, J., Pawlik, M., Konieczny, D.: Comparison of execution time decomposition methods for performance evaluation. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol. 4967, pp. 1160–1169. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Grama, A.Y., Gupta, A., Kumar, V.: Isoefficiency: measuring the scalability of parallel algorithms and architectures. IEEE Parallel Distrib. Technol. 1, 12–21 (1993)

    Article  Google Scholar 

  5. Kwiatkowski, J., Pawlik, M., Konieczny, D.: Parallel program execution anomalies. In: Proceedings of First International Multiconference on Computer Science and Information, Wisla, Poland (2006)

    Google Scholar 

  6. Gunther, N.J., Puglia, P., Tomasette, K.: Hadoop superlinear scalability: the perpetual motion of parallel performance. Commun. ACM 58(4), 46–55 (2015)

    Article  Google Scholar 

  7. Bosque, J.L., Robles, O.D., Toharia, P., Pastor, L.: H-Isoefficiency: scalability metric for heterogeneous systems. In: Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010, pp. 240–250 (2010)

    Google Scholar 

  8. Shoukourian, H., Wilde, T., Auweter, A., Bode, A.: Predicting the energy and power consumption of strong and weak scaling HPC applications. Supercomput. Front. Innovations 1(2), 20–41 (2014)

    Google Scholar 

  9. MacQueen, J.B.: Some methods for classifcation and analysis of multivariate observations. In: Proceedings of the Fifth Symposium on Math, Statistics, and Probability, pp. 281–297. University of California Press, Berkeley (1967)

    Google Scholar 

  10. Kartawidjaja, M.A.: Analyzing scalability of parallel matrix multiplication using dusd. Asian J. Inf. Technol. 9(2), 78–84 (2010). ISSN: 1682–3915

    Article  Google Scholar 

Download references

Acknowledgments

Calculations have been carried out using resources providing by Wroclaw Centre for Networking and Supercomputing (http://wcss.pl), grant No. 266.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Kwiatkowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kwiatkowski, J., Olech, L. (2016). Scalability Model Based on the Concept of Granularity. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds) Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science(), vol 9574. Springer, Cham. https://doi.org/10.1007/978-3-319-32152-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32152-3_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32151-6

  • Online ISBN: 978-3-319-32152-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics