linux-kernel - Re: [PATCH] Fix fake numa on ppc

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 for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date:	Wed, 02 Sep 2009 18:51:39 +1000
From:	Benjamin Herrenschmidt <benh@...nel.crashing.org>
To:	David Rientjes <rientjes@...gle.com>
Cc:	Ankita Garg <ankita@...ibm.com>,
	Balbir Singh <balbir@...ux.vnet.ibm.com>,
	linuxppc-dev@...abs.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH] Fix fake numa on ppc

On Tue, 2009-09-01 at 23:03 -0700, David Rientjes wrote:
> On Wed, 2 Sep 2009, Benjamin Herrenschmidt wrote:
> 
> > Since I'm pretty sure there could be CPU less nodes just like there
> > could be memory-less nodes, it would be good if fake numa could
> > simulate them too :-)
> > 
> 
> You don't want to simulate cpu less nodes since they do have affinity to 
> ranges of memory, you want to map each fake node to a cpumask including 
> all cpus with affinity to its memory, map each cpu to one fake node (with 
> memory) that it has physical affinity to, and then give all fake nodes 
> local NUMA distance to those on the same physical node.  Memoryless nodes 
> take care of themselves since they rely purely on node_distance(), so the 
> index into the slit for all fake nodes to those without memory will be the 
> same.

Ok, makes sense, thanks.

Cheers,
Ben.


--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/