AND

ABSTR.~kCT. 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 ser-vice. It is shown that an optimum fixed priority scheduler possesses an upper bound to proces-sor utihzation which may be as low as 70 percent for large task sets. I t is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadhnes. A combination of these two scheduling techmques i also discussed