Characterizing G-EDF scheduling tardiness with uniform instances on multiprocessors
Giovanni Buzzega, Gianluca Nocetti, Manuela Montangero · 2023
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 has been spent in literature to provide efficiently computable tardiness bounds for periodic task systems scheduled on multiprocessors, but still, no exact bound is known and the best-known approximation takes non-polynomial time to compute.