The lockfree-queue package

[ Tags: 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 0.2,,, 0.2.3,
Dependencies abstract-deque (>=0.3), atomic-primops (>=0.6), base (>= && <5), bytestring, ghc-prim [details]
License BSD3
Author Ryan R. Newton
Category Data, Concurrent
Home page
Bug tracker
Source repo head: git clone git://
Uploaded Fri Feb 6 22:03:22 UTC 2015 by RyanNewton
Distributions LTSHaskell:, NixOS:, Stackage:, openSUSE:
Downloads 1947 total (41 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-02-12 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees