lockfree-queue: Michael and Scott lock-free queues.

[ bsd3, concurrent, data, library ] [ Propose Tags ]

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.

Versions 0.2, 0.2.0.1, 0.2.0.2, 0.2.3, 0.2.3.1
Dependencies abstract-deque, atomic-primops, base (>=4.4.0.0 && <5), bytestring, ghc-prim, IORefCAS (>=0.2) [details]
License BSD-3-Clause
Author Ryan R. Newton
Maintainer rrnewton@gmail.com
Category Data, Concurrent
Home page https://github.com/rrnewton/haskell-lockfree-queue/wiki
Source repo head: git clone git://github.com/rrnewton/haskell-lockfree-queue.git
Uploaded by RyanNewton at Tue May 7 20:39:50 UTC 2013
Distributions LTSHaskell:0.2.3.1, NixOS:0.2.3.1, Stackage:0.2.3.1, openSUSE:0.2.3.1
Downloads 2004 total (28 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees