Hierarchical scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This plays a crucial role in all industrial areas where high-performance microprocessors allow growing integration of multiple applications on a single platfor...

Scheduling theory as it applies to hard real-time environments with precedence and strict periodicity constraints — environments where the failure to satisfy any constraint may have disastrous consequences [1], [2] — seems currently to be enjoying a renaissance. The most widely studied problems in this field concern periodic non-preemptive tasks for systems where data are collected throught cap...

Fixed Priority Scheduling with Deferred Preemption (FPDS) offers a balance between Fixed Priority Non-preemptive Scheduling (FPNS) and Fixed Priority Preemptive Scheduling (FPPS), by allowing preemptions only at specified preemption points. It provides finer grained preemptions than FPNS, improving the schedulability of higher priority tasks, and a coarser grain preemptions than FPPS, reducing ...