Hi Paul, Currently RCU tree distributes CPUs to leafs based on consequent CPU IDs. That means CPUs from remote caches and even nodes might end up in the same leaf.
I did not research the impact, but at the glance that seems at least sub-optimal; especially in case of remote nodes, when CPUs access each others' memory? I am thinking of topology-aware RCU geometry where the RCU tree reflects the actual system topology. I.e by borrowing it from schedulling domains or soemthing like that. Do you think it worth the effort to research this question or I am missing something and the current access patterns are just optimal? Thanks! -- Regards, Alexander Gordeev agord...@redhat.com -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
