Sciweavers

Share
RTCSA
2008
IEEE

Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints

9 years 3 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non-preemptive scheduling in the case of hard real-time systems where missing deadline leads to catastrophic situations. This paper presents a necessary and sufficient schedulability condition for determining whether a task will satisfy its period and precedences constraints when some tasks have already been scheduled. Tasks we are dealing with are non-preemptive and the periods considered here are strict.
Omar Kermia, Yves Sorel
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where RTCSA
Authors Omar Kermia, Yves Sorel
Comments (0)
books