lkml.org 
[lkml]   [2023]   [Nov]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    From
    Subject[PATCH 0/1] sched/fair: Update min_vruntime in more relaxed way
    Date
    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

    \
     
     \ /
      Last update: 2023-11-20 14:01    [W:6.126 / U:0.060 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site