Hacker News new | ask | show | jobs
by Robin_Message 5078 days ago
Ahem. It depends on the workload.

If you regularly search for the same stuff with binary search in a large array, at some size limit your set-associative caches will run out due to aliasing. At that point your data is then never in the cache, even though you could only be accessing 30 or 40 different words of memory.