File tree Expand file tree Collapse file tree 1 file changed +10
-3
lines changed Expand file tree Collapse file tree 1 file changed +10
-3
lines changed Original file line number Diff line number Diff line change @@ -204,10 +204,17 @@ CONTENTS
204
204
It does so by decrementing the runtime of the executing task Ti at a pace equal
205
205
to
206
206
207
- dq = -max{ Ui, (1 - Uinact) } dt
207
+ dq = -max{ Ui / Umax , (1 - Uinact - Uextra ) } dt
208
208
209
- where Uinact is the inactive utilization, computed as (this_bq - running_bw),
210
- and Ui is the bandwidth of task Ti.
209
+ where:
210
+
211
+ - Ui is the bandwidth of task Ti;
212
+ - Umax is the maximum reclaimable utilization (subjected to RT throttling
213
+ limits);
214
+ - Uinact is the (per runqueue) inactive utilization, computed as
215
+ (this_bq - running_bw);
216
+ - Uextra is the (per runqueue) extra reclaimable utilization
217
+ (subjected to RT throttling limits).
211
218
212
219
213
220
Let's now see a trivial example of two deadline tasks with runtime equal
You can’t perform that action at this time.
0 commit comments