Skip to main content

Availability-Based Resources Allocation Algorithms in Distributed Computing

  • Conference paper
  • First Online:
Supercomputing (RuSCDays 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1331))

Included in the following conference series:

Abstract

In this work, we introduce resources co-allocation algorithms for parallel jobs execution in distributed computing with non-dedicated and heterogeneous hosts. Complex distributed computing systems often operate under conditions of the resources availability uncertainty. Imprecise estimations of jobs execution runtime, unplanned maintenance works and other global and local events do not allow to consider accurate schedules of the resources utilization. On the other hand, an efficient job-flow execution in compliance with QoS constraints requires reliable mechanisms for advanced resources allocation and reservation. The novelty of the proposed resources allocation approach is in a general procedure efficiently selecting computing nodes according to the resources availability criteria. Special knapsack and greedy algorithms are implemented and compared in a market-based computing simulation model.

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 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. Lee, Y.C., Wang, C., Zomaya, A.Y., Zhou, B.B.: Profit-driven scheduling for cloud sevices with data access awareness. J. Parallel Distrib. Comput. 72(4), 591–602 (2012)

    Article  Google Scholar 

  2. Garg, S.K., Konugurthi, P., Buyya, R.: A linear programming-driven genetic algorithm for meta-scheduling on utility grids. Int. J. Parallel Emergent Distrib. Syst. 26, 493–517 (2011)

    Google Scholar 

  3. Buyya, R., Abramson, D., Giddy, J.: Economic models for resource management and scheduling in grid computing. J. Concurr. Comput. Pract. Exp. 5(14), 1507–1542 (2002)

    Google Scholar 

  4. Ernemann, C., Hamscher, V., Yahyapour, R.: Economic scheduling in grid computing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 128–152. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36180-4_8

    Chapter  MATH  Google Scholar 

  5. Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: Multicriteria aspects of grid re-source management. In: Nabrzyski, J., Schopf, J.M., Weglarz, J. (eds.) Grid Resource Management. State of the Art and Future Trends, pp. 271–293. Kluwer Academic Publishers, New York (2003)

    Google Scholar 

  6. Toporkov, V., Toporkova, A., Bobchenkov, A., Yemelyanov, D.: Resource selection algorithms for economic scheduling in distributed systems. In: Proceedings of International Conference on Computational Science, ICCS 2011, 1–3 June 2011, Singapore, Procedia Computer Science, vol. 4. pp. 2267–2276. Elsevier (2011)

    Google Scholar 

  7. Netto, M.A.S., Buyya, R.: A flexible resource co-allocation model based on advance reservations with rescheduling support. In: Technical report, GRIDSTR-2007–17, Grid Computing and Distributed Systems Lab University of Melbourne, Australia (2007)

    Google Scholar 

  8. Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87–102. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45540-X_6

    Chapter  Google Scholar 

  9. Javadi, B., Kondo, D., Vincent, J., Anderson, D.: Discovering statistical models of availability in large distributed systems: an empirical study of SETI@home. IEEE Trans. Parallel Distrib. Syst. 22(11), 1896–1903 (2011)

    Article  Google Scholar 

  10. Rood, B., Lewis, M.J.: Grid resource availability prediction-based scheduling and task replication. J. Grid Comput. 7, 479 (2009)

    Article  Google Scholar 

  11. Tchernykh, A., Schwiegelsohn, U., El-ghazali, T., Babenko, M.: Towards understanding uncertainty in cloud computing with risks of confidentiality, integrity, and availability. J. Comput. Sci. 36 (2016)

    Google Scholar 

  12. Chaari, T., Chaabane, S., Aissani, N., Trentesaux, D.: Scheduling under uncertainty: survey and research directions. In: 2014 International Conference on Advanced Logistics and Transport (ICALT), pp. 229–234 (2014)

    Google Scholar 

  13. Calheiros, R.N., Ranjan, R., Beloglazov, A., De Rose, C.A.F., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. J. Soft. Pract. Exp. 41(1), 23–50 (2011)

    Article  Google Scholar 

  14. Toporkov, V., Yemelyanov, D.: Optimization of resources selection for jobs scheduling in heterogeneous distributed computing environments. In: Shi, Y., Fu, H., Tian, Y., Krzhizhanovskaya, V.V., Lees, M.H., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 574–583. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93701-4_45

    Chapter  Google Scholar 

  15. Toporkov, V., Yemelyanov, D.: Resources co-allocation optimization algorithms for distributed computing environments. In: ACM International Conference Proceeding Series, 47th International Conference on Parallel Processing, ICPP 2018, Paper 43 (2018)

    Google Scholar 

  16. Epema, D., Iosup, D.: Grid computing workloads. J. IEEE Internet Comput. 15(2), 19–26 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the Council on Grants of the President of the Russian Federation for State Support of Young Scientists (YPhD- 2979.2019.9), RFBR (grants 18-07-00456 and 18-07-00534).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Victor Toporkov .

Editor information

Editors and Affiliations

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

Toporkov, V., Yemelyanov, D. (2020). Availability-Based Resources Allocation Algorithms in Distributed Computing. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2020. Communications in Computer and Information Science, vol 1331. Springer, Cham. https://doi.org/10.1007/978-3-030-64616-5_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-64616-5_47

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics