The lockfree-queue package

[Tags: bsd3, library]

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.


Versions0.2,,, 0.2.3,
Change logNone available
Dependenciesabstract-deque (>=0.3), atomic-primops (>=0.6), base (>= && <5), bytestring, ghc-prim
AuthorRyan R. Newton
CategoryData, Concurrent
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedFri Feb 6 22:03:22 UTC 2015 by RyanNewton
Downloads805 total (47 in last 30 days)
StatusDocs available [build log]
Last success reported on 2015-02-12 [all 1 reports]




Maintainers' corner

For package maintainers and hackage trustees