Lines Matching refs:task

17 power and which can run each task at precise equal speed, in parallel, each at
21 On real hardware, we can run only a single task at once, so we have to
22 introduce the concept of "virtual runtime."  The virtual runtime of a task
24 multi-tasking CPU described above.  In practice, the virtual runtime of a task
31 In CFS the virtual runtime is expressed and tracked via the per-task
33 timestamp and measure the "expected CPU time" a task should have gotten.
36   p->se.vruntime value --- i.e., tasks would execute simultaneously and no task
39 CFS's task picking logic is based on this p->se.vruntime value and it is thus
40 very simple: it always tries to run the task with the smallest p->se.vruntime
41 value (i.e., the task which executed least so far).  CFS always tries to split
55 task execution, and thus has no "array switch" artifacts (by which both the
69 p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it.
71 more and more to the right --- slowly but surely giving a chance for every task
72 to become the "leftmost task" and thus get on the CPU within a deterministic
75 Summing up, CFS works like this: it runs a task a bit, and when the task
76 schedules (or a scheduler tick happens) the task's CPU usage is "accounted
78 p->se.vruntime.  Once p->se.vruntime gets high enough so that another task
79 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
80 small amount of "granularity" distance relative to the leftmost task so that we
81 do not over-schedule tasks and trash the cache), then the new leftmost task is
82 picked and the current task is preempted.
161    Called when a task enters a runnable state.
162    It puts the scheduling entity (task) into the red-black tree and
167    When a task is no longer runnable, this function is called to keep the
179    This function checks if a task that entered the runnable state should
180    preempt the currently running task.
184    This function chooses the most appropriate task eligible to run next.
188    This function is called when a task changes its scheduling class or changes
189    its task group.
202 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
203 provide fair CPU time to each such task group.  For example, it may be
205 each task belonging to a user.
222 task groups and modify their CPU share using the "cgroups" pseudo filesystem.