diff options
| -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 |