Advance Reservation Policies for Workflows

Advance reservation of resources has been suggested as a means to provide a certain level of support that meets user expectations with respect to specific job start times in parallel systems. Those expectations may relate to a single job application or an application that consists of a collection of dependent jobs. In the context of Grid computing, applications consisting of dependent tasks become increasingly important, usually known as workflows. This paper focuses on the problem of planning advance reservations for individual tasks of workflow-type of applications when the user specifies a requirement only for the whole workflow application. Two policies to automate advance reservation planning for individual tasks efficiently are presented and evaluated.

[1]  Ken Kennedy,et al.  Scheduling strategies for mapping application workflows onto the grid , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[2]  Muthucumaru Maheswaran,et al.  Scheduling Co-Reservations with Priorities in Grid Computing Systems , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[3]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[4]  Rizos Sakellariou,et al.  A hybrid heuristic for DAG scheduling on heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[5]  Junwei Cao,et al.  Queue scheduling and advance reservations with COSY , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[6]  Radu Prodan,et al.  Scheduling of scientific workflows in the ASKALON grid environment , 2005, SGMD.

[7]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[8]  Honbo Zhou,et al.  The EASY - LoadLeveler API Project , 1996, JSSPP.

[9]  Dror G. Feitelson,et al.  Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling , 2001, IEEE Trans. Parallel Distributed Syst..

[10]  Rizos Sakellariou,et al.  An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm , 2003, Euro-Par.

[11]  Uwe Schwiegelshohn,et al.  Resource Management for Future Generation Grids , 2004, Future Generation Grids.

[12]  Evgenia Smirni,et al.  Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems , 2002, JSSPP.

[13]  Rizos Sakellariou,et al.  An evaluation of heuristics for SLA based parallel job scheduling , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[14]  Yves Robert,et al.  The iso-level scheduling heuristic for heterogeneous processors , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[15]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[16]  C. Kesselman,et al.  Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory , 2004 .

[17]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[18]  Evgenia Smirni,et al.  Self-adapting backfilling scheduling for parallel systems , 2002, Proceedings International Conference on Parallel Processing.

[19]  Viktor K. Prasanna,et al.  A unified resource scheduling framework for heterogeneous computing environments , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[20]  Vladimir Getov,et al.  Future Generation Grids: Proceedings of the Workshop on Future Generation Grids, November 1-5, 2004, Dagstuhl, Germany , 2006, Future Generation Grids.

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

[22]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[23]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[24]  Mark J. Clement,et al.  Core Algorithms of the Maui Scheduler , 2001, JSSPP.

[25]  Rizos Sakellariou,et al.  Towards Service Level Agreement Based Scheduling on the Grid , 2004 .

[26]  Uwe Schwiegelshohn,et al.  Parallel Job Scheduling - A Status Report , 2004, JSSPP.

[27]  Arjan J. C. van Gemund,et al.  Low-Cost Task Scheduling for Distributed-Memory Machines , 2002, IEEE Trans. Parallel Distributed Syst..

[28]  Warren Smith,et al.  Scheduling with advanced reservations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[29]  Erik Hagersten,et al.  THROOM — Supporting POSIX Multithreaded Binaries on a Cluster , 2003 .

[30]  David Lifka,et al.  Users guide to the Argonne SP scheduling system , 1995 .

[31]  Rizos Sakellariou,et al.  A Low-Cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems , 2004, European Across Grids Conference.

[32]  Ladislau Bölöni,et al.  Robust scheduling of metaprograms , 2002 .

[33]  Rizos Sakellariou,et al.  A low-cost rescheduling policy for efficient mapping of workflows on grid systems , 2004, Sci. Program..