Dynamic multi DAG scheduling algorithm for optical grid environment

Author(s):  
Liying Zhu ◽  
Zhenyu Sun ◽  
Wei Guo ◽  
Yaohui Jin ◽  
Weiqiang Sun ◽  
...  
2006 ◽  
Author(s):  
Wei Guo ◽  
Zhenyu Sun ◽  
Zhengyu Wang ◽  
Pengshan Zhang ◽  
Jing Ma ◽  
...  

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.


2013 ◽  
Vol 8 (10) ◽  
Author(s):  
Lijun Cao ◽  
Xiyin Liu ◽  
Torkel Hans-Georg Hans-Georg ◽  
Zhongping Zhang

Author(s):  
Lingzhi Zhang ◽  
Wei Guo ◽  
Yaohui Jin ◽  
Weiqiang Sun ◽  
Weisheng Hu

2013 ◽  
Vol 321-324 ◽  
pp. 2507-2513
Author(s):  
Zhong Ping Zhang ◽  
Li Juan Wen

In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward the LoBa-Min-Min algorithm, which is based on load balance. This algorithm first used Min-Min algorithm preliminary scheduling, then according to the standard of reducing Makespan, the tasks on heavy-loaded resources would be assigned to resources that need less time to load balance, raise resource utilization rate, and achieve lesser completion time. At last, we used benchmark of instance proposed by Braun et al. to prove feasibility and effectiveness of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document