同等并行处理机上独立任务的调度
Independent Tasks Scheduling on Identical Parallel Processors
-
摘要: n个独立任务在m个同等并行处理机上处理,使总完成时间最小的非抢先调度是确 定性调度理论的一个基本问题.文中提出一种算法--Bound Fit算法,它的最坏情况性能 至少和MULTIFIT算法一样甚至更好,而所需的时间却比MULTIFIT算法少.Abstract: 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.
-
Key words:
- Identical Parallel processor /
- nonpreemptive scheduling /
- heuristic
-
点击查看大图
计量
- 文章访问数: 2176
- HTML全文浏览量: 84
- PDF下载量: 1264
- 被引次数: 0
下载:
