diff options
author | Li Bin <huawei.libin@huawei.com> | 2013-09-09 02:05:40 -0400 |
---|---|---|
committer | Ingo Molnar <mingo@kernel.org> | 2013-09-12 13:14:17 -0400 |
commit | 3b524d60943a2f9ee1194323ff9d5ee01a4d1ce1 (patch) | |
tree | 542dd1c5f0ec27c572060aee449903d57cb9d5e9 /Documentation | |
parent | fc840914e9b07ab4685c195e1e54e58de4f84c03 (diff) |
sched/Documentation: Update sched-design-CFS.txt documentation
2bd2d6f2dc ("sched: Replace use of entity_key()") had remove the
entity_key() which function is to subtract a tasks vruntime by
its groups minvruntime as the rbtree key.
The phrase "there is a subtraction using rq->cfs.min_vruntime
to account for possible wraparounds" in documentation feels strange
and meaningless. So remove it.
Signed-off-by: Li Bin <huawei.libin@huawei.com>
Signed-off-by: Peter Zijlstra <peterz@infradead.org>
Link: http://lkml.kernel.org/r/1378706740-7500-1-git-send-email-huawei.libin@huawei.com
Signed-off-by: Ingo Molnar <mingo@kernel.org>
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 | |||
66 | runqueue. | 66 | runqueue. |
67 | 67 | ||
68 | CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the | 68 | CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the |
69 | p->se.vruntime key (there is a subtraction using rq->cfs.min_vruntime to | 69 | p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it. |
70 | account for possible wraparounds). CFS picks the "leftmost" task from this | ||
71 | tree and sticks to it. | ||
72 | As the system progresses forwards, the executed tasks are put into the tree | 70 | As the system progresses forwards, the executed tasks are put into the tree |
73 | more and more to the right --- slowly but surely giving a chance for every task | 71 | more and more to the right --- slowly but surely giving a chance for every task |
74 | to become the "leftmost task" and thus get on the CPU within a deterministic | 72 | to become the "leftmost task" and thus get on the CPU within a deterministic |