Lines Matching refs:scheduler

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