Lines Matching refs:then

52  consistent with the guarantee (using the CBS[2,3] algorithm). Tasks are then
83     then, if the scheduling deadline is smaller than the current time, or
155  to the number of CPUs), then the scheduler is unable to respect all the
161  Moreover, if the total utilization is larger than M, then we risk starving
163  If, instead, the total utilization is smaller than M, then non real-time
182  If D_i = P_i for all tasks, then EDF is able to respect all the deadlines
185  If D_i != P_i for some task, then it is possible to define the density of
207  smaller than the size of the interval) for all the possible values of t, then
262  the total utilization is smaller or equal than M then the response times of
276  are respected, then SCHED_DEADLINE can be used to schedule real-time tasks
284  IOW, if runtime >= WCET and if period is <= P, then the scheduling deadlines
341  This is usually called "admission control" and if it is not performed, then
366  sched_setattr()). Scheduling is then performed considering actual tasks'
422  Section 5), then this simple setting of the bandwidth management is able to