scholarly journals A Survey on Grid Computing Scheduling Algorithms

2020 ◽  
Vol 8 (6) ◽  
pp. 731-736
Author(s):  
Lav Ram Gabri
Keyword(s):  
Grid Computing ◽  
Scheduling Algorithms

Balanced Job Scheduling Based on Ant Algorithm for Grid Network

2010 ◽  
Vol 2 (1) ◽  
pp. 34-50 ◽  
Author(s):  
Nikolaos Preve
Keyword(s):  
Grid Computing ◽  
Ant Colony Optimization ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Experimental Results ◽  
Ant Algorithm ◽  
Entire System ◽  
Grid Environment ◽  
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 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.

The Cost-Based Resource Management in Combination with Qos For Grid Computing

2011 ◽  
pp. 74-90
Author(s):  
Chuliang Weng ◽  
Jian Cao ◽  
Minglu Li
Keyword(s):  
Resource Management ◽  
Grid Computing ◽  
Scheduling Algorithms ◽  
Computational Grid ◽  
Online Scheduling ◽  
Management Issue ◽  
Job Assignment ◽  
The Cost

In the grid context, the scheduling can be grouped into two categories: offline scheduling and online scheduling. In the offline scheduling scenario, the sequence of jobs is known in advance, scheduling is based on information about all jobs in the sequence. While, in the online scheduling scenario a job is known only after all predecessors have been scheduled, and a job is scheduled only according to information of its predecessors in the sequence. This chapter focuses on resource management issue in the grid context, and introduces the two cost-based scheduling algorithms for offline job assignment and online job assignment on the computational grid, respectively.

The Cost-Based Resource Management in Combination with QoS for Grid Computing

2012 ◽  
pp. 1084-1098
Author(s):  
Chuliang Weng ◽  
Jian Cao ◽  
Minglu Li
Keyword(s):  
Resource Management ◽  
Grid Computing ◽  
Scheduling Algorithms ◽  
Computational Grid ◽  
Online Scheduling ◽  
Management Issue ◽  
Job Assignment ◽  
The Cost

In the grid context, the scheduling can be grouped into two categories: offline scheduling and online scheduling. In the offline scheduling scenario, the sequence of jobs is known in advance, scheduling is based on information about all jobs in the sequence. While, in the online scheduling scenario a job is known only after all predecessors have been scheduled, and a job is scheduled only according to information of its predecessors in the sequence. This chapter focuses on resource management issue in the grid context, and introduces the two cost-based scheduling algorithms for offline job assignment and online job assignment on the computational grid, respectively.

Sign in / Sign up

Export Citation Format

Share Document