CBDM Admission Example
Deadline Monotonic Assumption - C(i) <= D(i) <= T(i)
Audsley et al. Sufficient Schedulability Test based on C.I.
1) Check for CPU time to meet all requests given compute time C
for all i: 1<=i<=n: [C(i) / D(i)] + [I(i) / D(i)] <= 1.0
2) Interference by higher priority (earlier deadline threads)
I(i) = for j=1, i-1: Sum{ceiling[D(i) / T(j)] C(j)}
Scenario for Thread Scheduling with Deadline Monotonic Policy ...
C(1)=40, Dsoft(1)=50, Dhard(1)=70, T(1)=250, therefore priority=1
C(2)=200, Dsoft(2)=400, Dhard(2)=500, T(2)=500, therefore priority=2
Example Execution Time Confidence Intervals for Normal Dist. Assumption ...
i=1, C(1)=40, Sigma=10, N=32, SoftConf=0.999, HardConf=0.9998, Zpsoft=3.29, Zphard=3.72, (note: Actual HardConf > 0.9998)
i=2, C(2)=200, Sigma=50, N=32, SoftConf=0.95, HardConf=0.999, Zpsoft=1.96, Zphard=3.29, (note: Actual HardConf > 0.999)