lockfree-queue: Michael and Scott lock-free queues.
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
|Versions [RSS] [faq]||0.2, 0.2.0.1, 0.2.0.2, 0.2.3, 0.2.3.1|
|Dependencies||abstract-deque (>=0.3), atomic-primops (>=0.6), base (>=22.214.171.124 && <5), bytestring, ghc-prim [details]|
|Author||Ryan R. Newton|
|Source repo||head: git clone git://github.com/rrnewton/haskell-lockfree.git|
|Uploaded||by RyanNewton at 2015-02-06T22:03:22Z|
|Distributions||LTSHaskell:0.2.3.1, NixOS:0.2.3.1, Stackage:0.2.3.1|
|Downloads||6472 total (92 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2015-02-12 [all 1 reports]