A hybrid scheduling technique for grid workflows in advance reservation environments

Scheduling workflows in Grids with the goal of minimizing the completion time is a challenging optimisation problem. Communication times between dependent tasks affect the schedule length only if the tasks are scheduled on different resources, and this makes it difficult to predict the critical path of the scheduled workflow. To address this difficulty, we introduce a new variation of critical path scheduling that ignores communication times between dependent tasks under certain conditions. Furthermore, we propose a hybrid scheduling method that computes five different schedules, based on the combination of two resource selection rules with four job selection rules, and then uses the best of the five. In simulation experiments for workflow scheduling in an advance reservation environment conducted with GridSim, it is shown that the proposed hybrid scheduling method achieves makespan improvements of up to 25.5% on benchmark workflows, compared to previous methods.

[1]  Rajkumar Buyya,et al.  A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids , 2007, Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007).

[2]  Ewa Deelman,et al.  The cost of doing science on the cloud: the Montage example , 2008, HiPC 2008.

[3]  H. T. Mouftah,et al.  Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[4]  Axel Keller,et al.  The virtual resource manager: an architecture for SLA-aware resource management , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[5]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[6]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[7]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[8]  Emmanouel A. Varvarigos,et al.  Joint Communication and Computation Task Scheduling in Grids , 2008, 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID).

[9]  M. A. Cleveland,et al.  The Problem With Critical Path Scheduling Algorithms , 1996 .

[10]  Kurt Stockinger,et al.  Simulation of Dynamic Grid Replication Strategies in OptorSim , 2002, GRID.

[11]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[12]  Rajkumar Buyya,et al.  Visual Modeler for Grid Modeling and Simulation (GridSim) Toolkit , 2003, International Conference on Computational Science.

[13]  Carl Kesselman,et al.  A provisioning model and its comparison with best-effort for performance-cost optimization in grids , 2007, HPDC '07.

[14]  Thomas Erlebach,et al.  A new resource mapping technique for Grid workflows in advance reservation environments , 2010, 2010 International Conference on High Performance Computing & Simulation.

[15]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  Konstantinos Christodoulopoulos,et al.  Routing and scheduling connections in networks that support advance reservations , 2008, Comput. Networks.

[18]  Rizos Sakellariou,et al.  Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).