A hybrid batch job scheduling algorithm for grid environment

Grid computing is a collection of geographically heterogeneous distributed computational resources that enables users for sharing data and other computing resources. One of the major challenges in grid computing is how to schedule batch jobs across such an environment with minimum makespan (the finishing time of the last job) and flow time. In this study, a hybrid batch job scheduling method is proposed for grid environment that combines genetic and particle swarm optimization techniques to reduce makespan and flowtime. Experimental results show a reduction in makespan for 7 out of 12 instances of Braun workload comparing to minmin, maxmin, and discrete PSO algorithms.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[3]  O. Weck,et al.  A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM , 2005 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Ajith Abraham,et al.  A DISCRETE PARTICLE SWARM OPTIMIZATION APPROACH FOR GRID JOB SCHEDULING , 2009 .

[7]  Fatos Xhafa,et al.  A GA+TS Hybrid Algorithm for Independent Batch Scheduling in Computational Grids , 2011, 2011 14th International Conference on Network-Based Information Systems.

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

[9]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  Rafael Rivera-López,et al.  Genetic-Annealing Algorithm in Grid Environment for Scheduling Problems , 2010, SUComS.

[11]  Kenichi Hagihara,et al.  A comparison among grid scheduling algorithms for independent coarse-grained tasks , 2004, 2004 International Symposium on Applications and the Internet Workshops. 2004 Workshops..

[12]  Enrique Alba,et al.  A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling , 2012, Appl. Soft Comput..

[13]  Mukesh Singhal,et al.  Hybrid Metaheuristic Algorithm for Job Scheduling on Computational Grids , 2013, Informatica.

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

[15]  Ruey-Maw Chen,et al.  Combined Discrete Particle Swarm Optimization and Simulated Annealing for Grid Computing Scheduling Problem , 2009, ICIC.

[16]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.