Heuristic strategies for preference-based scheduling in virtual organizations of utility grids
- 115 Downloads
Distributed environments with the users decoupling from resource providers are generally defined as utility Grids. This paper focuses on the problems of an efficient scheduling in virtual organizations (VOs) of utility Grids. The proposed scheduling model ensures the VO stakeholders preferences and provides strategies for effective resources utilization. An approach based on the combination of the cyclic scheduling scheme, backfilling and several heuristic procedures is proposed and studied. Comparative simulation results are introduced for different algorithms and heuristics. Resource domain composition and heterogeneity as well as the VO pricing policy are taken into account. Considered scheduling approaches provide different benefits depending on the VO scheduling objectives. The results justify the use of the proposed approaches in a broad range of the resource environment parameters.
KeywordsScheduling Distributed computing Job Batch Optimization Resource Utilization Backfilling
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 SS-362.2014.9, YPhD-4148.2015), the Russian Foundation for Basic Research (grants 15-07-02259, 15-07-03401), and by the Ministry on Education and Science of the Russian Federation, task no. 2014/123 (project no. 2268).
Conflict of interest
The authors declare that they have no conflict of interest.
- Aida K, Casanova H (2008) Scheduling mixed-parallel applications with advance reservations. In: 17th IEEE International Symposium on HPDC, IEEE, New York, USA, pp 65–74Google Scholar
- Ando S, Aida K (2007) Evaluation of scheduling algorithms for advance reservations. Inf Process Soc Japan SIG Notes 113:37–42Google Scholar
- Blanco H, Guirado F, Lrida J, Albornoz V (2012) MIP model scheduling for multi-clusters. Euro-Par 2012. Springer, Heidelberg, pp 196–206Google Scholar
- Castillo C, Rouskas G, Harfoush K (2009) Resource co-allocation for large-scale distributed environments. In: 18th ACM international symposium on high performance distributed compuing. ACM, New York, USA, pp 137–150Google Scholar
- Ernemann C, Hamscher V, Yahyapour R (2002) Economic scheduling in Grid computing. In: Feitelson D, Rudolph L, Schwiegelshohn U (eds) JSSPP, vol 18. Springer, Heidelberg, pp 128–152Google Scholar
- Kurowski K, Nabrzyski J, Oleksiak A, Weglarz J (2003) Multicriteria aspects of Grid resource management. In: Nabrzyski J, JM S, Weglarz J (eds) Grid resource management. State of the art and future trends. Kluwer, Boston, MA, pp 271–293Google Scholar
- Takefusa A, Nakada H, Kudoh T, Tanaka Y (2010) An advance reservation-based co-allocation algorithm for distributed computers and network bandwidth on QoS-guaranteed Grids. In: Frachtenberg ESU (ed) JSSPP 2010, vol 6253. Springer, Heidelberg, pp 16–34Google Scholar
- Toporkov V, Toporkova A, Tselishchev A, Yemelyanov D, Potekhin P (2015) Core heuristics for preference-based scheduling in virtual organizations of utility Grids. Studies in Computational Intelligence, Springer, Heidelberg 570:321–330Google Scholar