On means to provide flexibility in scheduling
J. W. S. Liu, Kuo-Yi Lin · 1988
It is well-known that scheduling tasks to meet deadlines in hard real-time systems is difficult. Algorithms (such as the rate-monotone algorithm [1,2]) that guarantee deadlines are met for wide ranges of task execution times and system load typically do not achieve high processor utilization. On the other hand, algorithms (such as the earliest-deadline-first algorithm [1-4]) that achieve optimal processor utilization may not degrade gracefully in the presence of transient overload.