The global earliest-deadline-first (GEDF) scheduler and its variants are soft-real-time (SRT)
optimal for periodic/sporadic tasks, meaning they provide bounded tardiness so long as the …

Soft real-time multiprocessor systems need scheduling policies introducing small overheads
and for which it is possible to give guarantees on tardiness (ie, the maximum delay that …

Though recent work has established the soft real-time (SRT)-optimality of Earliest-Deadline-
First (EDF) variants on multiprocessor models with limited heterogeneity (eg, uniform speeds …

Abstract The Linux Kernel offers several scheduling classes. From SCHED_DEADLINE
down to SCHED_FIFO, SCHED_RR and SCHED_OTHER, the scheduling classes can …

In this paper we present a parallel exact algorithm to compute an upper bound to tardiness
of preemptive global EDF (G-EDF) schedulers, named harmonic bound, which has been …

The notion of temporal correctness applicable to a hard real-time system is quite categorical:
such a system is deemed to be temporally correct if and only if no task ever misses a …

Different global and semi-partitioned schedulers have been proposed that are soft-real-time
(SRT) optimal for sporadic task systems, meaning they can guarantee bounded deadline …

Soft real-time multiprocessor systems frequently adopt the G-EDF (Global-Earliest Deadline
First) scheduling policy as it is lightweight and it guarantees bounded tardiness. Much effort …

Tightness is a crucial property of tardiness bounds; in fact, a too loose bound may cause a
feasible soft real-time application to be mistakenly deemed unfeasible. Recently, a new …

Though prior work has established the Soft Real-Time (SRT)-optimality of Earliest-Deadline-
First (EDF) variants on multiprocessors with identical and uniform speeds, these …