A hybrid algorithm for grid task scheduling problem
Hamid Jazayeriy · 2013
At the beginning the Grid computing and Grid technologies was used for scientific and technical jobs where computers were distributed geographically, connected through internet, are used in order to invent virtual supercomputers with high computing competency. The goal of inventing such a virtual supercomputer was solving complex scientific problems in less time than before. The goal of task scheduling in Grid systems is decreasing the total completion time of the all tasks with providing a timetable to perform all existing tasks. The problem of task scheduling in grid systems has large solution space and is considered as a kind of NP-Hard problems. In this paper a new method for solving task scheduling in Grid computing system is proposed by combining Genetic Algorithm with Tabu Search Algorithm. The goal of proposed algorithm is to combining the global search abilities of Genetic Algorithm with local search of Tabu Search, and creating a stable algorithm that highly guarantees the accessing of the global optima. The proposed algorithm is compared with other heuristic algorithms and experimental results showed that the proposed algorithm has high efficiency for solving task scheduling in Grid computing.