The Art of Making CPUs Angry
A technical deep-dive reveals that summing numbers can be done slower than random access by exploiting memory pitfalls. By striding data access by 8 pages, the author achieved a 2.06B cycle count, effectively neutralizing hardware prefetchers and forcing the MMU to perform a page walk on every single access.