Hello, Fawzi Mohamed, le Wed 30 Sep 2009 09:16:36 +0200, a écrit : > 1) a fully hierarchical representation of the machine/hardware where each > level > is a partition, and each level fully covers the previous one (from any node > you > go through all levels using father/childrens, father/child are just one level > away from each other. > This is basically what is there now. > > 2) outside the hierarchy 1 (but built using its object, probably the NUMA > nodes) there will be > 2.1) maybe the full connection graph > 2.2) a hierarchical view of it, like the lgroups, where the levels are not > necessarily a partition, and that could also refer not to the sublevel, but > directly to lower levels. Going up the hierarchy you get the next neighbors.
Err, no, in our plans 2.2 was in 1) already, and levels are thus still partitions, but somehow arbitrary ones, according to heuristics based on the graph. Isn't that the case with lgroups ? (I haven't ever had access to a solaris numa machine) Samuel
