Re: [PATCH-cpuset v8 2/2] cpuset: use Union-Find to optimize the merging of cpumasks

[Tejun Heo]

On Sat, Jun 29, 2024 at 12:13:02AM +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@xxxxxxx>

Waiman, how do you like this conversion?

Thanks.

-- 
tejun