Autors:

CiteWeb id: 19730000006

CiteWeb score: 11059

DOI: 10.1145/321738.321743

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.

The publication "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment" is placed in the Top 1000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 100. Additionally, the publicaiton "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment" is placed in the Top 100 among other scientific works published in 1973.
Links to full text of the publication: