Scheduling Configuration on Posix 1003.1b Systems - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2007

Scheduling Configuration on Posix 1003.1b Systems

(1) , (1)
1
Mathieu Grenier
  • Function : Author
  • PersonId : 830598
Nicolas Navet
  • Function : Author
  • PersonId : 830599

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.}
Fichier principal
Vignette du fichier
RR-6209.pdf (472.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00152312 , version 1 (06-06-2007)
inria-00152312 , version 2 (07-06-2007)

Identifiers

  • HAL Id : inria-00152312 , version 2

Cite

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

Share

Gmail Facebook Twitter LinkedIn More