摘要
ｎ个独立任务在ｍ个同等并行处理机上处理，使总完成时间最小的非抢先调度是确定性调度理论的一个基本问题．文中提出一种算法——ＢｏｕｎｄＦｉｔ算法，它的最坏情况性能至少和ＭＵＬＴＩＦＩＴ算法一样甚至更好。
The problem of nonpreemtively scheduling n independent tasks on m identical parallel processors in order to minimize the makespan is one of the fundamental problems of deterministic scheduling theory. In this paper, an algorithm called Bound Fit is presented. This algorithm has the same or better worst case performance with shorter running time.
出处
《自动化学报》
EI
CSCD
北大核心
1997年第1期81-84,共4页
Acta Automatica Sinica
基金
国家自然科学基金
关键词
同等并行处理机
非抢先调度
启发式算法
Identical parallel processor, nonpreemptive scheduling, heuristic.
