Optimal Scheduling Strategies for Real-Time Computers

Ulrich Herzog · IBM Journal of Research and Development · 1975

In order to fulfill response time constraints in real-time systems, demands are often handled by means of sophisticated scheduling strategies. This paper first shows how to describe and analyze arbitrary combinations of preemptive and non-preemptive (head-of-the-line) priority strategies and, second, presents an algorithm that yields the optimal priority strategy, taking into consideration constraints on the response time.

Read the paper · More papers on PaperTik