An improved ant algorithm for job scheduling in grid computing

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this article is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Download Full-text

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

Evolving Developments in Grid and Cloud Computing ◽

10.4018/978-1-4666-0056-0.ch002 ◽

2012 ◽

pp. 13-30

Author(s):

Nikolaos Preve

Keyword(s):

Grid Computing ◽

Ant Colony Optimization ◽

Job Scheduling ◽

Scheduling Algorithm ◽

Scheduling Algorithms ◽

Experimental Results ◽

Ant Algorithm ◽

Entire System ◽

System Load ◽

Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Download Full-text

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

Grid and Cloud Computing ◽

10.4018/978-1-4666-0879-5.ch506 ◽

2012 ◽

pp. 1114-1131

Author(s):

Nikolaos Preve

Keyword(s):

Grid Computing ◽

Ant Colony Optimization ◽

Job Scheduling ◽

Scheduling Algorithm ◽

Scheduling Algorithms ◽

Experimental Results ◽

Ant Algorithm ◽

Entire System ◽

System Load ◽

Grid Network

Job scheduling in grid computing is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. The main scope of this paper is to propose a new Ant Colony Optimization (ACO) algorithm for balanced job scheduling in the Grid environment. To achieve the above goal, we will indicate a way to balance the entire system load while minimizing the makespan of a given set of jobs. Based on the experimental results, the proposed algorithm confidently demonstrates its practicability and competitiveness compared with other job scheduling algorithms.

Download Full-text