Skip to main content

Heuristic Anticipation Scheduling for Efficient and Fair Resources Allocation in Grid VOs

  • Conference paper
  • First Online:
Creativity in Intelligent Technologies and Data Science (CIT&DS 2017)

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

Included in the following conference series:

Abstract

In this work, a job-flow scheduling approach for 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. With increasing resources utilization level the available resources set and corresponding decision space are reduced. In order to improve overall scheduling efficiency, we propose an anticipation scheduling heuristic. It includes a predetermined (anticipated) pattern solution definition and a special replication procedure for efficient and feasible resources allocation. A proposed anticipation algorithm is compared against conservative backfilling variations using such criteria as average jobs’ response time (start and finish times) as well as users’ and VO economic criteria (execution time and cost).

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

Similar content being viewed by others

References

  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. doi:10.1109/CISIS.2010.65(2010)

  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. Hum. Comput. 6(6), 733–740 (2015). doi:10.1007/s12652-015-0274-y

    Article  Google Scholar 

  3. Buyya, R., Abramson, D., Giddy, J.: Economic models for resource management and scheduling in Grid computing. J. Concurr. Comput. 14(5), 1507–1542 (2002). doi:10.1002/cpe.690

    Article  MATH  Google Scholar 

  4. Kurowski, K., Nabrzyski, J., Oleksiak, A., Wȩglarz, J.: Multicriteria aspects of grid resource management. In: Nabrzyski, J., Schopf, J.M., Wȩglarz, J. (eds.) Grid Resource Management. International Series in Operations Research & Management Science, vol. 64, pp. 271–293. Springer, Boston (2004). doi:10.1007/978-1-4615-0509-918

    Chapter  Google Scholar 

  5. Rodero, I., Villegas, D., Bobro, N., Liu, Y., Fong, L., Sadjadi, S.M.: Enabling interoperability among Grid meta-schedulers. J. Grid Comput. 11(2), 311–336 (2013). doi:10.1007/s10723-013-9252-9

    Article  Google Scholar 

  6. 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). doi:10.1007/3-540-36180-4_8

    Chapter  Google Scholar 

  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), pp. 343–350 (2007). doi:10.1109/ccgrid.2007.52

  8. Penmatsa, S., Chronopoulos, A.T.: Cost minimization in utility computing systems. Concurr. Comput.: Practice Experience, Wiley 16(1), 287–307 (2014). doi:10.1002/cpe.2984

    Article  Google Scholar 

  9. 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). doi:10.1016/j.future.2014.11.019

    Article  Google Scholar 

  10. Mutz, A., Wolski, R., Brevik, J.: Eliciting honest value information in a batch-queue environment. In: 8th IEEE/ACM International Conference on Grid Computing, pp. 291–297. IEEE Computer Society (2007). doi:10.1109/grid.2007.4354145

  11. Blanco, H., Guirado, F., Lrida, J.L., Albornoz, V.M.: MIP model scheduling for multi-clusters. In: Proceedings of the Euro-Par 2012, pp. 196–206 (2012). doi:10.1007/978-3-642-36949-022

  12. 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). doi:10.1007/978-3-642-16505-4_2

    Chapter  Google Scholar 

  13. 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), pp. 36–36 (2007). doi:10.1109/ispdc.2007.16

  14. 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, pp. 50–57 (2007). doi:10.1109/grid.2007.4354115

  15. Toporkov, V., Yemelyanov, D., Bobchenkov, A., Tselishchev, A.: Scheduling in grid based on VO stakeholders preferences and criteria. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Dependability Engineering and Complex Systems. AISC, vol. 470, pp. 505–515. Springer, Cham (2016). doi:10.1007/978-3-319-39639-2_44

    Google Scholar 

  16. Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot selection algorithms in distributed computing. J. Supercomput. 69(1), 53–60 (2014). doi:10.1007/s11227-014-1210-1

    Article  Google Scholar 

  17. 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). doi:10.1016/j.procs.2012.04.019

    Article  Google Scholar 

  18. 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). doi:10.1002/spe.995

    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 and Leading Scientific Schools (grants YPhD-2297.2017.9 and SS-6577.2016.9), RFBR (grants 15-07-02259 and 15-07-03401) 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 Dmitry Yemelyanov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Toporkov, V., Yemelyanov, D. (2017). Heuristic Anticipation Scheduling for Efficient and Fair Resources Allocation in Grid VOs. In: Kravets, A., Shcherbakov, M., Kultsova, M., Groumpos, P. (eds) Creativity in Intelligent Technologies and Data Science. CIT&DS 2017. Communications in Computer and Information Science, vol 754. Springer, Cham. https://doi.org/10.1007/978-3-319-65551-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65551-2_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65550-5

  • Online ISBN: 978-3-319-65551-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics