Algorithm Research for Non-Preemptive Scheduling on Multiprocessor

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Shengyi Li, Yingchun Liu, Rongbo Zhu, Hongguang Li, Wensi Ding

Pages:

1770-1774

DOI:

10.4028/www.scientific.net/AMM.34-35.1770

Citation:

T. W. Liu et al., "Algorithm Research for Non-Preemptive Scheduling on Multiprocessor", Applied Mechanics and Materials, Vols. 34-35, pp. 1770-1774, 2010

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.