Mechanical sympathy: cache, branches, and false sharing

Mechanical sympathy: cache, branches, false sharing

Three hardware ideas that decide whether your low-latency code is fast or pretending to be: how the cache hierarchy works, why branch prediction can change runtime by 5×, and how false sharing makes lock-free code slower than mutexes.

May 3, 2026 · 8 min · HFT Engineer's Roadmap
Generational ZGC

Generational ZGC, end to end

A walk through Generational ZGC: coloured pointers, load and store barriers, the generational split landed in JDK 21, and how it hits sub-millisecond pauses on multi-TB heaps.

April 25, 2026 · 27 min · HFT Engineer's Roadmap