lockfree-queue

Michael and Scott lock-free queues. https://github.com/rrnewton/haskell-lockfree/wiki

Latest on Hackage:0.2.3.1

See all snapshots lockfree-queue appears in

BSD-3-Clause licensed by Ryan R. Newton
Maintained by [email protected]

Module documentation for 0.2.3.1

This version can be pinned in stack with:[email protected]:2a01c98b479fff93e1fb1631c53164e719579ac6389aa3227acefd80d15d8b53,2964

Michael and Scott queues are described in their PODC 1996 paper:

http://dl.acm.org/citation.cfm?id=248052.248106

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 ConcurrentLinkedQueue.