HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Real-Time Scheduling: Non-Preemption, Critical Sections and Round Robin

Abstract : The main property of a (hard) real-time system is feasibility. It is the guarantee that tasks do always meet their deadlines, when the system is running under a given scheduling policy. An optimal policy produces a feasible schedule whenever a feasible schedule exists. It is therefore the most appropriate choice if feasibility is the only matter of concern. However, if a set of tasks is feasible under several policies, it is possible to impose additional constraints, which improve in a certain way the quality of a system. A refined choice is only possible if feasibility tests or, more broadly, timing analysis is available for other policies than the optimal ones. In this document we derive timing analysis for policies obtained by combining known policies in hierarchical layers. These layered priorities are motivated by the Posix 1003.1c standard, which allows such a combination of Fixed Preemptive Priorities and the Round Robin scheduling policy. In this context we extend the trajectory based model developed in [8] for systems scheduled under real-time constraints to account for non-preemptive resources and the associated priority ceiling protocol. Furthermore, timing analysis of the Round Robin policy is derived.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:32:15 AM
Last modification on : Friday, February 4, 2022 - 3:15:42 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:30:41 PM


  • HAL Id : inria-00072994, version 1



Jörn Martin Migge, Alain Jean-Marie. Real-Time Scheduling: Non-Preemption, Critical Sections and Round Robin. RR-3678, INRIA. 1999. ⟨inria-00072994⟩



Record views


Files downloads