Articles by tag: cache-optimization

Arrays and cache: O(1) access optimization

We analyze why sequential access to arrays is 7–10 times faster than random. Benchmarks of strides, matrices, AoS/SoA. Acceleration up to 10× for middle/senior dev.

ART Prefix Trees: Memory and Cache Optimization

Learn how to optimize prefix trees from 825 MB to 18 MB. ART benchmarks, radix trees and comparison with hash tables for autocomplete. Real code and metrics.