Heuristic of Anticipation for Fair Scheduling and Resource Allocation in Grid VOs

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

[1]  Victor V. Toporkov,et al.  Scheduling in Grid Based on VO Stakeholders Preferences and Criteria , 2016, DepCoS-RELCOMEX.

[2]  Victor V. Toporkov,et al.  Heuristic strategies for preference-based scheduling in virtual organizations of utility grids , 2015, J. Ambient Intell. Humaniz. Comput..

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

[4]  Anthony T. Chronopoulos,et al.  Cost minimization in utility computing systems , 2014, Concurr. Comput. Pract. Exp..

[5]  Valentin Cristea,et al.  Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing , 2015, Future Gener. Comput. Syst..

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

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

[8]  Victor V. Toporkov,et al.  Composite Scheduling Strategies in Distributed Computing with Non-dedicated Resources , 2012, ICCS.

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

[10]  Richard Wolski,et al.  Eliciting honest value information in a batch-queue environment , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[11]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[12]  Adam Wierzbicki,et al.  Fair Game-Theoretic Resource Management in Dedicated Grids , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

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

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

[15]  Rajkumar Buyya,et al.  Fair resource sharing in hierarchical virtual organizations for global grids , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[16]  Daniel Grosu,et al.  Divisible Load Scheduling: An Approach Using Coalitional Games , 2007, Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07).

[17]  Helen D. Karatza,et al.  Job Scheduling in a Distributed System Using Backfilling with Inaccurate Runtime Computations , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

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