Lines Matching refs:tasks

36  that makes it possible to isolate the behavior of tasks between each other.
43  "deadline", to schedule tasks. A SCHED_DEADLINE task should receive
55  Summing up, the CBS[2,3] algorithms assigns scheduling deadlines to tasks so
57  interference between different tasks (bandwidth isolation), while the EDF[1]
59  to be executed next. Thanks to this feature, tasks that do not strictly comply
64  tasks in the following way:
126  suited for periodic or sporadic real-time tasks that need guarantees on their
148  WCET_i/P_i over all the real-time tasks in the system. When considering
149  multiple real-time tasks, the parameters of the i-th task are indicated
152  non- real-time tasks by real-time tasks.
154  tasks will not be starved and the system might be able to respect all the
168  If D_i = P_i for all tasks, then EDF is able to respect all the deadlines
169  of all the tasks executing on a CPU if and only if the total utilisation
170  of the tasks running on such a CPU is smaller or equal than 1.
173  of all the tasks running on a CPU if the sum sum_i C_i/min{D_i,T_i} of the
174  densities of the tasks running on such a CPU is smaller or equal than 1
182  than M is enough to guarantee that non real-time tasks are not starved and
183  that the tardiness of real-time tasks has an upper bound.
185  SCHED_DEADLINE can be used to schedule real-time tasks guaranteeing that
216  of the available fractions of CPU time to the various tasks under control.
218  no guarantee can be given on the actual scheduling of the -deadline tasks.
221  correctly schedule a set of real-time tasks is that the total utilisation
222  is smaller than M. When talking about -deadline tasks, this requires that
223  the sum of the ratio between runtime and period for all tasks is smaller
228  to -deadline tasks is similar to the one already used for -rt
229  tasks with real-time group scheduling (a.k.a. RT-throttling - see
233  defined for -deadline tasks, because more discussion is needed in order to
238  is that -deadline tasks have bandwidth on their own (while -rt ones don't!),
242  sched_setattr()). Scheduling is then performed considering actual tasks'
243  parameters, so that CPU bandwidth is allocated to SCHED_DEADLINE tasks
245  interface we can put a cap on total utilization of -deadline tasks (i.e.,
257  run -rt tasks from a -deadline server; in which case the -rt bandwidth is a
260  This means that, for a root_domain comprising M CPUs, -deadline tasks
292  tasks can use at most 95%, multiplied by the number of CPUs that compose the
294  This means that non -deadline tasks will receive at least 5% of the CPU time,
295  and that -deadline tasks will receive their runtime with a guaranteed
299  deterministically guarantee that -deadline tasks will receive their runtime
308  -deadline tasks cannot have an affinity mask smaller that the entire
328  echo $$ > cpu0/tasks
338     of retaining bandwidth isolation among non-interacting tasks. This is