Count Binface, Nigel Farage's space-warrior foe
Summary
The post argues preemption is a sunk cost akin to garbage collection and explores using interrupts as barriers to enforce memory ordering in user-space lock-free code. It covers event counts, asymmetric flag flips, futex integration, x86-TSO and barrier patterns, and practical implementations like barrierd, hazard pointers, and epoch reclamation. The piece weighs tradeoffs between fast-path performance and reliable barriers, with diagrams illustrating interleavings under different memory models.