Dynamic Level Task Scheduling Algorithm based on Risk Estimation Model in Grid Computing

2008 ◽  
Author(s):  
Yi Kan ◽  
Wang Ru-chuan ◽  
Ren Xun-yi ◽  
Ji Yi-mu
Keyword(s):  
Grid Computing ◽  
Task Scheduling ◽  
Risk Estimation ◽  
Scheduling Algorithm ◽  
Estimation Model ◽  
Dynamic Level ◽  
Task Scheduling Algorithm

An Efficient Resources Management Model and Task Scheduling Algorithm in Grid Computing

2011 ◽  
Vol 50-51 ◽  
pp. 526-530 ◽  
Author(s):  
Xiao Bo Gao
Keyword(s):  
Grid Computing ◽  
Task Scheduling ◽  
Resource Sharing ◽  
Large Scale ◽  
Scheduling Algorithm ◽  
Management Model ◽  
Network Computing ◽  
Resources Management ◽  
Task Scheduling Algorithm ◽  
And Task

From the perspective of resource sharing, grid computing is a system ranging from small kind of network system for home using to large-scale network computing systems even to the Internet. The management of resources in the grid environment becomes very complex as these resources are distributed geographically, heterogeneous in nature, and each having their own resource management policies and different access as well as cost models. In this paper, we bring forward an efficient resources management model and task scheduling algorithm in grid computing. The simulation results show that the proposed algorithm achieves resource load balancing, and can be applied to the optimization of task scheduling successfully.

Research of Load Balancing Scheduling under Grid Computing

2014 ◽  
Vol 577 ◽  
pp. 935-938
Author(s):  
Cheng Yu Cai ◽  
Yuan Sheng Lou
Keyword(s):  
Load Balancing ◽  
Grid Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
The Other ◽  
Task Scheduling Algorithm ◽  
Better Than

In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into Min-Min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-Min, Min-Min were compared, which proved that T-Max-Min is better than the other two algorithms in aspects of Makespan and load balancing.

Sign in / Sign up

Export Citation Format

Share Document