[<prev] [next>] [day] [month] [year] [list]
Message-Id: <20230614160939.156850-1-flo@geekplace.eu>
Date: Wed, 14 Jun 2023 18:09:39 +0200
From: Florian Schmaus <flo@...kplace.eu>
To: Jonathan Corbet <corbet@....net>
Cc: linux-doc@...r.kernel.org, linux-kernel@...r.kernel.org,
Florian Schmaus <flo@...kplace.eu>
Subject: [PATCH] docs/scheduler: fix typos in sched-bwc
Fix two typos in Documentation/scheduler/sched-bwc.rst.
Signed-off-by: Florian Schmaus <flo@...kplace.eu>
---
Documentation/scheduler/sched-bwc.rst | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/Documentation/scheduler/sched-bwc.rst b/Documentation/scheduler/sched-bwc.rst
index f166b182ff95..90a6e11d4465 100644
--- a/Documentation/scheduler/sched-bwc.rst
+++ b/Documentation/scheduler/sched-bwc.rst
@@ -31,7 +31,7 @@ Traditional (UP-EDF) bandwidth control is something like:
(U = \Sum u_i) <= 1
-This guaranteeds both that every deadline is met and that the system is
+This guarantees both that every deadline is met and that the system is
stable. After all, if U were > 1, then for every second of walltime,
we'd have to run more than a second of program time, and obviously miss
our deadline, but the next deadline will be further out still, there is
@@ -59,7 +59,7 @@ At the same time, we can say that the worst case deadline miss, will be
\Sum e_i; that is, there is a bounded tardiness (under the assumption
that x+e is indeed WCET).
-The interferenece when using burst is valued by the possibilities for
+The interference when using burst is valued by the possibilities for
missing the deadline and the average WCET. Test results showed that when
there many cgroups or CPU is under utilized, the interference is
limited. More details are shown in:
--
2.39.3
Powered by blists - more mailing lists