summaryrefslogtreecommitdiffstats
path: root/Documentation/scheduler/sched-deadline.txt
diff options
context:
space:
mode:
authorZhiqiang Zhang <zhangzhiqiang.zhang@huawei.com>2015-05-18 15:00:24 +0200
committerIngo Molnar <mingo@kernel.org>2015-05-19 08:39:19 +0200
commit3aed357ee499c71f589a2537af6ec7785029873f (patch)
tree30dd810c93833c7b5820f688c9f5367ac5454d30 /Documentation/scheduler/sched-deadline.txt
parentsched/numa: Reduce conflict between fbq_classify_rq() and migration (diff)
downloadlinux-3aed357ee499c71f589a2537af6ec7785029873f.tar.xz
linux-3aed357ee499c71f589a2537af6ec7785029873f.zip
sched/dl/Documentation: Correct the definition of density as C_i/min{D_i,P_i}
C_i/min{D_i,T_i}, where T_i is not referred before, should be substituted with C_i/min{D_i,P_i}. Signed-off-by: Zhiqiang Zhang <zhangzhiqiang.zhang@huawei.com> Signed-off-by: Peter Zijlstra (Intel) <peterz@infradead.org> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: henrik@austad.us Cc: juri.lelli@gmail.com Cc: raistlin@linux.it Link: http://lkml.kernel.org/r/1431954032-16473-2-git-send-email-luca.abeni@unitn.it Signed-off-by: Ingo Molnar <mingo@kernel.org>
Diffstat (limited to 'Documentation/scheduler/sched-deadline.txt')
-rw-r--r--Documentation/scheduler/sched-deadline.txt4
1 files changed, 2 insertions, 2 deletions
diff --git a/Documentation/scheduler/sched-deadline.txt b/Documentation/scheduler/sched-deadline.txt
index 21461a0441c1..194664bb8bbf 100644
--- a/Documentation/scheduler/sched-deadline.txt
+++ b/Documentation/scheduler/sched-deadline.txt
@@ -169,8 +169,8 @@ CONTENTS
of all the tasks executing on a CPU if and only if the total utilisation
of the tasks running on such a CPU is smaller or equal than 1.
If D_i != P_i for some task, then it is possible to define the density of
- a task as C_i/min{D_i,T_i}, and EDF is able to respect all the deadlines
- of all the tasks running on a CPU if the sum sum_i C_i/min{D_i,T_i} of the
+ a task as C_i/min{D_i,P_i}, and EDF is able to respect all the deadlines
+ of all the tasks running on a CPU if the sum sum_i C_i/min{D_i,P_i} of the
densities of the tasks running on such a CPU is smaller or equal than 1
(notice that this condition is only sufficient, and not necessary).