An Hybrid Evaluative Algorithm Applied to Task Scheduling

Since the task scheduling in grid computing faces a NP-hard problem, it leads very difficult to validate the methods of task scheduling. This paper combined with the advantages of two evaluative algorithms: genetic algorithm and simulated annealing, brings forward an hybrid evaluative algorithm and applied to solve task scheduling problem in grid computing. From the analysis and experiment result, it is concluded that this algorithm is superior to genetic algorithm and simulated annealing

[1]  Rajkumar Buyya,et al.  Nature's heuristics for scheduling jobs on Computational Grids , 2000 .

[2]  Marco Mililotti,et al.  Scheduling in a grid computing environment using genetic algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[3]  Zheng Shijue,et al.  A load balanced method based on campus grid , 2005, IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005..

[4]  Zhou Guo.  Strong Convergence (a.s.)of Global Annealing Genetic Algorithm , 2003 .

[5]  David Abramson,et al.  Grid Resource Management, Scheduling and Computational Economy , 2000 .