4 posts with tag optimization
Architectural Decomposition: Remove Contention by Design
The opening post of a Low-Level Systems Design in Rust series, arguing that the biggest performance win is structural: replace a shared multi-producer cursor that serializes cores through cache-coherence traffic with one private single-writer SPSC ring per producer, converting quadratic writer contention into a cheap O(N) consumer sweep.
Scalar Replacement of Aggregates: How "Copy to Locals" Unlocks the Compiler
How copying a small aggregate into local variables exposes Scalar Replacement of Aggregates to LLVM, letting hot loops keep state in registers instead of repeatedly loading and storing through a pointer—illustrated with Zig/Rust reproductions and TigerBeetle's AEGIS-128L speedup.
Why x86 Zeroes a Register With `xor eax, eax`
A practical reference on why x86 zeroes a register with xor reg, reg - breaking down the size and dependency advantages over mov, CPU zeroing idiom recognition, and the subtle flags tradeoff, with real code examples and tradeoffs
Set-Associative Caches: Trading Global Optimality for Predictable Speed
How set-associative caches trade global eviction freedom for bounded, cache-line-friendly lookups, and how TigerBeetle's CacheMap and a SIMD search optimization (PR #3200) put that trade-off to work.