Biobjective Scheduling Algorithms for Execution Time-Reliability Trade-off in Heterogeneous Computing Systems

2005 ◽  
Vol 48 (3) ◽  
pp. 300-314 ◽  
Author(s):  
A. Dogan
2013 ◽  
Vol 65 (2) ◽  
pp. 886-902 ◽  
Author(s):  
Hong Jun Choi ◽  
Dong Oh Son ◽  
Seung Gu Kang ◽  
Jong Myon Kim ◽  
Hsien-Hsin Lee ◽  
...  

2012 ◽  
Vol 457-458 ◽  
pp. 1039-1046 ◽  
Author(s):  
You Wei Lu ◽  
Zhen Zhen Xu ◽  
Feng Xia

Independent task scheduling algorithms in distributed computing systems deal with three main conflicting factors including load balance, task execution time and scheduling cost. In this paper, the problem of scheduling tasks arriving at a low rate and with long execution time in heterogeneous computing systems is studied, and a new scheduling algorithm based on prediction is proposed. This algorithm evaluates the utility of task scheduling based on statistics and prediction to solve the influence of heterogeneous computing systems. The experimental results reveal that the proposed algorithm adequately balances the conflicting factors, and thus performs better than some classical algorithms such as MCT and MET when the parameters are well selected.


Sign in / Sign up

Export Citation Format

Share Document