Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
Fixed priority scheduling is an important real-time scheduling scheme widely used in practice. To improve the schedulability of fixed priority scheduling considerable effort has been made such as introduction of preemption threshold or deferred preemption, and quantum-based scheduling. In this paper, we develop a new scheduling scheme by introducing both preemption threshold and quantum into one scheduling framework. The new scheduling method may successfully schedule tasks which are not schedulable either by preemption threshold scheduling or quantum-based scheduling, as well as tasks schedulable by either scheduling, thus improves the schedulability of fixed-priority tasks. We analyze the schedulability of the new scheduler by computing the worst case response time of tasks. Based on the analysis, we developed an algorithm for assignment of preemption threshold and quantum sizes.