I thought this was impressive, since it's basically single-stepping the code and disassembling each instruction on the fly to figure out the memory accesses it

I thought this was impressive, since it's basically single-stepping the code and disassembling each instruction on the fly to figure out the memory accesses it generates, in order to update a simulated cache and compute any misses. It then integrates with the IDE to give you mouse-over reporting of a single statement's cache hit performance. Also, the submission has been edited. I mentioned that the system is open source, http://github.com/insomniacgames/ig-cachesim http://github.com/insomniacgames/ig-cachesim is on the page I submitted, but is on page 105/105 of the slide PDF. Edit, disclosure: I once had the pleasure of working with deplinenoise, and tried to sponge up as much knowledge as possible. He's great.