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,
Dependenciesabstract-deque, atomic-primops, base (>= && <5), bytestring, ghc-prim, IORefCAS (>=0.2)
AuthorRyan R. Newton
CategoryData, Concurrent
Home page
Source repositoryhead: git clone git://
UploadedTue May 7 20:39:50 UTC 2013 by RyanNewton
Downloads667 total (56 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees