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

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

Tarun Kumar Ghosh, Sanjoy Das
Copyright: © 2018 |Pages: 15
DOI: 10.4018/JITR.2018100105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

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.
Article Preview
Top

In computational Grid, a large number of heterogeneous resources across many organizations are employed for executing various jobs concurrently and efficiently. Due to such environment characteristics, the job scheduling in Grid is an NP-hard problem (Ma et al., 2011). New approaches, particularly those based in meta-heuristic algorithms, have been proposed to solve the Grid scheduling problems. These sorts of approaches make realistic assumptions based on a priori knowledge of the concerning environment and of the system load characteristics. The most frequently used meta-heuristic algorithms are Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO) and Cuckoo Search Algorithm (CSA).

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 15: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 14: 4 Issues (2021)
Volume 13: 4 Issues (2020)
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing