Scheduling algorithms for multiprogramming in a hard-real-time environment
CL Liu, JW Layland - Journal of the ACM (JACM), 1973 - dl.acm.org
CL Liu, JW Layland
Journal of the ACM (JACM), 1973•dl.acm.orgThe 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.
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.
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.