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

[ bsd3, concurrent, data, library ] [ Propose Tags ]
Versions 0.2,,, 0.2.3,
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 Tue May 7 17:55:17 UTC 2013
Distributions LTSHaskell:, NixOS:, Stackage:, openSUSE:
Downloads 1976 total (29 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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

For package maintainers and hackage trustees