Grid Task Schedule Algorithm Based on Load Balance
Dake He · Jisuanji gongcheng · 2010
Among the task schedule algorithms,optimal bipartite matching can not be used for scheduling the DAG tasks directly,and the computing capabilities of machines and communication times used for data transfers between them are not considered in Earliest Time Path(ETF) algorithm. Considering such problems,an improved ETF task schedule algorithm based on optimal bipartite matching for heterogeneous computing environment is provided. Based on optimal bipartite matching for independent tasks and ETF algorithm,the algorithm considers not only the execution orders of the tasks and performance of the machines,but also the capabilities of communication between each machines and the results of the previous schedule results. Simulation experiments demonstrate that the algorithm can significantly improve the schedule performance in terms of schedule length and load balance.