A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids

The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybridization of Genetic Algorithms (GAs) and Tabu Search (TS) for scheduling in computational grids. The purpose in this hybridization is to benefit the exploration of the solution space by a population of individuals with the exploitation of solutions through a smart search of the TS. Our GA(TS) hybrid algorithm runs the GA as the main algorithm and calls TS procedure to improve individuals of the population. We evaluated the proposed hybrid algorithm using different Grid scenarios generated by a Grid simulator. The computational results showed that the hybrid algorithm outperforms both the GA and TS for the makespan value but cannot outperform them for the flowtime of the scheduling.

[1]  El-Ghazali Talbi,et al.  Hybridizing exact methods and metaheuristics: A taxonomy , 2009, Eur. J. Oper. Res..

[2]  Fatos Xhafa,et al.  Requirements for an Event-Based Simulation Package for Grid Systems , 2007, J. Interconnect. Networks.

[3]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[4]  Fatos Xhafa,et al.  Genetic algorithm based schedulers for grid computing systems , 2007 .

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

[6]  Enrique Alba,et al.  Efficient parallel LAN/WAN algorithms for optimization. The mallba project , 2006, Parallel Comput..

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

[8]  Fatos Xhafa,et al.  An Experimental Study on Genetic Algorithms for Resource Allocation on Grid Systems , 2007, J. Interconnect. Networks.

[9]  El-Ghazali Talbi,et al.  Building with ParadisEO reusable parallel and distributed evolutionary algorithms , 2004, Parallel Comput..

[10]  Fatos Xhafa,et al.  Immediate mode scheduling in grid systems , 2007, Int. J. Web Grid Serv..

[11]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[12]  Fatos Xhafa,et al.  Batch mode scheduling in grid systems , 2007, Int. J. Web Grid Serv..

[13]  Enrique Alba,et al.  A Tabu Search Algorithm for Scheduling Independent Jobs in Computational Grids , 2009, Comput. Informatics.

[14]  Steven Halim,et al.  A development framework for rapid meta-heuristics hybridization , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[15]  Fatos Xhafa,et al.  A Hybrid Evolutionary Heuristic for Job Scheduling on Computational Grids , 2007 .

[16]  John Levine,et al.  A fast, effective local search for scheduling independent jobs in heterogeneous computing environments , 2003 .