Michael and Scott lock-free queues.
|Version on this page:||0.2.3.1|
|LTS Haskell 20.24:||0.2.4|
|Stackage Nightly 2023-06-04:||0.2.4|
|Latest on Hackage:||0.2.4|
Maintained by email@example.com
This version can be pinned in stack with:
Module documentation for 0.2.3.1
Depends on 5 packages(full list with versions):
Used by 1 package in lts-15.3(full list with versions):
Michael and Scott queues are described in their PODC 1996 paper:
These are single-ended concurrent queues based on a singlly linked
list and using atomic CAS instructions to swap the tail pointers.
As a well-known efficient algorithm they became the basis for Java's