Parameter Optimization for EDF-Like Scheduling of Self-Suspending Tasks

Self-suspension introduces further complexity in the scheduling of real-time tasks. As a result, the proofs of optimality for the typical Earliest-Deadline-First (EDF) and Deadline-Monotonic (DM) scheduling do not hold. The EDF-Like scheduling algorithms allows to optimize the scheduling algorithm by setting relative priority points. In this work, we show that a tuning process of the relative priority points leads to significantly better (analytical) schedulability guarantees. Moreover, we discuss open problems and alternative approaches.