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
2 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints

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].

Domaines: Systèmes embarqués; Recherche opérationnelle [math.OC]

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⟩