Dual Priority Scheduling

In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to crucial tasks by fixed priority scheduling. Further, it provides an efficient method of responsively scheduling soft tasks and a means of providing online guarantees for tasks with firm deadlines. An effective O (n ) acceptance test is derived in the paper. Supported by the analysis, acceptance tests and mechanisms described, the dual priority approach provides a basis for combining the benefits of guaranteeing hard requirements with the flexibility inherent in the besteffort paradigm.

• Type: Conference
• Year: 1995
• Where: RTSS
• Authors: Robert I. Davis, Andy J. Wellings
• Keywords: Acceptance Tests, Control Systems, Hard Real-time Systems, RTSS 1995, fixed Priority Scheduling