Schedulability conditions for non-preemptive hard real-time tasks with strict period

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 : Partial answers have been provided in the real-time literature to the question whether preemptive systems are better than non-preemptive systems. This question has been investigated by many authors according to several points of view and it still remains open. Compared to preemptive real-time scheduling, non-preemptive real-time scheduling and the corresponding schedulability analyses have received considerable less attention in the research community. However, non-preemptive scheduling is widely used in industry, and it may be preferable to preemptive scheduling for numerous reasons. This approach is specially well suited in the case of hard real-time systems on the one hand where missing deadlines leads to catastrophic situations, and on the other hand where resources must not be wasted. In this paper, we firstly present the non-preemptive model of task with strict period, then we propose a schedulability condition for a set of such tasks, and finally we give a scheduling heuristic based on this condition.
Type de document :
Communication dans un congrès
M. Marouf and Y. Sorel. 18th International Conference on Real-Time and Network Systems RTNS'10, Nov 2010, Toulouse, France. 2010, Proceedings of 18th International Conference on Real-Time and Network Systems, RTNS'10
Liste complète des métadonnées

https://hal.inria.fr/inria-00566359
Contributeur : Mohamed Marouf <>
Soumis le : mercredi 16 février 2011 - 09:46:27
Dernière modification le : lundi 5 octobre 2015 - 16:59:04
Document(s) archivé(s) le : mardi 6 novembre 2012 - 14:01:40

Fichier

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

Identifiants

  • HAL Id : inria-00566359, version 1

Collections

Citation

Mohamed Marouf, Yves Sorel. Schedulability conditions for non-preemptive hard real-time tasks with strict period. M. Marouf and Y. Sorel. 18th International Conference on Real-Time and Network Systems RTNS'10, Nov 2010, Toulouse, France. 2010, Proceedings of 18th International Conference on Real-Time and Network Systems, RTNS'10. <inria-00566359>

Partager

Métriques

Consultations de
la notice

583

Téléchargements du document

198