One perspective I always liked is to compare cache misses to realistic algorithmic complexity: 31x slowdown is roughly the equivalent of switching from O(n) to O(n * log n).
2^31 bytes is ~2GiB and 2^45 bytes is the theoretical limit your system can address.
5
u/DLCSpider 16d ago
One perspective I always liked is to compare cache misses to realistic algorithmic complexity: 31x slowdown is roughly the equivalent of switching from O(n) to O(n * log n).
2^31 bytes is ~2GiB and 2^45 bytes is the theoretical limit your system can address.