[This problem was presented by Peter Zijlstra during his ECRTS'17 keynote talk, see slide 9]
An alternative admission test for G-EDF (proposed by Tommaso Cucinotta).
Instead of the regular: U = \Sum u_t <= m, use:
U_i = \Sum (u_t / w_t) <= 1
t \elem all tasks runnable on i
where w_t is the (hemming) weight of t's CPU affinity bitmask.
The term 'recoverable' is coined to mean it avoids the ever escalating missing of deadlines (does it?) and if so, is that then a sufficient guarantee to claim bounded tardiness?
1 post • Page 1 of 1