Library prosa.analysis.definitions.request_bound_function
Request Bound Function (RBF)
Consider any type of tasks ...
... and any type of jobs associated with these tasks, where each task has
a cost.
... and an FP policy that indicates a higher-or-equal priority
relation.
Let MaxArrivals denote any function that takes a task and an interval length
and returns the associated number of job arrivals of the task.
RBF of a Single Task
Consider any task tsk that is to be scheduled in an interval of length delta.
We define the following workload bound for the task.
Consider a task set ts...
...and let tsk be any task in task set.
Let delta be the length of the interval of interest.
Recall the definition of higher-or-equal-priority task and the per-task
workload bound for FP scheduling.
Let is_hep_task tsk_other := hep_task tsk_other tsk.
Let is_other_hep_task tsk_other := hep_task tsk_other tsk && (tsk_other != tsk).
Let is_other_hep_task tsk_other := hep_task tsk_other tsk && (tsk_other != tsk).
Using the sum of individual workload bounds, we define the following
bound for the total workload of tasks in any interval of length
delta.
Similarly, 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 delta.
Definition total_hep_request_bound_function_FP :=
\sum_(tsk_other <- ts | is_hep_task tsk_other)
task_request_bound_function tsk_other delta.
\sum_(tsk_other <- ts | is_hep_task tsk_other)
task_request_bound_function tsk_other delta.
We also define a bound for the total workload of higher-or-equal
priority tasks other than tsk in any interval of length delta.