linux-kernel - [PATCH v2] sched/deadline: fix runtime accounting in documentation

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [thread-next>] [day] [month] [year] [list]

Date:   Tue, 14 Nov 2017 12:19:26 +0100
From:   Claudio Scordino <claudio@...dence.eu.com>
To:     linux-kernel@...r.kernel.org
Cc:     Claudio Scordino <claudio@...dence.eu.com>,
        Luca Abeni <luca.abeni@...tannapisa.it>,
        Jonathan Corbet <corbet@....net>,
        "Peter Zijlstra (Intel)" <peterz@...radead.org>,
        Ingo Molnar <mingo@...hat.com>, linux-doc@...r.kernel.org,
        Tommaso Cucinotta <tommaso.cucinotta@...up.it>,
        Mathieu Poirier <mathieu.poirier@...aro.org>
Subject: [PATCH v2] sched/deadline: fix runtime accounting in documentation

Signed-off-by: Claudio Scordino <claudio@...dence.eu.com>
Signed-off-by: Luca Abeni <luca.abeni@...tannapisa.it>
Acked-by: Daniel Bristot de Oliveira <bristot@...hat.com>
CC: Jonathan Corbet <corbet@....net>
CC: "Peter Zijlstra (Intel)" <peterz@...radead.org>
CC: Ingo Molnar <mingo@...hat.com>
CC: linux-doc@...r.kernel.org
Cc: Tommaso Cucinotta <tommaso.cucinotta@...up.it>
Cc: Mathieu Poirier <mathieu.poirier@...aro.org>
---
 Documentation/scheduler/sched-deadline.txt | 13 ++++++++++---
 1 file changed, 10 insertions(+), 3 deletions(-)

diff --git a/Documentation/scheduler/sched-deadline.txt b/Documentation/scheduler/sched-deadline.txt
index e89e36e..8ce78f8 100644
--- a/Documentation/scheduler/sched-deadline.txt
+++ b/Documentation/scheduler/sched-deadline.txt
@@ -204,10 +204,17 @@ CONTENTS
  It does so by decrementing the runtime of the executing task Ti at a pace equal
  to
 
-           dq = -max{ Ui, (1 - Uinact) } dt
+           dq = -max{ Ui / Umax, (1 - Uinact - Uextra) } dt
 
- where Uinact is the inactive utilization, computed as (this_bq - running_bw),
- and Ui is the bandwidth of task Ti.
+ where:
+
+  - Ui is the bandwidth of task Ti;
+  - Umax is the maximum reclaimable utilization (subjected to RT throttling
+    limits);
+  - Uinact is the (per runqueue) inactive utilization, computed as
+    (this_bq - running_bw);
+  - Uextra is the (per runqueue) extra reclaimable utilization
+    (subjected to RT throttling limits).
 
 
  Let's now see a trivial example of two deadline tasks with runtime equal
-- 
2.7.4