摘要
针对一种具有普遍意义的任务调度模型,从算法特点出发讨论和分析各种启发式调度算法,得出min-min启发式算法和遗传算法在异构计算环境下有较好的性能表现.
Heuristic scheduling algorithms are needed when dealing with the NP-complete task scheduling problem. In this paper, an underlying model for task scheduling is proposed, and then 9 kinds of heuristic scheduling algorithms are analyzed and described in order to research scheduling algorithms based on this model. That min-min heuristic algorithm and genetic heuristic algorithm are needed to be improved based on various performance demands is the trend of the scheduling algorithms in heterogeneous computing environment.
出处
《微电子学与计算机》
CSCD
北大核心
2006年第z1期119-121,共3页
Microelectronics & Computer
基金
北京工业大学计算机学院研究生科技基金项目(ykj-2005-139)
