Differential evolution algorithms for grid scheduling problem

Differential evolution (DE) has recently emerged as simple and efficient algorithm for global optimization over continuous spaces. DE shares many features of the classical genetic algorithms (GA). But it is much easier to implement than GA and applies a kind of differential mutation operator on parent chromosomes to generate the offspring. Grid computing aims to allow unified access to data, computing power, sensors and other resources through a single virtual laboratory. Scheduling is a key problem in emergent computational systems, such as grid and P2P, in order to benefit from the large computing capacity of such systems. In this paper, we present differential evolution algorithm based on schedulers for efficiently allocating jobs to resources in a grid computing system. Several variations for DE are examined in order to identify which works best for the grid scheduling problem.

[1]  Abid Ali Minhas,et al.  A novel cost-based framework for communication in computational grid using Anycast Routing , 2011 .

[2]  Bin Yao,et al.  A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[3]  Abdul Hanan Abdullah,et al.  Localized job scheduling system using cooperative and system-centric scheduling policy for market-oriented grids , 2011 .

[4]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

[5]  Daphne Lopez,et al.  Dynamic task scheduling using service time error and virtual finish time , 2011 .

[6]  Josiah Adeyemo,et al.  Optimizing planting areas using differential evolution (DE) and linear programming (LP) , 2009 .

[7]  Fatos Xhafa,et al.  Meta-heuristics for Grid Scheduling Problems , 2008 .

[8]  Jian-Zhong Li,et al.  Performance Analysis of Task Scheduling Heuristics in Grid , 2007, 2007 International Conference on Machine Learning and Cybernetics.

[9]  Stefka Fidanova,et al.  Ant Algorithm for Grid Scheduling Problem , 2005, LSSC.

[10]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[11]  Howard Jay Siegel,et al.  High-performance mixed-machine heterogeneous computing , 1998, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -.

[12]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[13]  Václav Snásel,et al.  Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

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

[15]  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..

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

[17]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..