Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks

Authors:
Moonju Park
Affiliations:
Ubiquitous Computing Lab., IBM Korea, Seoul, Korea
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Year:
2007

Citing 4
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
An Improved Rate-Monotonic Admission Control and Its Applications

IEEE Transactions on Computers
Rate Monotonic Schedulability Conditions Using Relative Period Ratios

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Transition-aware real-time task scheduling for reconfigurable embedded systems

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of scheduling periodic tasks on a uniprocessor using static priority assignment without preemption. The problem of non-preemptive fixed priority scheduling has received little attention until recently, while real-life applications are often based on non-preemptive systems especially in case of embedded systems. In this paper, we show that Rate Monotonic priority assignment is optimal for non-preemptive scheduling when each task's relative deadline is equal to its period. We have derived a schedulability bound for non-preemptive Rate Monotonic scheduling by using period ratio of the tasks to provide a guarantee that tasks will meet their deadlines. Since the obtained bound is relatively small comparing with the preemptive scheduling, we also propose a method for designing high-utilization non-preemptive system to enhance the utilization bound.