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 [faq]||0.2, 0.2.0.1, 0.2.0.2, 0.2.3, 0.2.3.1|
|Dependencies||abstract-deque, atomic-primops, base (>=184.108.40.206 && <5), bytestring, ghc-prim, IORefCAS (>=0.2) [details]|
|Author||Ryan R. Newton|
|Source repo||head: git clone git://github.com/rrnewton/haskell-lockfree-queue.git|
|Uploaded||by RyanNewton at Tue May 7 20:39:50 UTC 2013|
|Distributions||LTSHaskell:0.2.3.1, NixOS:0.2.3.1, Stackage:0.2.3.1|
|Downloads||3529 total (187 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees