linux-kernel - Re: [RFC PATCH] mm: migrate: Add new node demotion strategy

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-prev] [thread-next>] [day] [month] [year] [list]

Date:   Fri, 5 Nov 2021 08:47:23 -0700
From:   Dave Hansen <dave.hansen@...el.com>
To:     "Huang, Ying" <ying.huang@...el.com>,
        Baolin Wang <baolin.wang@...ux.alibaba.com>
Cc:     akpm@...ux-foundation.org, dave.hansen@...ux.intel.com,
        ziy@...dia.com, osalvador@...e.de, shy828301@...il.com,
        linux-mm@...ck.org, linux-kernel@...r.kernel.org
Subject: Re: [RFC PATCH] mm: migrate: Add new node demotion strategy

On 11/4/21 7:51 PM, Huang, Ying wrote:
>> Let's also try to do it with the existing node_demotion[] data
>> structure before we go adding more.
> To avoid cache ping-pong, I guess some kind of per-CPU data structure
> may be more suitable for interleaving among multiple nodes.

It would probably be better to just find something that's more
read-heavy.  Like, instead of keeping a strict round-robin, just
randomly select one of the notes to which you can round-robin.

That will scale naturally without having to worry about caching or fancy
per-cpu data structures.