Comparative Study of Job Scheduling Algorithms in Grid Computing

Author(s):  
M. Ashok Kumar ◽  
T. Sai Srinivas ◽  
Raksha Pandey
2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve

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.


2015 ◽  
Vol 115 (15) ◽  
pp. 17-20 ◽  
Author(s):  
Seema Kumari ◽  
Gulshan Kumar

Author(s):  
Nikolaos Preve

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.


2012 ◽  
Vol 8 (6) ◽  
pp. 125-140 ◽  
Author(s):  
Adil Yousif ◽  
Sulaiman Mohd Nor ◽  
Abdul Hanan Abdualla ◽  
Mohammed Bakri Bashir

2012 ◽  
pp. 1114-1131
Author(s):  
Nikolaos Preve

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.


2016 ◽  
Vol 3 (1) ◽  
pp. 30 ◽  
Author(s):  
NASEERA SHAIK ◽  
JYOTHEESWAI P ◽  
◽  

2019 ◽  
Vol 28 (1) ◽  
pp. 306-310
Author(s):  
Mervat Said ◽  
Zeiad El-Saghir ◽  
Nawal EL-Fishawy

Sign in / Sign up

Export Citation Format

Share Document