Editor/Reviewer loginFrequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 5 Issue 1
Presenting a new Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment
Firoozeh Ghazipour Seyed Javad Mirabedini
10.7753/IJCATR0501.1003
keywords : jobs, scheduling, Grid environment, Ant Colony Optimization (ACO), makespan.
Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Job scheduling in computing grid is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm simulates the behavior of ants. In this paper, a new Ant Colony Optimization (ACO) algorithm is proposed for job scheduling in the Grid environment. The main contribution of this paper is to minimize the makespan of a given set of jobs. Compared with the other job scheduling algorithms, the proposed algorithm can outperform them according to the experimental results.
@artical{f512016ijcatr05011003,
Title = "Presenting a new Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "5",
Issue ="1",
Pages ="15 - 19",
Year = "2016",
Authors ="Firoozeh Ghazipour
Seyed Javad Mirabedini"}
The paper proposes a new Ant Colony Optimization (ACO) algorithm in grid environment.
The proposed algorithm schedules the jobs efficiently in grid environment.
The proposed algorithm uses utility formulas to assign jobs into available resources.
In the Simulation, a performance evaluation of the proposed algorithm is carried out.