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

International audienceIn 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]