The lockfree-queue package

[Tags: bsd3, library]

Michael and Scott queues are described in their PODC 1996 paper:

http://dl.acm.org/citation.cfm?id=248052.248106

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.

Properties

Versions0.2, 0.2.0.1, 0.2.0.2, 0.2.3, 0.2.3.1
Change logNone available
Dependenciesabstract-deque (>=0.3), atomic-primops (>=0.6), base (>=4.4.0.0 && <5), bytestring, ghc-prim [details]
LicenseBSD3
AuthorRyan R. Newton
Maintainerrrnewton@gmail.com
CategoryData, Concurrent
Home pagehttps://github.com/rrnewton/haskell-lockfree/wiki
Bug trackerhttps://github.com/rrnewton/haskell-lockfree/issues
Source repositoryhead: git clone git://github.com/rrnewton/haskell-lockfree.git
UploadedFri Feb 6 22:03:22 UTC 2015 by RyanNewton
DistributionsNixOS:0.2.3.1
Downloads877 total (42 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Last success reported on 2015-02-12 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees