Skip to Main content Skip to Navigation
Theses

Contributions à la validation d'ordonnancement temps réel en présence de transactions sous priorités fixes et EDF

Abstract : The validation process is an important step in the development of a real-time application. It consists in proving that, whatever happens, the scheduling policy guarantees that all the temporal constraints are met. In this thesis we study the schedulability test of tasks with offsets, on uniprocessor system, with fixed and dynamic priority assignments. The exact tests has an exponential complexity and only a sufficient (pessimistic) feasibility test with a pseudo-polynomial complexity has been proposed. Note that all existing tests are based on the response time analysis (RTA) technique. In the fixed priority context, we propose a new pseudo-polynomial RTA method, less pessimistic than the existing methods. We present some properties (accumulatively monotonic transactions, dominated tasks) that make exact the approximate methods, for certain cases, and optimize the run time computation. In the dynamic priority context, we provide a pseudo-polynomial exact schedulability test, based on the processor demand analysis. We provide experimental evaluations of the proposed tests and their optimization.
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00368101
Contributor : Ahmed Rahni Connect in order to contact the contributor
Submitted on : Friday, March 13, 2009 - 3:41:24 PM
Last modification on : Wednesday, October 20, 2021 - 3:22:09 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:38:40 PM

Identifiers

  • HAL Id : tel-00368101, version 1

Collections

Citation

Ahmed Rahni. Contributions à la validation d'ordonnancement temps réel en présence de transactions sous priorités fixes et EDF. Réseaux et télécommunications [cs.NI]. Université de Poitiers, 2008. Français. ⟨tel-00368101⟩

Share

Metrics

Record views

268

Files downloads

1069