| 摘要: |
| 如何将n个独立任务调度到m台同型机上加工,使总完成时间最短,是一个复杂问题.通过分析Bound Fit预备算法的性质,结合MULTIFIT和Bound Fit提出QUICKFIT算法;对相同机器数和任务数,QUICKFIT能用比MULTIFIT和Bound Fit都少的迭代次数得到相同的总完成时间.实验结果表明,任务机器比越大,QUICKFIT算法的性能就越优于MULTIFIT和Bound Fit.绝大多数情况下,总完成时间等于MULTIFIT和Bound Fit中的最小者.该算法适用于大规模同型机调度. |
| 关键词: 同型机调度 装箱 LPT算法 MULTIFIT算法 任务机器比 |
| DOI： |
| 分类号: |
| 基金项目:国家863高科技发展计划基金资助项目(863-511-944-001) |
|
| A Quick Algorithm for Independent Tasks Scheduling on Identical Parallel Processors |
|
LI Xiao-ping,XU Xiao-fei,ZHAN De-chen
|
| Abstract: |
| QUICKFIT, a quick algorithm is developed by analyzing the properties of the preparatory algorithm of Bound Fit and integrating Bound Fit with MULTIFIT for scheduling independent tasks on identical parallel processors to minimize the make span. For the same tasks and machines, QUICKFIT needs a fewer iterations than MULTIFIT and Bound Fit do to obtain the same make span. Experimental results show that the greater the task-to-machine ratio is, the better the performance of QUICKFIT is than MULTIFIT and Bound Fit do to obtain the same make span.Experimental results show that the greater the task-to-machine ratio is,the better the performance of QUICKFIT is than MULTIFIT and Bound Fit,and the make span of QUICKFIT is the least among those of LPT,MULTIFIT and Bound Fit in most of cases,and QUICKFIT is suitable for the large scalee identical scheduling. |
| Key words: identical multiprocessor scheduling bin packing LPT algorithm MULTIFIT algorithm task-to-machine ratio |
