Lines Matching refs:and

8 CFS stands for "Completely Fair Scheduler," and is the new "desktop" process
9 scheduler implemented by Ingo Molnar and merged in Linux 2.6.23.  It is the
17 power and which can run each task at precise equal speed, in parallel, each at
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
46 with a few add-on embellishments like nice levels, multiprocessing and various
55 task execution, and thus has no "array switch" artifacts (by which both the
56 previous vanilla scheduler and RSDL/SD are affected).
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
81 do not over-schedule tasks and trash the cache), then the new leftmost task is
82 picked and the current task is preempted.
88 CFS uses nanosecond granularity accounting and does not rely on any jiffies or
90 way the previous scheduler had, and has no heuristics whatsoever.  There is
101 chew.c, ring-test.c, massive_intr.c all work fine and do not impact
102 interactivity and produce the expected behavior.
104 The CFS scheduler has a much stronger handling of nice levels and SCHED_BATCH
109 assumptions are gone from the load-balancing code now, and iterators of the
123     would, thereby allowing tasks to run longer and make better use of
131 SCHED_FIFO/_RR are implemented in sched/rt.c and are as specified by
143 encapsulate scheduling policy details and are handled by the scheduler core
148 sched/rt.c implements SCHED_FIFO and SCHED_RR semantics, in a simpler way than
150 priority levels, instead of 140 in the previous scheduler) and it needs no
162    It puts the scheduling entity (task) into the red-black tree and
201 Normally, the scheduler operates on individual tasks and strives to provide
202 fair CPU time to each task.  Sometimes, it may be desirable to group tasks and
204 desirable to first provide fair CPU time to each user on the system and then to
208 grouped and divides CPU time fairly among such groups.
210 CONFIG_RT_GROUP_SCHED permits to group real-time (i.e., SCHED_FIFO and
213 CONFIG_FAIR_GROUP_SCHED permits to group CFS (i.e., SCHED_NORMAL and
216    These options need CONFIG_CGROUPS to be defined, and let the administrator
222 task groups and modify their CPU share using the "cgroups" pseudo filesystem.
238 	# firefox &	# Launch firefox and move it to "browser" group