diff options
| author | Linus Torvalds <torvalds@linux-foundation.org> | 2013-09-18 11:23:32 -0500 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2013-09-18 11:23:32 -0500 |
| commit | 7e28b2712e5ebd8d73d25561585bc2ae77da5c30 (patch) | |
| tree | 34e54c0c411f5fa8dae537a0f9773d19f5c57351 /Documentation | |
| parent | 186844b292140d1e33225ec95039b6adb03d3fec (diff) | |
| parent | 13b62e46d5407c7d619aea1dc9c3e0991b631b57 (diff) | |
| download | talos-obmc-linux-7e28b2712e5ebd8d73d25561585bc2ae77da5c30.tar.gz talos-obmc-linux-7e28b2712e5ebd8d73d25561585bc2ae77da5c30.zip | |
Merge branch 'sched-urgent-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip
Pull scheduler fixes from Ingo Molnar:
"Misc fixes"
* 'sched-urgent-for-linus' of git://git.kernel.org/pub/scm/linux/kernel/git/tip/tip:
sched: Fix comment for sched_info_depart
sched/Documentation: Update sched-design-CFS.txt documentation
sched/debug: Take PID namespace into account
sched/fair: Fix small race where child->se.parent,cfs_rq might point to invalid ones
Diffstat (limited to 'Documentation')
| -rw-r--r-- | Documentation/scheduler/sched-design-CFS.txt | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/Documentation/scheduler/sched-design-CFS.txt b/Documentation/scheduler/sched-design-CFS.txt index d529e02d928d..f14f49304222 100644 --- a/Documentation/scheduler/sched-design-CFS.txt +++ b/Documentation/scheduler/sched-design-CFS.txt @@ -66,9 +66,7 @@ rq->cfs.load value, which is the sum of the weights of the tasks queued on the runqueue. CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the -p->se.vruntime key (there is a subtraction using rq->cfs.min_vruntime to -account for possible wraparounds). CFS picks the "leftmost" task from this -tree and sticks to it. +p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it. As the system progresses forwards, the executed tasks are put into the tree more and more to the right --- slowly but surely giving a chance for every task to become the "leftmost task" and thus get on the CPU within a deterministic |
