Tag
cache-lines
- Oct 20, 2026 Sharded Counters, Padding, and False Sharing Why two independent counters placed next to each other can cost more than one shared counter, how cache-line granularity forces padding, and what sharding gives up in exchange. performance engineering
- Jul 9, 2026 Cache Behaviour and Node Layout in Disjoint-Set Arrays Why a find is a dependent-load chain, how index width and array splitting change the number of cache lines touched, and what key remapping costs before the first union. data structures
- Dec 11, 2025 Columnar Layout and the Cost of Reading One Field How storing each field in its own contiguous run changes the bytes a scan touches, why homogeneous columns compress better, and what the layout gives up on point reads and updates. data engineering
- Sep 18, 2025 Array of Structs or Struct of Arrays How element stride decides which fields a scan pulls into cache, when splitting a record into parallel columns pays, and what the split costs elsewhere. data structures
- Aug 13, 2025 Row-Major Layout and the Address Arithmetic Behind Indexing How a pair of subscripts becomes one byte offset, why the last subscript varies fastest, and what traversal order does to cache-line consumption. data structures
- Oct 28, 2024 Bytes Fetched per Field: Layout as a Bandwidth Decision Why array-of-structs and struct-of-arrays trade differently against cache line granularity, and how to compute the bytes moved per field actually read. performance engineering
- Dec 29, 2023 Sequential Scans, Hardware Prefetch, and the Page Walk What happens between a linear loop over an array and the memory it reads, why huge pages change the cost, and where a scan stops being sequential. data structures