Slot Co-allocation Optimization in Distributed Computing with Heterogeneous Resources

  • Victor Toporkov
  • Anna Toporkova
  • Dmitry YemelyanovEmail author
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 798)


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


Distributed computing Grid Economic scheduling Resource management Slot Job Allocation Optimization 



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


  1. 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)CrossRefGoogle Scholar
  2. 2.
    Buyya, R., Abramson, D., Giddy, J.: Economic models for resource management and scheduling in Grid computing. J. Concurr. Comput. 14(5), 1507–1542 (2002). Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: Multicriteria aspects of grid resource 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
  5. 5.
    Toporkov, V., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Composite scheduling strategies in distributed computing with non-dedicated resources. Proc. Comput. Sci. 9, 176–185 (2012)CrossRefGoogle Scholar
  6. 6.
    Toporkov, V., Toporkova, A., Yemelyanov, D.: Heuristic of anticipation for fair scheduling and resource allocation in grid VOs. Stud. Comput. Intell. 737, 27–37 (2018)Google Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 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)Google Scholar
  10. 10.
    Blanco, H., Guirado, F., Lrida, J.L., Albornoz, V.M.: MIP model scheduling for multiclusters. In: EuroPar 2012. LNCS, vol. 7640, pp. 196–206. Springer, Heidelberg (2013)Google Scholar
  11. 11.
    Moab Adaptive Computing Suite.
  12. 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)CrossRefGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 14.
    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, Singapore, 1–3 June 2011, vol. 4. pp. 2267–2276 (2011). Procedia Computer Science. ElsevierCrossRefGoogle Scholar
  15. 15.
    Kovalenko, V.N., Koryagin, D.A.: The grid: analysis of basic principles and ways of application. J. Programm. Comput. Softw. 35(1), 18–34 (2009)CrossRefGoogle Scholar
  16. 16.
    Makhlouf, S., Yagoubi, B.: Resources co-allocation strategies in grid computing. In: CIIA, vol. 825, CEUR Workshop Proceedings (2011)Google Scholar
  17. 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 (2007)Google Scholar
  18. 18.
    Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot selection algorithms in distributed computing. J. Supercomput. 69(1), 5360 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Victor Toporkov
    • 1
  • Anna Toporkova
    • 2
  • Dmitry Yemelyanov
    • 1
    Email author
  1. 1.National Research University “MPEI”MoscowRussia
  2. 2.Higher School of EconomicsNational Research UniversityMoscowRussia

Personalised recommendations