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

Scheduling Configuration on Posix 1003.1b Systems

Mathieu Grenier 1 Nicolas Navet 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Posix 1003.1b compliant systems provide two well-specified scheduling policies, namely {\it sched\_rr} (Round-Robin like) and {\it sched\_fifo} (FPP like). Up to now, little has been done to take advantage of the combination of both policies to maximize schedulability. In this study, we propose two priority, policy and quantum assignment algorithms for Posix 1003.1b systems that are optimal with regards to the power of the feasibility test (i.e. its ability to distinguish feasible and non feasible configurations). Though much less complex than an exhaustive exploration, the exponential complexity of the algorithms limits their applicability to small or medium-size problems. This is why a heuristic is proposed to handle larger task sets. As shown in the experiments, our proposal allows achieving a significant gain in feasibility over FPP, and therefore using the computational resources at their fullest potential. In many cases where FPP does not lead to a feasible schedule, using both FPP and RR may provide an alternative to EDF, which, most often, is not implemented at the OS kernel level.}
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Thursday, June 7, 2007 - 9:48:11 AM
Last modification on : Friday, February 4, 2022 - 3:34:31 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 1:20:27 PM


Files produced by the author(s)


  • HAL Id : inria-00152312, version 2



Mathieu Grenier, Nicolas Navet. Scheduling Configuration on Posix 1003.1b Systems. [Research Report] RR-6209, INRIA. 2007, pp.26. ⟨inria-00152312v2⟩



Record views


Files downloads