Lines Matching refs:of
13 80% of CFS's design can be summed up in a single sentence: CFS basically models
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
25 is its actual runtime normalized to the total number of running tasks.
37 would ever get "out of balance" from the "ideal" share of CPU time. ]
45 Most of the rest of CFS's design just falls out of this really simple concept,
54 runqueues, but it uses a time-ordered rbtree to build a "timeline" of future
60 runqueue. The total amount of work done by the system is tracked using
62 side of the tree as much as possible.
64 The total number of running tasks in the runqueue is accounted through the
65 rq->cfs.load value, which is the sum of the weights of the tasks queued on the
73 amount of time.
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
89 other HZ detail. Thus the CFS scheduler has no notion of "timeslices" in the
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
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
124 caches but at the cost of interactivity. This is well suited for
134 The command chrt from util-linux-ng 2.13.1.1 can set all of these except
142 Classes," an extensible hierarchy of scheduler modules. These modules
150 priority levels, instead of 140 in the previous scheduler) and it needs no
157 This is the (partial) list of the hooks:
168 corresponding scheduling entity out of the red-black tree. It decrements
175 entity at the right-most end of the red-black tree.
217 create arbitrary groups of tasks, using the "cgroup" pseudo filesystem. See
229 # mkdir multimedia # create "multimedia" group of tasks
230 # mkdir browser # create "browser" group of tasks
233 # #that of browser group