[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <Zqlxw-mm3-wJHvQY@slm.duckdns.org>
Date: Tue, 30 Jul 2024 13:05:39 -1000
From: Tejun Heo <tj@...nel.org>
To: Xavier <xavier_qy@....com>
Cc: longman@...hat.com, mkoutny@...e.com, akpm@...ux-foundation.org,
lizefan.x@...edance.com, hannes@...xchg.org,
cgroups@...r.kernel.org, linux-kernel@...r.kernel.org,
torvalds@...ux-foundation.org
Subject: Re: [PATCH-cpuset v11 2/2] cpuset: use Union-Find to optimize the
merging of cpumasks
On Thu, Jul 04, 2024 at 02:24:44PM +0800, Xavier wrote:
> The process of constructing scheduling domains
> involves multiple loops and repeated evaluations, leading to numerous
> redundant and ineffective assessments that impact code efficiency.
>
> Here, we use union-find to optimize the merging of cpumasks. By employing
> path compression and union by rank, we effectively reduce the number of
> lookups and merge comparisons.
>
> Signed-off-by: Xavier <xavier_qy@....com>
Applied to cgroup/for-6.12.
Thanks.
--
tejun
Powered by blists - more mailing lists