1) nonpreemptively scheduling
非抢先调度
1.
In view of a class of nonpreemptively scheduling n independent tasks on m non-identical multiprocessors to minimize the maximum workload, an algorithm called error minimum (EM) algorithm, which is based on the double minimum-balance algorithm is put forward and its time complexity is analyzed.
针对一类n个独立任务在m个不完全同等的处理机上处理,使处理机的最大负荷为最小的非抢先调度问题,在双最小平衡算法的基础上提出了误差极小化算法,并分析了它的时间复杂性。
2.
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.
针对一类n个独立任务在m个不完全同等的处理机上处理 ,使处理机的最大负荷为最小的非抢先调度问题 ,提出了一种启发式算法———最小平衡算法 ,并分析了它的时间复杂性。
2) preemptive schedule; preemptive scheduling
抢先调度
3) preemptive short packets priority scheduling
短包抢先调度
4) preemptive scheduling strategy
抢先调度策略
5) non-preemptive scheduling
非抢占式调度
6) nonpreemptive algorithm
非抢先算法
补充资料：抢先
1.争先﹐抢在前面。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条