Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems

Mathieu Grenier 1 Joël Goossens 2 Nicolas Navet 1
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we study the problem of the fixed priority scheduling of hard real-time tasks. We consider independent tasks, which are characterized by a period, a hard deadline, a computation time, and an offset (the time of the first request) where the latter can be chosen by the scheduling algorithm. Considering only the synchronous case is very pessimistic for offset free systems, since the synchronous case is the worst case. An heuristic has been proposed in the past to choose the offsets. In this paper, we propose a new technique, based on the Audsley's priority assignment, to reduce significantly the search space. In addition, we propose new offset assignment heuristics and show the improvement of combining the new technique and the new heuristics.
Type de document :
Communication dans un congrès
14th International Conference on Real-Time and Networks Systems (RTNS'06), May 2006, Poitiers/France, pp.35--42, 2006
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00083863
Contributeur : Mathieu Grenier <>
Soumis le : mardi 4 juillet 2006 - 15:19:25
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05
Document(s) archivé(s) le : lundi 5 avril 2010 - 23:46:36

Identifiants

  • HAL Id : inria-00083863, version 1

Collections

Citation

Mathieu Grenier, Joël Goossens, Nicolas Navet. Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems. 14th International Conference on Real-Time and Networks Systems (RTNS'06), May 2006, Poitiers/France, pp.35--42, 2006. 〈inria-00083863〉

Partager

Métriques

Consultations de la notice

324

Téléchargements de fichiers

185