A Hybrid Algorithm for DAG Application Scheduling on Computational Grids

In the late three decades, grid computing has emerged as a new field providing a high computing performance to solve larger scale computational demands. Because Directed Acyclic Graph DAG application scheduling in a distributed environment is a NP-Complete problem, meta-heuristics are introduced to solve this issue. In this paper, we propose to hybridize two well-known heuristics. The first one is the Heterogeneous Earliest Finish Time HEFT heuristic which determines a static scheduling for a DAG in a heterogeneous environment. The second one is Particle Swarm Optimization PSO which is a stochastic meta-heuristic used to solve optimization problems. This hybridization aims to minimize the makespan i.e., overall completion time of all the tasks within the DAG. The experimental results that have been conducted under hybridization show that this approach improves the scheduling in terms of completion time compared to existing algorithms such as HEFT.

[1]  S. Ranka,et al.  Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors , 1992, Proceedings Supercomputing '92.

[2]  Yuehui Chen,et al.  A Task Scheduling Algorithm Based on PSO for Grid Computing , 2008 .

[3]  Yang Gao,et al.  Adaptive grid job scheduling with genetic algorithms , 2005, Future Gener. Comput. Syst..

[4]  Shanshan Song,et al.  Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[5]  Dharma P. Agrawal,et al.  Optimal Scheduling Algorithm for Distributed-Memory Machines , 1998, IEEE Trans. Parallel Distributed Syst..

[6]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[7]  A. Abraham,et al.  Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm , 2010, Future Gener. Comput. Syst..

[8]  Rajkumar Buyya,et al.  Workflow scheduling algorithms for grid computing , 2008 .

[9]  Jing-Chiou Liou,et al.  An Efficient Task Clustering Heuristic for Scheduling DAGs on Multiprocessors , 2007 .

[10]  Boontee Kruatrachue,et al.  Grain size determination for parallel processing , 1988, IEEE Software.

[11]  Arjan J. C. van Gemund,et al.  On the complexity of list scheduling algorithms for distributed-memory systems , 1999, ICS '99.

[12]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

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

[14]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[15]  Cristina Boeres,et al.  A cluster-based strategy for scheduling task on heterogeneous processors , 2004 .

[16]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

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

[18]  Alioune Ngom,et al.  Genetic algorithm based scheduler for computational grids , 2005, 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05).

[19]  Dharma P. Agrawal,et al.  Improving scheduling of tasks in a heterogeneous environment , 2004, IEEE Transactions on Parallel and Distributed Systems.

[20]  Yuanyuan Zhang,et al.  A Dynamic Task Scheduling Algorithm for Grid Computing System , 2004, ISPA.

[21]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[22]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[23]  Marco Mililotti,et al.  Sub optimal scheduling in a grid using genetic algorithms , 2004, Parallel Comput..

[24]  Anthony A. Maciejewski,et al.  Task Matching and Scheduling in Heterogenous Computing Environments Using a Genetic-Algorithm-Based Approach , 1997, J. Parallel Distributed Comput..

[25]  Ishfaq Ahmad,et al.  A New Approach to Scheduling Parallel Programs Using Task Duplication , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

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

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

[28]  Rajkumar Buyya,et al.  Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids , 2005, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05).