Lines Matching full:scheduler

4 CFS Scheduler
11 CFS stands for "Completely Fair Scheduler," and is the "desktop" process
12 scheduler implemented by Ingo Molnar and merged in Linux 2.6.23. When
14 scheduler's SCHED_OTHER interactivity code. Nowadays, CFS is making room
16 Documentation/scheduler/sched-eevdf.rst.
63 previous vanilla scheduler and RSDL/SD are affected).
83 schedules (or a scheduler tick happens) the task's CPU usage is "accounted
97 other HZ detail.  Thus the CFS scheduler has no notion of "timeslices" in the
98 way the previous scheduler had, and has no heuristics whatsoever.  There is
103 which can be used to tune the scheduler from "desktop" (i.e., low latencies) to
105 for desktop workloads.  SCHED_BATCH is handled by the CFS scheduler module too.
110 Due to its design, the CFS scheduler is not prone to any of the "attacks" that
111 exist today against the heuristics of the stock scheduler: fiftyp.c, thud.c,
115 The CFS scheduler has a much stronger handling of nice levels and SCHED_BATCH
116 than the previous vanilla scheduler: both types of workloads are isolated much
140     idle timer scheduler in order to avoid to get into priority
154 The new CFS scheduler has been designed in such a way to introduce "Scheduling
155 Classes," an extensible hierarchy of scheduler modules.  These modules
156 encapsulate scheduling policy details and are handled by the scheduler core
159 sched/fair.c implements the CFS scheduler described above.
162 the previous vanilla scheduler did.  It uses 100 runqueues (for all 100 RT
163 priority levels, instead of 140 in the previous scheduler) and it needs no
212 7.  GROUP SCHEDULER EXTENSIONS TO CFS
215 Normally, the scheduler operates on individual tasks and strives to provide