Scheduling non-preemptive hard real-time tasks with strict periods

Mohamed Marouf 1, 2 Yves Sorel 2
2 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 : Non-preemptive real-time scheduling and the corresponding schedulability analyses have received considerable less attention in the research community, compared to preemptive real-time scheduling. However, non-preemptive scheduling is widely used in industry, especially in the case of hard real-time systems where missing deadlines leads to catastrophic situations and where resources must not be wasted. In many industries such as avionics tasks may have strict periods, i.e. the start times of their executions must be separated by a fixed period. Indeed, this strict periodicity is generally required by sensors and actuators which may have accurate periods. In this paper we consider separately the case where tasks have harmonic periods and the case where tasks have non-harmonic periods. Thus, the general case becomes a combination of both cases. In the harmonic case we give schedulability conditions to verify that a set of tasks is schedulable. In the non-harmonic case, in order to prove that a set of tasks is schedulable we propose local schedulability conditions that we apply iteratively to each task of the set in order to verify that this current task, added to a sub-set of tasks already scheduled, leads to a schedulable set of tasks.
Type de document :
Communication dans un congrès
ETFA'11 - 16th IEEE International Conference on Emerging Technologies and Factory Automation, Sep 2011, Toulouse, France. IEEE, pp.1-8, 2011, 〈10.1109/ETFA.2011.6059014〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00737916
Contributeur : Mohamed Marouf <>
Soumis le : mercredi 3 octobre 2012 - 16:36:11
Dernière modification le : vendredi 12 octobre 2012 - 08:52:29
Document(s) archivé(s) le : vendredi 4 janvier 2013 - 03:56:34

Fichier

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

Identifiants

Collections

Citation

Mohamed Marouf, Yves Sorel. Scheduling non-preemptive hard real-time tasks with strict periods. ETFA'11 - 16th IEEE International Conference on Emerging Technologies and Factory Automation, Sep 2011, Toulouse, France. IEEE, pp.1-8, 2011, 〈10.1109/ETFA.2011.6059014〉. 〈hal-00737916〉

Partager

Métriques

Consultations de
la notice

417

Téléchargements du document

179