Skip to Main content Skip to Navigation

Optimisation de l'ordonnancement sous contrainte de faisabilité

Abstract : Our goal is to come up with feasible (i.e., all required time constraints are met) on-line real-time scheduling algorithms. These algorithms have to optimise 1) the utilisation of the execution platform (i.e., meet time constraints and use platform at its fullest potential) and/or 2) optimise the application dependent performance criteria. We study two cases : the case of independent periodic tasks scheduled on a processor and the case of periodic traffic streams scheduled on a priority bus. To deal with these two problems, we propose : Configuration methods to allow to optmlise the utilisation rate of the execution platform by setting the parameters of the policies or of the activities of the considered system. We perform two studies : the allocation of offsets in "Offset free" systems (I.E., offsets can be chosen off-line) and the priorities, policies and quantum allocations in systems compliant to the standard Posix 1003.1B, A new class of scheduling policies to allow optimising application performance dependent criteria
Complete list of metadatas
Contributor : Thèses Ul <>
Submitted on : Thursday, March 29, 2018 - 2:01:28 PM
Last modification on : Tuesday, April 24, 2018 - 1:30:09 PM


Files produced by the author(s)


  • HAL Id : tel-01752902, version 1



Mathieu Grenier. Optimisation de l'ordonnancement sous contrainte de faisabilité. Autre. Institut National Polytechnique de Lorraine, 2007. Français. ⟨NNT : 2007INPL076N⟩. ⟨tel-01752902⟩



Record views


Files downloads