The lockfree-queue package
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
| Versions | 0.2, 0.2.0.1, 0.2.0.2 |
|---|---|
| Dependencies | abstract-deque, base (≥4.4.0.0 & <5), bytestring, ghc-prim, IORefCAS (≥0.2) |
| License | BSD3 |
| Author | Ryan R. Newton |
| Maintainer | rrnewton@gmail.com |
| Category | Data, Concurrent |
| Home page | https://github.com/rrnewton/haskell-lockfree-queue/wiki |
| Source repository | git clone git://github.com/rrnewton/haskell-lockfree-queue.git |
| Upload date | Mon Oct 1 14:51:38 UTC 2012 |
| Uploaded by | RyanNewton |
| Built on | ghc-7.6 |
| Distributions | NixOS: 0.2.0.2 |
Modules
Downloads
- lockfree-queue-0.2.tar.gz (Cabal source package)
- package description (included in the package)