Library prosa.analysis.definitions.request_bound_function

Request Bound Function (RBF)

We define the notion of a task's request-bound function (RBF), as well as the total request bound function of a set of tasks.
Consider any type of task characterized by a WCET bound and an arrival curve.
  Context {Task : TaskType}.
  Context `{TaskCost Task} `{MaxArrivals Task}.

RBF of a Single Task

We define the classic notion of an RBF, which for a given task tsk and interval length Δ, bounds the maximum cumulative processor demand of all jobs released by tsk in any interval of length Δ.

Total RBF of Multiple Tasks

Next, we extend the notion of an RBF to multiple tasks in the obvious way.
Consider a set of tasks ts.
  Variable ts : seq Task.

The joint total RBF of all tasks in ts is simply the sum of each task's RBF.
For convenience, we additionally introduce specialized notions of total RBF for use under FP scheduling that consider only certain tasks. relation.
  Context `{FP_policy Task}.

We define the following bound for the total workload of tasks of higher-or-equal priority (with respect to tsk) in any interval of length Δ.
We also define a bound for the total workload of higher-or-equal-priority tasks other than tsk in any interval of length Δ.
We also define a bound for the total workload of higher-or-equal-priority tasks other than tsk in any interval of length Δ.
Finally, we define a bound for the total workload of higher-priority tasks in any interval of length Δ.