An Improved Shuffled Frog Leaping Algorithm for Grid Task Scheduling

Grid computing has attracted many researchers´ attention in the past few decades, and task scheduling is the key technology in Grid computing. The dynamic, heterogeneous and autonomous characteristics of grid make the scheduling approach a complex optimization problem. Many algorithms based on heuristic algorithm, genetic algorithm and particle swarm optimization algorithm have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. In this paper, an improved shuffled frog leaping algorithm is proposed to solve the task scheduling in grid environment, and the simulation experiment results show that the new gird task scheduling algorithm is more robust and efficient than the existing algorithms.