Library prosa.analysis.abstract.restricted_supply.busy_sbf
Require Export prosa.util.all.
Require Export prosa.analysis.definitions.sbf.pred.
Require Export prosa.analysis.abstract.definitions.
Require Export prosa.analysis.definitions.sbf.pred.
Require Export prosa.analysis.abstract.definitions.
SBF within Abstract Busy Interval
Consider any type of jobs, ...
... any kind of processor state model, ...
... any arrival sequence, ...
... and any schedule.
Assume we are provided with abstract functions for Interference
and Interfering Workload.
We say that the SBF is respected in an (abstract) busy interval
if, for any busy interval
[t1, t2)
and a subinterval [t1,
t) ⊆ t1, t2)>>, at least [SBF (t - t1)] cumulative supply is
provided.
Definition sbf_respected_in_busy_interval (SBF : duration → work) :=
pred_sbf_respected arr_seq sched (busy_interval_prefix sched) SBF.
pred_sbf_respected arr_seq sched (busy_interval_prefix sched) SBF.
Next, we define an SBF that is valid within an (abstract) busy interval.
Definition valid_busy_sbf (SBF : duration → work) :=
valid_pred_sbf arr_seq sched (busy_interval_prefix sched) SBF.
End BusySupplyBoundFunctions.
valid_pred_sbf arr_seq sched (busy_interval_prefix sched) SBF.
End BusySupplyBoundFunctions.