Advertisement

Preference Based and Fair Resources Selection in Grid VOs

  • Victor ToporkovEmail author
  • Dmitry Yemelyanov
  • Anna Toporkova
Conference paper
  • 268 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11657)

Abstract

In this work, a preference-based resources allocation algorithm for a job-flow scheduling in Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. The algorithm performs resources selection optimization according to a specified general criterion and may be used in a variety of scheduling procedures, such as Backfilling or First Fit. Fair scheduling policies in VOs assume resources distribution according to VO stakeholders individual preferences. For this purpose, we consider a target optimization criterion as a linear combination of global (group) and private (user) job scheduling criteria. The mutual importance factor between the private and the global criteria is introduced to achieve a balanced scheduling solution.

Keywords

Scheduling Grid Resources selection Utilization Virtual organization Preferences Private Global 

Notes

Acknowledgments

This work was partially supported by the Council on Grants of the President of the Russian Federation for State Support of Young Scientists (grant YPhD-2979.2019.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).

References

  1. 1.
    Dimitriadou, S.K., Karatza, H.D.: Job scheduling in a distributed system using backfilling with inaccurate runtime computations. In: Proceedings of the 2010 International Conference on Complex, Intelligent and Software Intensive Systems, pp. 329–336 (2010)Google Scholar
  2. 2.
    Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D., Potekhin, P.: Heuristic strategies for preference-based scheduling in virtual organizations of utility grids. J. Ambient Intell. Humanized Comput. 6(6), 733–740 (2015)CrossRefGoogle Scholar
  3. 3.
    Buyya, R., Abramson, D., Giddy, J.: Economic models for resource management and scheduling in grid computing. J. Concurrency Comput. 14(5), 1507–1542 (2002)CrossRefGoogle 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 Acad. Publ., Dordrecht (2003)Google Scholar
  5. 5.
    Rodero, I., Villegas, D., Bobroff, N., Liu, Y., Fong, L., Sadjadi, S.M.: Enabling interoperability among grid meta-schedulers. J. Grid Comput. 11(2), 311–336 (2013)CrossRefGoogle Scholar
  6. 6.
    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. Experience 41(1), 23–50 (2011)CrossRefGoogle Scholar
  7. 7.
    Rzadca, K., Trystram, D., Wierzbicki, A.: Fair game-theoretic resource management in dedicated grids. In: IEEE International Symposium on Cluster Computing and the Grid (CCGRID 2007), Rio De Janeiro, Brazil, pp. 343–350. IEEE Computer Society (2007)Google Scholar
  8. 8.
    Vasile, M., Pop, F., Tutueanu, R., Cristea, V., Kolodziej, J.: Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing. J. Future Gener. Comput. Syst. 51, 61–71 (2015)CrossRefGoogle Scholar
  9. 9.
    Penmatsa, S., Chronopoulos, A.T.: Cost minimization in utility computing systems. Concurrency Comput. Pract. Experience 16(1), 287–307 (2014)CrossRefGoogle Scholar
  10. 10.
    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_6CrossRefGoogle Scholar
  11. 11.
    Mutz, A., Wolski, R., Brevik, J.: Eliciting honest value information in a batch-queue environment. In: 8th IEEE/ACM International Conference on Grid Computing, New York, USA, pp. 291–297 (2007)Google Scholar
  12. 12.
    Toporkov, V., Yemelyanov, D., Toporkova, A., Potekhin, P.: Cyclic anticipation scheduling in grid VOs with stakeholders preferences. In: Malyshkin, V. (ed.) PaCT 2017. LNCS, vol. 10421, pp. 372–383. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-62932-2_36CrossRefzbMATHGoogle Scholar
  13. 13.
    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).  https://doi.org/10.1007/978-3-642-16505-4_2CrossRefGoogle Scholar
  14. 14.
    Carroll, T., Grosu, D.: Divisible load scheduling: an approach using coalitional games. In: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing, ISPDC 2007, p. 36 (2007)Google Scholar
  15. 15.
    Kim, K., Buyya, R.: Fair resource sharing in hierarchical virtual organizations for global grids. In: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing, Austin, USA, pp. 50–57. IEEE Computer Society (2007)Google Scholar
  16. 16.
    Skowron, P., Rzadca, K.: Non-monetary fair scheduling cooperative game theory approach. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 288–297. ACM, New York (2013)Google Scholar
  17. 17.
    Dalheimer, M., Pfreundt, F.-J., Merz, P.: Agent-based grid scheduling with Calana. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 741–750. Springer, Heidelberg (2006).  https://doi.org/10.1007/11752578_89CrossRefGoogle Scholar
  18. 18.
    Thain, T., Livny, M.: Distributed computing in practice: the condor experience. Concurrency Comput. Pract. Experience 17, 323–356 (2005)CrossRefGoogle Scholar
  19. 19.
    Khemka, B., et al.: Resource management in heterogeneous parallel computing environments with soft and hard deadlines. In: Proceedings of 11th Metaheuristics International Conference (MIC 2015) (2015)Google Scholar
  20. 20.
    Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput. 65(9), 1090–1107 (2005)CrossRefGoogle Scholar
  21. 21.
    Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot selection algorithms in distributed computing. J. Supercomput. 69(1), 53–60 (2014)CrossRefGoogle Scholar
  22. 22.
    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 2007Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

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

Personalised recommendations