Distributed SystemsPlanned
Lock-free Queue
Michael-Scott lock-free queue using atomic CAS operations
A multi-producer, multi-consumer lock-free queue based on the Michael-Scott algorithm, using Go's sync/atomic for compare-and-swap — demonstrating how to eliminate mutex contention on hot data paths.
What it demonstrates
- CAS operations
- ABA problem
- Memory ordering
- Lock-free algorithms
Tech stack
Go