Data structurecore
Michael-Scott lock-free queue
Also called MS queue, Michael-Scott non-blocking queue, Michael-Scott queue.
Lock-free FIFO queue with a dummy node and separate head and tail pointers updated by CAS.
Lock-free FIFO queue with a dummy node and separate head and tail pointers updated by CAS.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag N8QFHV Edit this page History Report an error