Schedulability Analysis using Exact Number of Preemptions and No Idle Time for Real-Time Systems with Precedence and Strict Periodicity Constraints

Patrick Meumeu Yomsi 1 Yves Sorel 1
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Classical approaches based on preemption, such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedulability conditions in the case of a single processor, but assume the cost of the preemption to be negligible compared to the duration of each task. Clearly the global cost is difcult to determine accurately because, if the cost of one preemption is known for a given processor, it is not the same for the exact number of preemptions of each task. Because we are interested in hard real-time systems with precedence and strict periodicity constraints where it is mandatory to satisfy these constraints, we give a scheduling algorithm which counts the exact number of preemptions for each task, and thus leads to a new schedulability condition. This is currently done in the particular case where the periods of all the tasks constitute an harmonic sequence.
Type de document :
Communication dans un congrès
Proceedings of 15th International Conference on Real-Time and Network Systems, RTNS'07, 2007, Nancy, France. 2007
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00413489
Contributeur : Patrick Meumeu Yomsi <>
Soumis le : vendredi 4 septembre 2009 - 11:54:48
Dernière modification le : jeudi 11 janvier 2018 - 16:13:45
Document(s) archivé(s) le : mardi 15 juin 2010 - 23:13:03

Fichier

rtns07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00413489, version 1

Collections

Citation

Patrick Meumeu Yomsi, Yves Sorel. Schedulability Analysis using Exact Number of Preemptions and No Idle Time for Real-Time Systems with Precedence and Strict Periodicity Constraints. Proceedings of 15th International Conference on Real-Time and Network Systems, RTNS'07, 2007, Nancy, France. 2007. 〈inria-00413489〉

Partager

Métriques

Consultations de la notice

298

Téléchargements de fichiers

113