Academic
Publications
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,10.1145/321738.321743,Journal of The ACM,Chung Laung Liu,James W. Layland

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment   (Citations: 4867)
BibTex | RIS | RefWorks Download
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.
Journal: Journal of The ACM - JACM , vol. 20, no. 1, pp. 46-61, 1973
Cumulative Annual
Sort by: