linux-kernel - [PATCH 0/1] sched/fair: Update min

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]

Message-Id: <20231116105425.84773-1-s921975628@gmail.com>
Date:   Thu, 16 Nov 2023 18:54:24 +0800
From:   Yiwei Lin <s921975628@...il.com>
To:     mingo@...hat.com, peterz@...radead.org
Cc:     vincent.guittot@...aro.org, dietmar.eggemann@....com,
        wuyun.abel@...edance.com, linux-kernel@...r.kernel.org,
        s921975628@...il.com
Subject: [PATCH 0/1] sched/fair: Update min_vruntime in more relaxed way

Because we only use min_vruntime as an offset to avoid
overflow, and we will always update_curr() before making
change to csf_rq. Unlike the requirement on CFS, I
think it is possible to just update_min_vruntime() when
update_curr(), which reduces the cost to evaluate the statistic.

It is worth metioning that maybe we can update_min_vruntime() in
a more relaxed form according to this fact, but we may need more
works to optimize in the future.

The following link shows some discussion which relates to this patch:
https://lore.kernel.org/lkml/20231107090510.71322-1-wuyun.abel@bytedance.com/T/#mc277f045367f4186b34c83e636907ce2f5eb481e

Yiwei Lin (1):
  sched/fair: Update min_vruntime in more relaxed way

 kernel/sched/fair.c | 20 +-------------------
 1 file changed, 1 insertion(+), 19 deletions(-)

-- 
2.34.1