lockfree-queue: Michael and Scott lock-free queues.

[ bsd3, concurrent, data, library ] [ Propose Tags ]

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


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.2,,, 0.2.3,, 0.2.4
Dependencies abstract-deque, atomic-primops, base (>= && <5), bytestring, ghc-prim, IORefCAS (>=0.2) [details]
License BSD-3-Clause
Author Ryan R. Newton
Maintainer rrnewton@gmail.com
Category Data, Concurrent
Home page https://github.com/rrnewton/haskell-lockfree-queue/wiki
Source repo head: git clone git://github.com/rrnewton/haskell-lockfree-queue.git
Uploaded by RyanNewton at 2013-05-07T20:39:50Z
Distributions LTSHaskell:0.2.4, NixOS:0.2.4, Stackage:0.2.4
Reverse Dependencies 3 direct, 49 indirect [details]
Downloads 8446 total (71 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]