Tag
A 2019 blog post argues that preemption (interrupts) can be used as a pre-paid barrier for memory ordering in lock-free programming, similar to how garbage collection is a sunk cost, and demonstrates implementations for event counts and asymmetric flag flips on Linux/x86.