Task Matching and Scheduling Based on Global Genetic Simulated Annealing Algorithm
Changwu Zhu · Journal of Guangxi Normal University · 2006
Grid computing is a new computing-framework to meet the growing computational demands.Computational grids provides mechanisms for sharing and accessing large and heterogeneous collections of remote resources.However,how to schedule the subtasks in these heterogeneous resources is a critical problem.Combining the advantages of genetic algorithm and simulated annealing.This paper brings forward a global genetic simulated annealing algorithm and applied to solve grid computing task scheduling problem.Finally,the simulation results of the algorithm and conclusion are given.