Use of genetic algorithms for scheduling jobs in large scale grid applications

Abstract In this paper we present the implementation of Genetic Algorithms (GA) for job scheduling on computational grids that optimizes the makespan and the total flowtime. Job scheduling on computational grids is a key problem in large scale grid‐based applications for solving complex problems. The aim is to obtain an efficient scheduler able to allocate a large number of jobs originated from large scale applications to grid resources. Several variations for GA operators are examined in order to identify which works best for the problem. To this end we have developed a grid simulator package to generate large and very large size instances of the problem and have used them to study the performance of GA implementation. Through extensive experimenting and fine tuning of parameters we have identified the configuration of operators and parameters that outperforms the existing implementations in the literature for static instances of the problem. The experimental results show the robustness of the implementa...

[1]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[2]  Martijn Meijer,et al.  Scheduling parallel processes using genetic algorithms , 2004 .

[3]  Albert Y. Zomaya,et al.  Observations on Using Genetic Algorithms for Dynamic Load-Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[4]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[5]  Enrique Alba,et al.  MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note) , 2002, Euro-Par.

[6]  Joel H. Saltz,et al.  Performance optimization for data intensive grid applications , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[7]  Sven Leyffer,et al.  Solving Large MINLPs on Computational Grids , 2002 .

[8]  Mark H. Ellisman,et al.  Data-intensive e-science frontier research , 2003, CACM.

[9]  Andrew J. Page,et al.  Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[10]  Vincenzo Di Martino,et al.  Sub optimal scheduling in a grid using genetic algorithms , 2003, Parallel Comput..

[11]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[12]  Stephen J. Wright.  Solving optimization problems on computational grids. , 2001 .

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

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

[15]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.