Skip to main content
SpringerLink
Log in

Collecting HPC Applications Processing Characteristics to Facilitate Co-scheduling

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2020 (ICCSA 2020)

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

Included in the following conference series:

Abstract

In this paper we describe typical HPC workloads in terms of scheduling theory models. In particular, we cover machine environments that are common for high performance computing (HPC) field, possible objective functions and available jobs characteristics. We also describe resources that are required by HPC applications and how to monitor and control their usage rates. We provide the basis for defining mathematical model for application resource usage and validate it on experimental data.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bailey, D.H., et al.: The NAS parallel benchmarks. Int. J. Supercomput. Appl. 5(3), 63–73 (1991)

    Google Scholar 

  2. Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Sterna, M., Weglarz, J.: Handbook on Scheduling: From Theory to Practice. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-319-99849-7

    Book  Google Scholar 

  3. Castain, R.H., Hursey, J., Bouteiller, A., Solt, D.: Pmix: process management for exascale environments. Parallel Comput. 79, 9–29 (2018)

    Article  MathSciNet  Google Scholar 

  4. Gawiejnowicz, S.: Time-Dependent Scheduling. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69446-5

    Book  MATH  Google Scholar 

  5. Hargrove, P.H., Duell, J.C.: Berkeley lab checkpoint/restart (BLCR) for Linux clusters. In: Journal of Physics: Conference Series, vol. 46, p. 494. IOP Publishing (2006)

    Google Scholar 

  6. Haritatos, A.H., Papadopoulou, N., Nikas, K., Goumas, G., Koziris, N.: Contention-aware scheduling policies for fairness and throughput. Co-Sched. HPC Appl. 28, 22 (2017)

    Google Scholar 

  7. Kuchumov, R., Korkhov, V.: Fair resource allocation for running HPC workloads simultaneously. In: Misra, S., et al. (eds.) ICCSA 2019. LNCS, vol. 11622, pp. 740–751. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-24305-0_55

    Chapter  Google Scholar 

  8. Louca, S., Neophytou, N., Lachanas, A., Evripidou, P.: MPI-FT: Portable fault tolerance scheme for MPI. Parallel Process. Lett. 10(04), 371–382 (2000)

    Article  Google Scholar 

  9. Pickartz, S., Eiling, N., Lankes, S., Razik, L., Monti, A.: Migrating LinuX containers using CRIU. In: Taufer, M., Mohr, B., Kunkel, J.M. (eds.) ISC High Performance 2016. LNCS, vol. 9945, pp. 674–684. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46079-6_47

    Chapter  Google Scholar 

  10. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, vol. 5. Springer, Heidelberg (2012). https://doi.org/10.1007/978-1-4614-2361-4

    Book  MATH  Google Scholar 

  11. Trinitis, C., Weidendorfer, J.: Co-scheduling of HPC Applications, vol. 28. IOS Press (2017)

    Google Scholar 

Download references

Acknowledgements

Research has been supported by the RFBR grant No. 19-37-90138.

Author information

Authors and Affiliations

  1. Saint Petersburg State University, 7/9 Universitetskaya nab., St. Petersburg, 199034, Russia

    Ruslan Kuchumov & Vladimir Korkhov

Authors
  1. Ruslan Kuchumov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Korkhov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruslan Kuchumov .

Editor information

Editors and Affiliations

  1. University of Perugia, Perugia, Italy

    Osvaldo Gervasi

  2. University of Basilicata, Potenza, Potenza, Italy

    Beniamino Murgante

  3. Chair- Center of ICT/ICE, Covenant University, Ota, Nigeria

    Sanjay Misra

  4. University of Cagliari, Cagliari, Italy

    Chiara Garau

  5. University of Cagliari, Cagliari, Italy

    Ivan Blečić

  6. Clayton School of Information Technology, Monash University, Clayton, VIC, Australia

    David Taniar

  7. Department of Information Science, Kyushu Sangyo University, Fukuoka, Japan

    Bernady O. Apduhan

  8. University of Minho, Braga, Portugal

    Ana Maria A. C. Rocha

  9. Polytechnic University of Bari, Bari, Italy

    Eufemia Tarantino

  10. Polytechnic University of Bari, Bari, Italy

    Carmelo Maria Torre

  11. Department of Neurology, University of Massachusetts Medical School, Worcester, MA, USA

    Yeliz Karaca

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kuchumov, R., Korkhov, V. (2020). Collecting HPC Applications Processing Characteristics to Facilitate Co-scheduling. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2020. ICCSA 2020. Lecture Notes in Computer Science(), vol 12254. Springer, Cham. https://doi.org/10.1007/978-3-030-58817-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58817-5_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58816-8

  • Online ISBN: 978-3-030-58817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation