Lines Matching refs:M

154  If the total utilization U=sum(WCET_i/P_i) is larger than M (with M equal
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
171 	((M − 1) · WCET_max − WCET_min)/(M − (M − 2) · U_max) + WCET_max
179  If M=1 (uniprocessor system), or in case of partitioned scheduling (each
226  Consider a set {Task_1,...Task_{M+1}} of M+1 tasks on a system with M
228  and WCET equal to P. The remaining M tasks Task_i=(e,P-1,P-1) have an
231  activate at the same time t, global EDF schedules these M tasks first
236  task set is U = M · e / (P - 1) + P / P = M · e / (P - 1) + 1, and for small
247 	sum(WCET_i / P_i) <= M - (M - 1) · U_max
249  M - (M - 1) · U_max becomes M - M + 1 = 1 and this schedulability condition
254  As seen, enforcing that the total utilization is smaller than M does not
257  a total utilization smaller than M is enough to guarantee that non real-time
262  the total utilization is smaller or equal than M then the response times of
300   4 - J. Y. Leung and M.L. Merril. A Note on Preemptive Scheduling of
346  is smaller than M. When talking about -deadline tasks, this requires that
348  than M. Notice that the ratio runtime/period is equivalent to the utilization
384  This means that, for a root_domain comprising M CPUs, -deadline tasks
387    M * (sched_rt_runtime_us / sched_rt_period_us)