In this post we explore how to speed up our memory intensive programs by decreasing the number of TLB cache misses

In this post we explore how to speed up our memory intensive programs by decreasing the number of TLB cache misses
We investigate how to make faster hash maps, trees, linked lists and vector of pointers by changing their data layout.