Algorithm Research for Non-Preemptive Scheduling on Multiprocessor

Abstract

Research for algorithm of non-preemptive scheduling on multiprocessor is of great theoretical significance and practical significance. Based on non-preemptive scheduling, the performance of the algorithm is analyzed and investigated on two different objective functions about the turnaround time of the system and the low-cost problem with a limitation of time. Finally, the relevant conclusion is obtained which is the basis of the further research. It gives a guarantee to the algorithm performance which is designed for the practical application.