Tag
atomic-operations
- 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 24, 2026 Atomic Reference Counts and the Cycle They Cannot Collect The instruction cost of shared ownership, why the count must be atomic, and the reachability problem that makes a pure reference-counting collector leak. systems programming
- Oct 8, 2025 Critical Sections, Futexes, and What a Mutex Really Costs The path a mutex takes from uncontended atomic to sleeping thread, how Linux futexes avoid a syscall in the common case, and why uncontended cost predictions fail under contention. performance engineering