Re:An Introduction to Cache-Oblivious Data Structures
by rusbus on Tuesday February 06, 2018 @03:38PM
(#16319365)
OP here. It is admittedly a little hairy. The place to start is https://github.com/rcoh/treelayout/blob/8adb9bb9727bdaee671d...
The rough idea is that we layout the top chunk, then the bottom chunks, and then wire them together
I'm not sure if I really understood how the cache-oblivious solution works though in this case, I can't get an intuition for how the code linked in the github relates to the description in the article.