Heuristic strategies for preference-based scheduling in virtual organizations of utility grids

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.

[1]  Rajkumar Buyya,et al.  A Linear Programming Driven Genetic Algorithm for Meta-Scheduling on Utility Grids , 2008, 2008 16th International Conference on Advanced Computing and Communications.

[2]  Erwin Schwab,et al.  State of the art and future trends , 2003 .

[3]  Henri Casanova,et al.  Scheduling mixed-parallel applications with advance reservations , 2008, HPDC '08.

[4]  Johan Tordsson,et al.  A standards-based Grid resource brokering service supporting advance reservations, coallocation, and cross-Grid interoperability , 2009 .

[5]  Victor V. Toporkov,et al.  Metascheduling Strategies in Distributed Computing with Non-dedicated Resources , 2015, AISC 2015.

[6]  Victor V. Toporkov,et al.  Slot selection algorithms in distributed computing , 2014, The Journal of Supercomputing.

[7]  Ramin Yahyapour,et al.  Economic Scheduling in Grid Computing , 2002, JSSPP.

[8]  Yoshio Tanaka,et al.  An Advance Reservation-Based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-Guaranteed Grids , 2010, JSSPP.

[9]  Liana L. Fong,et al.  Enabling Interoperability among Grid Meta-Schedulers , 2013, Journal of Grid Computing.

[10]  Albert Y. Zomaya,et al.  Profit-driven scheduling for cloud services with data access awareness , 2012, J. Parallel Distributed Comput..

[11]  Fernando Guirado,et al.  MIP Model Scheduling for Multi-Clusters , 2012, Euro-Par Workshops.

[12]  Muthucumaru Maheswaran,et al.  A Synchronous Co-Allocation Mechanism for Grid Computing Systems , 2004, Cluster Computing.

[13]  Maria Mirto,et al.  Preference–Based Matchmaking of Grid Resources with CP–Nets , 2012, Journal of Grid Computing.

[14]  George N. Rouskas,et al.  Resource co-allocation for large-scale distributed environments , 2009, HPDC '09.

[15]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[16]  Ciprian Dobre,et al.  A dynamic rescheduling algorithm for resource management in large scale dependable distributed systems , 2012, Comput. Math. Appl..

[17]  Victor V. Toporkov,et al.  Core Heuristics for Preference-Based Scheduling in Virtual Organizations of Utility Grids , 2014, IDC.

[18]  Jarek Nabrzyski,et al.  Multicriteria aspects of Grid resource management , 2004 .