%0 Journal Article
%T Independent tasks scheduling algorithm based on dynamic fit degree<br>基于动态适应度的独立任务调度算法
%A WANG Xiu-li
%A NING Zheng-yuan
%A <br>王秀丽
%A 宁正元
%J 计算机应用
%D 2006
%I 
%X After analyzing the advantages and disadvantages of the scheduling heuristics in the literature, in order to get better load balance and schedule more tasks to its more suitable machines at the same time, a new scheduling algorithm based on Dynamic Fit Degree (DFD) was put forward. The suitability of the machine with minimum time for finishing the task was described by task's DFD schema. The proposed algorithm used DFD as the priority, and the task with biggest DFD was scheduled first in each step. The simulation results compared with other scheduling algorithms show that the proposed algorithm produces better results.
%K heterogeneous computing systems
%K independent tasks scheduling
%K dynamic fit degree
%K minimum completion time<br>异构计算系统
%K 独立任务调度
%K 动态适应度
%K 最早完成时间
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=4ED6C972CEB80E02&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=59906B3B2830C2C5&sid=43C416DFC6CCEF98&eid=F20D7EAB2CFFC1DD&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=7