Documentation/scheduler/sched-design-CFS.rst

10 scheduler implemented by Ingo Molnar and merged in Linux 2.6.23.  It is the
11 replacement for the previous vanilla scheduler's SCHED_OTHER interactivity
59 previous vanilla scheduler and RSDL/SD are affected).
79 schedules (or a scheduler tick happens) the task's CPU usage is "accounted
93 other HZ detail.  Thus the CFS scheduler has no notion of "timeslices" in the
94 way the previous scheduler had, and has no heuristics whatsoever.  There is
99 which can be used to tune the scheduler from "desktop" (i.e., low latencies) to
101 for desktop workloads.  SCHED_BATCH is handled by the CFS scheduler module too.
103 Due to its design, the CFS scheduler is not prone to any of the "attacks" that
104 exist today against the heuristics of the stock scheduler: fiftyp.c, thud.c,
108 The CFS scheduler has a much stronger handling of nice levels and SCHED_BATCH
109 than the previous vanilla scheduler: both types of workloads are isolated much
133     idle timer scheduler in order to avoid to get into priority
147 The new CFS scheduler has been designed in such a way to introduce "Scheduling
148 Classes," an extensible hierarchy of scheduler modules.  These modules
149 encapsulate scheduling policy details and are handled by the scheduler core
152 sched/fair.c implements the CFS scheduler described above.
155 the previous vanilla scheduler did.  It uses 100 runqueues (for all 100 RT
156 priority levels, instead of 140 in the previous scheduler) and it needs no
208 Normally, the scheduler operates on individual tasks and strives to provide