Blocking Bound for EDF

In this section, we define a bound on the length of a non-preemptive segment of a lower-priority job (w.r.t. a task tsk) under EDF scheduling.

Consider any type of tasks ...

For clarity, let's denote the relative deadline of a task as D.

Consider an arbitrary task set ts.

Let max_arrivals be a family of arrival curves.

Only other tasks that potentially release non-zero-cost jobs are relevant, so we define a predicate to exclude pathological cases.

For a job of a given task tsk, the relative arrival offset A within its busy window, we define the following blocking bound. This bound assumes that task are independent (i.e., it does not account for possible blocking due to locking protocols).