3 ms·
See also: Intel's guide to looping over smaller chunks of 2D arrays for better cache utilization: https://www.intel.com/content/www/us/en/developer/articles/te
by andai 5y ago
See also: Intel's guide to looping over smaller chunks of 2D arrays for better cache utilization:
https://www.intel.com/content/www/us/en/developer/articles/technical/how-to-use-loop-blocking-to-optimize-memory-use-on-32-bit-intel-architecture.html https://www.intel.com/content/www/us/en/developer/articles/t...
- EdSchouten 5y agoYeah, those images explain it pretty well. There is one slight difference, though. Because the Hilbert/Z-order curves are defined recursively, algorithms for converting between the curve and row/column order are "cache-oblivious", in that they don't need to take an explicit block size. You write it once, and it performs well on any system regardless the CPU cache size and/or page size.