摘要
针对一类n个独立任务在m个不完全同等的处理机上处理 ,使处理机的最大负荷为最小的非抢先调度问题 ,提出了一种启发式算法———最小平衡算法 ,并分析了它的时间复杂性。在此基础上 ,又将最小平衡算法和遗传算法结合起来 ,提出了基于遗传的最小平衡算法 ,并用实例证实了该算法的有效性。
In view of a class of nonpreemptively scheduling n independent tasks on m non identical multiprocessors to minimize the maximum workload, an algorithm called minimum balance algorthm(MBA) is initially put forward in this paper followed by the time complexity analysis of this algorithm. Based on the MBA, a genetics based MBA is presented which combines the MBA with Genetic Algorithm(GA), and an example is given to prove the effectiveness of this combined algorithm.
出处
《高技术通讯》
EI
CAS
CSCD
2000年第11期50-52,3,共4页
Chinese High Technology Letters
基金
86 3计划资助项目!(86 3 5 11 944 0 0 1)
