[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <1272db25-454e-48ff-9acf-6f31ab183273@amd.com>
Date: Mon, 17 Feb 2025 09:37:15 +0530
From: K Prateek Nayak <kprateek.nayak@....com>
To: Tianchen Ding <dtcccc@...ux.alibaba.com>
CC: Peter Zijlstra <peterz@...radead.org>, Ingo Molnar <mingo@...hat.com>,
Juri Lelli <juri.lelli@...hat.com>, Vincent Guittot
<vincent.guittot@...aro.org>, Dietmar Eggemann <dietmar.eggemann@....com>,
Steven Rostedt <rostedt@...dmis.org>, Ben Segall <bsegall@...gle.com>, Mel
Gorman <mgorman@...e.de>, Valentin Schneider <vschneid@...hat.com>,
<linux-kernel@...r.kernel.org>
Subject: Re: [PATCH v3] sched/eevdf: Force propagating min_slice of cfs_rq
when {en,de}queue tasks
Hello Tianchen,
On 2/17/2025 8:23 AM, Tianchen Ding wrote:
>
> Since the patch has been accepted, I'm not sure whether I should send a
> next version. The current version does introduce an extra function call
> when se->slice == slice, but the loop will run only once and exit because
> RBCOMPUTE() will return true. So maybe the cost is insignificant?
Yup the cost is likely insignificant! I have no strong feelings and since
this has landed, I don't think there is a need to micro optimize this.
--
Thanks and Regards,
Prateek
Powered by blists - more mailing lists