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.

Versions [RSS] [faq] 0.2,,, 0.2.3,
Dependencies abstract-deque (>=0.3), atomic-primops (>=0.6), base (>= && <5), bytestring, ghc-prim [details]
License BSD-3-Clause
Author Ryan R. Newton
Maintainer rrnewton@gmail.com
Category Data, Concurrent
Home page https://github.com/rrnewton/haskell-lockfree/wiki
Bug tracker https://github.com/rrnewton/haskell-lockfree/issues
Source repo head: git clone git://github.com/rrnewton/haskell-lockfree.git
Uploaded by RyanNewton at 2015-02-06T22:03:22Z
Distributions LTSHaskell:, NixOS:, Stackage:
Downloads 6472 total (92 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-02-12 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees