Skip to main content

Dependable Slot Selection Algorithms for Distributed Computing

  • Conference paper
  • First Online:
Contemporary Complex Systems and Their Dependability (DepCoS-RELCOMEX 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 761))

Included in the following conference series:

Abstract

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources. A single slot is a time span that can be assigned to a task, which is a part of a parallel job. The job launch requires a co-allocation of a specified number of slots starting and finishing synchronously. Some existing resource co-allocation algorithms assign a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. In this paper, algorithms for effective and dependable slot selection are studied and compared with known approaches. The novelty of the proposed approach is in a general algorithm efficiently selecting a set of slots according to the specified criterion.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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 Services with Data Access Awareness. J. of 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)

    Article  MathSciNet  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)

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

    Chapter  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, Norwell (2003)

    Google Scholar 

  6. Toporkov, V., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Composite scheduling strategies in distributed computing with non-dedicated resources. Procedia Comput. Sci. 9, 176–185 (2012)

    Article  Google Scholar 

  7. Aida, K., Casanova, H.: Scheduling mixed-parallel applications with advance reservations. In: 17th IEEE International Symposium on HPDC, pp. 65–74. IEEE CS Press, New York (2008)

    Google Scholar 

  8. Elmroth, E., Tordsson, J.: A standards-based grid resource brokering service supporting advance reservations, co-allocation and cross-grid interoperability. J Concurr. Comput. Pract. Exp. 25(18), 2298–2335 (2009)

    Article  Google Scholar 

  9. Takefusa, A., Nakada, H., Kudoh, T., Tanaka, Y.: An advance reservation-based co-allocation algorithm for distributed computers and network bandwidth on QoS-guaranteed grids. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2010. LNCS, vol. 6253, pp. 16–34. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Blanco, H., Guirado, F., Lrida, J.L., Albornoz, V.M.: MIP model scheduling for multi-clusters. In: Euro-Par 2012. LNCS, vol. 7640, pp. 196–206. Springer, Heidelberg (2013)

    Google Scholar 

  11. Moab Adaptive Computing Suite. http://www.adaptivecomputing.com

  12. 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. Softw. Pract. Exp. 41(1), 23–50 (2011)

    Article  Google Scholar 

  13. Samimi, P., Teimouri, Y., Mukhtar, M.: A combinatorial double auction resource allocation model in cloud computing. J. Inf. Sci. 357(C), 201–216 (2016)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Kovalenko, V.N., Kovalenko, E.I., Koryagin, D.A., et. al.: Parallel Job Management in the Grid with Non-Dedicated Resources, Preprint of Keldysh Institute of Applied Mathematics, Russian Academy of Science, Moscow, no. 63 (2007)

    Google Scholar 

  16. Makhlouf, S., Yagoubi, B.: Resources co-allocation strategies in grid computing. In: CIIA, vol. 825, CEUR Workshop Proceedings (2011)

    Google Scholar 

  17. 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 Laboratory, The University of Melbourne, Australia, 9 October 2007

    Google Scholar 

  18. Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot selection algorithms for economic scheduling in distributed computing with high QoS rates. In: New Results in Dependability and Computer Systems. AISC, vol. 224, pp. 459–468. Springer, Heidelberg (2013)

    Chapter  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-2297.2017.9), RFBR (grants 18-07-00456 and 18-07-00534) and by the Ministry on Education and Science of the Russian Federation (project no. 2.9606.2017/8.9).

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

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Toporkov, V., Yemelyanov, D. (2019). Dependable Slot Selection Algorithms for Distributed Computing. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, vol 761. Springer, Cham. https://doi.org/10.1007/978-3-319-91446-6_45

Download citation

Publish with us

Policies and ethics