A Quick Algorithm for Independent Tasks Scheduling on Identical Parallel Processors
一种独立任务的同型机调度快速算法

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.