lockfree-queue: Michael and Scott lock-free queues.
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
.
Modules
[Index]
Downloads
- lockfree-queue-0.2.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.2, 0.2.0.1, 0.2.0.2, 0.2.3, 0.2.3.1, 0.2.4 |
---|---|
Dependencies | abstract-deque (>=0.3), atomic-primops (>=0.6), base (>=4.4.0.0 && <5), bytestring, ghc-prim [details] |
License | BSD-3-Clause |
Author | Ryan R. Newton |
Maintainer | rrnewton@gmail.com |
Category | Data, Concurrent |
Home page | https://github.com/rrnewton/haskell-lockfree/wiki |
Bug tracker | https://github.com/rrnewton/haskell-lockfree/issues |
Source repo | head: git clone git://github.com/rrnewton/haskell-lockfree.git |
Uploaded | by RyanNewton at 2014-02-05T03:34:49Z |
Distributions | LTSHaskell:0.2.4, NixOS:0.2.4, Stackage:0.2.4 |
Reverse Dependencies | 3 direct, 53 indirect [details] |
Downloads | 9423 total (58 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Successful builds reported [all 1 reports] |