Computer Scientists’ Trivia

Re:Computer Scientists’ Trivia by yorwba on Thursday February 02, 2017 @04:14AM (#13549174)

> The costly operation in the example is accessing a large 2D array along the non-dense axis. For big enough arrays, that's a cache miss every time.

I half-remember hearing about memory-prefetchers smart enough to detect this kind of strided access and fill the cache accordingly.

[ Parent | on HN ]

Re:Computer Scientists’ Trivia by mnw21cam on Thursday February 02, 2017 @06:55AM (#13549873)

Then it turns from a cache miss problem to a memory bandwidth problem. If you are only using a small proportion of the cache line in your calculation, then you effectively multiply the data transferred to the CPU.

[ Parent | on HN ]