Michael and Scott lock-free queues. https://github.com/rrnewton/haskell-lockfree/wiki
|Latest on Hackage:||0.2.3.1|
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