What? I mean, there are specific sizes that will fit in the L-(N) cache. And consequently, sizes that don't suffer from the false-sharing problem in concurren

What? I mean, there are specific sizes that will fit in the L-(N) cache. And consequently, sizes that don't suffer from the false-sharing problem in concurrent scenarios due to this. https://en.cppreference.com/w/cpp/thread/hardware_destructive_interference_size https://en.cppreference.com/w/cpp/thread/hardware_destructiv... There's an entire field of study devoted to cache-friendly/cache-oblivious data structures: - https://www.microsoft.com/en-us/research/wp-content/uploads/2016/12/ccds.pdf https://www.microsoft.com/en-us/research/wp-content/uploads/... - https://rcoh.me/posts/cache-oblivious-datastructures/ https://rcoh.me/posts/cache-oblivious-datastructures/