An exact schedulability test for real-time dependant periodic task systems with latency constraints

Liliana Cucu-Grosjean 1 Yves Sorel 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 : In this paper we provide a schedulability test for dependant periodic task systems scheduled using non-preemptive policies. We consider the case of one processor and the schedulability test is based on the periodicity of a feasible schedule. A feasible schedule is periodic if it repeats from a time instant s with a period p. In the case of one processor, this property allows a real-time designer to check the deadlines only for instances of tasks within the time interval [s, s + p].
Type de document :
Communication dans un congrès
Models and Algorithms for Planning and Scheduling Problems - MAPSP'09, Jun 2009, Abbey Rolduc, Netherlands. 2009
Liste complète des métadonnées
https://hal.inria.fr/inria-00432976
Contributeur : Liliana Cucu <>
Soumis le : mardi 17 novembre 2009 - 17:11:49
Dernière modification le : mardi 17 avril 2018 - 11:30:33

Identifiants

  • HAL Id : inria-00432976, version 1

Collections

UNICE | INRIA | I3S | LORIA | UNIV-LORRAINE | UNIV-COTEDAZUR

Citation

Liliana Cucu-Grosjean, Yves Sorel. An exact schedulability test for real-time dependant periodic task systems with latency constraints. Models and Algorithms for Planning and Scheduling Problems - MAPSP'09, Jun 2009, Abbey Rolduc, Netherlands. 2009. 〈inria-00432976〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

379

Contact


archive-ouverte@inria.fr