Paper Info
Title
Task scheduling on computational Grids using Gravitational Search Algorithm
Abstract
Grid computing uses distributed interconnected computers and resources collectively to achieve higher performance computing and resource sharing. Task scheduling is one of the core steps to efficiently exploit the capabilities of Grid environment. Recently, heuristic algorithms have been successfully applied to solve task scheduling on computational Grids. In this paper, Gravitational Search Algorithm (GSA), as one of the latest population-based metaheuristic algorithms, is used for task scheduling on computational Grids. The proposed method employs GSA to find the best solution with the minimum makespan and flowtime. We evaluate this approach with Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) method. The results demonstrate that the benefit of the GSA is its speed of convergence and the capability to obtain feasible schedules.
Year
DOI
Venue
2014
10.1007/s10586-013-0338-8
Cluster Computing
Keywords
Field
DocType
flowtime,gravitational search algorithm,grid task scheduling,makespan
Particle swarm optimization,Mathematical optimization,Job shop scheduling,Grid computing,Fair-share scheduling,Computer science,Parallel computing,Dynamic priority scheduling,Genetic algorithm,Grid,Metaheuristic,Distributed computing
Journal
Volume
Issue
ISSN
17
3
1573-7543
Citations 
PageRank 
References 
5
0.41
29
Authors
2
Name
Order
Citations
PageRank
Amirreza Zarrabi1152.26
Khairulmizam Samsudin29213.43