Job Scheduling in Computational Grid Using a Hybrid Algorithm Based on Particle Swarm Optimization and Extremal Optimization

Abstract

Grid computing has been used as a new paradigm for solving large and complex scientific problems using resource sharing mechanism through many distributed administrative domains. One of the most challenging issues in computational Grid is efficient scheduling of jobs, because of distributed heterogeneous nature of resources. In other words, the job scheduling in computational Grid is an NP-hard problem. Thus, the use of meta-heuristic is more appropriate option in obtaining optimal results. In this article, the authors propose a novel hybrid scheduling algorithm which combines intelligently the exploration ability of Particle Swarm Optimization (PSO) with the exploitation ability of Extremal Optimization (EO) which is a recently developed local-search heuristic method. The hybrid PSO-EO reduces the schedule makespan, processing cost, and job failure rate and improves resource utilization. The proposed hybrid algorithm is compared with the standard PSO, population-based EO (PEO) and standard Genetic Algorithm (GA) methods on all these parameters. The comparison results exhibit that the proposed algorithm outperforms other three algorithms.