List scheduling algorithm of improved priority with considering load balance

Author(s):  
Ye Bo ◽  
Zhang Benfa ◽  
Li Feng ◽  
Zhang Xiaoyu ◽  
Li Xinjuan ◽  
...  
2011 ◽  
Vol 30 (12) ◽  
pp. 3184-3186
Author(s):  
Ming-quan WANG ◽  
Jiong YU ◽  
Yuan TIAN ◽  
Yun HAN

Author(s):  
Chafik Arar

In this article, the author uses a new variant of passive redundancy, which allows for a fictitious dual assignment by simultaneously scheduling two backup copies that overlap on the same communication bus at a given time. The proposed reliable fault tolerant greedy list scheduling algorithm is based on a superposed backup copy. This scheduling algorithm is considering up to n communication buses faults, caused by hardware faults and compensated by software redundancy solutions. it allows a reliable communication and efficient use of buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks from the DSPstone.


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