Skip to Main content Skip to Navigation
Conference papers

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, Laboratoire I3S - 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].
Document type :
Conference papers
Complete list of metadatas
https://hal.inria.fr/inria-00432976
Contributor : Liliana Cucu-Grosjean <>
Submitted on : Tuesday, November 17, 2009 - 5:11:49 PM
Last modification on : Monday, October 12, 2020 - 10:30:12 AM

Identifiers

  • HAL Id : inria-00432976, version 1

Collections

UNICE | CNRS | 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. ⟨inria-00432976⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

447

 

Contact                    Legal Notice                    Personal Data