Lines Matching refs:all

125  * satisfied :P) to be sure of fully understanding all technical details.
155  to the number of CPUs), then the scheduler is unable to respect all the
158  WCET_i/P_i over all the real-time tasks in the system. When considering
164  tasks will not be starved and the system might be able to respect all the
181  possible to formally check if all the deadlines are respected.
182  If D_i = P_i for all tasks, then EDF is able to respect all the deadlines
183  of all the tasks executing on a CPU if and only if the total utilization
186  a task as WCET_i/min{D_i,P_i}, and EDF is able to respect all the deadlines
187  of all the tasks running on a CPU if the sum of the densities of the tasks
203  computing the total amount of CPU time h(t) needed by all the tasks to
204  respect all of their deadlines in a time interval of size t, and comparing
207  smaller than the size of the interval) for all the possible values of t, then
208  EDF is able to schedule the tasks respecting all of their deadlines. Since
209  performing this check for all possible values of t is impossible, it has been
211  between 0 and a maximum value L. The cited papers contain all of the
230  period smaller than the one of the first task. Hence, if all the tasks
244  between total utilization (or density) and a fixed constant. If all tasks
277  guaranteeing that all the jobs' deadlines of a task are respected.
347  the sum of the ratio between runtime and period for all tasks is smaller
405   * a new struct sched_attr, containing all the necessary fields is