Hybrid task scheduling: integrating static and dynamic heuristics

Researchers are constantly looking for ways to improve the execution time of parallel applications on distributed systems. Although compile-time static scheduling heuristics employ complex mechanisms, the quality of their schedules are handicapped by estimated run-time costs. On the other hand, while dynamic schedulers use actual run-time costs, they have to be of low complexity in order to reduce the scheduling overhead. We investigate the viability of integrating these two approaches into a hybrid scheduling framework. The relationship between static schedulers, dynamic heuristics and scheduling events are examined. The results show that a hybrid scheduler can indeed improve the schedules produced by good traditional static list scheduling algorithms.

[1]  Cristina Boeres,et al.  Cluster-Based Task Scheduling for the LOGP Model , 1999, Int. J. Found. Comput. Sci..

[2]  Muthucumaru Maheswaran,et al.  Distributed dynamic scheduling of composite tasks on grid computing systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

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

[4]  David Fernández-Baca,et al.  Allocating Modules to Processors in a Distributed System , 1989, IEEE Trans. Software Eng..

[5]  Yves Robert,et al.  Static Scheduling Strategies for Heterogeneous Systems , 2002, Comput. Artif. Intell..

[6]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[7]  Francine Berman,et al.  Models and scheduling mechanisms for global computing applications , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  Howard Jay Siegel,et al.  A dynamic matching and scheduling algorithm for heterogeneous computing systems , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[9]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[10]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[11]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[12]  Cristina Boeres,et al.  EasyGrid: Towards a Framework for the Automatic Grid Enabling of MPI Applications , 2003, Middleware Workshops.

[13]  Peter Thanisch,et al.  On the Scope of Applicability of the ETF Algorithm , 1995, IRREGULAR.

[14]  Henri Casanova,et al.  Simgrid: a toolkit for the simulation of application scheduling , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[15]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

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