[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <168717269226.404.4412261506840976360.tip-bot2@tip-bot2>
Date: Mon, 19 Jun 2023 11:04:52 -0000
From: "tip-bot2 for Vineeth Pillai" <tip-bot2@...utronix.de>
To: linux-tip-commits@...r.kernel.org
Cc: "Vineeth Pillai (Google)" <vineeth@...byteword.org>,
"Peter Zijlstra (Intel)" <peterz@...radead.org>,
Daniel Bristot de Oliveira <bristot@...nel.org>,
Juri Lelli <juri.lelli@...hat.com>, x86@...nel.org,
linux-kernel@...r.kernel.org
Subject: [tip: sched/core] sched/deadline: Update GRUB description in the
documentation
The following commit has been merged into the sched/core branch of tip:
Commit-ID: e20f204c88d595c04fc9197794bb68c0fbabd902
Gitweb: https://git.kernel.org/tip/e20f204c88d595c04fc9197794bb68c0fbabd902
Author: Vineeth Pillai <vineeth@...byteword.org>
AuthorDate: Tue, 30 May 2023 09:55:26 -04:00
Committer: Peter Zijlstra <peterz@...radead.org>
CommitterDate: Fri, 16 Jun 2023 22:08:12 +02:00
sched/deadline: Update GRUB description in the documentation
Update the details of GRUB to reflect the updated logic.
Signed-off-by: Vineeth Pillai (Google) <vineeth@...byteword.org>
Signed-off-by: Peter Zijlstra (Intel) <peterz@...radead.org>
Reviewed-by: Daniel Bristot de Oliveira <bristot@...nel.org>
Acked-by: Juri Lelli <juri.lelli@...hat.com>
Link: https://lore.kernel.org/r/20230530135526.2385378-2-vineeth@bitbyteword.org
---
Documentation/scheduler/sched-deadline.rst | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
diff --git a/Documentation/scheduler/sched-deadline.rst b/Documentation/scheduler/sched-deadline.rst
index 9d9be52..9fe4846 100644
--- a/Documentation/scheduler/sched-deadline.rst
+++ b/Documentation/scheduler/sched-deadline.rst
@@ -203,12 +203,15 @@ Deadline Task Scheduling
- Total bandwidth (this_bw): this is the sum of all tasks "belonging" to the
runqueue, including the tasks in Inactive state.
+ - Maximum usable bandwidth (max_bw): This is the maximum bandwidth usable by
+ deadline tasks and is currently set to the RT capacity.
+
The algorithm reclaims the bandwidth of the tasks in Inactive state.
It does so by decrementing the runtime of the executing task Ti at a pace equal
to
- dq = -max{ Ui / Umax, (1 - Uinact - Uextra) } dt
+ dq = -(max{ Ui, (Umax - Uinact - Uextra) } / Umax) dt
where:
Powered by blists - more mailing lists