EDF priority tie-breaks by lateness.

Instead of tie-breaking by PID (which is a static
priority tie-break), we can tie-break by lateness
of a prior job. That is, if two jobs, J_{1,i} and
J_{2,j} of tasks T_1 and T_2, respectively, have
equal deadlines, we favor the job of the task that
had the worst lateness for jobs J_{1,i-1} and
J_{2,j-1}. In case of lateness ties, we fall back
to PID comparisons. This later case will likely
only kick in for initial jobs, when lateness of
"prior" jobs is assumed to be 0.

Note: Unlike tardiness, lateness may be less than
zero. This occurs when a job finishes before its
deadline.

0 files changed, 0 insertions, 0 deletions