lockfree-queue

Michael and Scott lock-free queues.

https://github.com/rrnewton/haskell-lockfree/wiki

Version on this page:	0.2.3.1
LTS Haskell 22.37:	0.2.4
Stackage Nightly 2024-10-08:	0.2.4
Latest on Hackage:	0.2.4

See all snapshots lockfree-queue appears in

BSD-3-Clause licensed by Ryan R. Newton

Maintained by [email protected]

This version can be pinned in stack with:lockfree-queue-0.2.3.1@sha256:2a01c98b479fff93e1fb1631c53164e719579ac6389aa3227acefd80d15d8b53,2964

Module documentation for 0.2.3.1

Data
- Data.Concurrent
  - Data.Concurrent.Queue
    - Data.Concurrent.Queue.MichaelScott
      - Data.Concurrent.Queue.MichaelScott.DequeInstance

Depends on 5 packages(full list with versions):

abstract-deque, atomic-primops, base, bytestring, ghc-prim

Used by 1 package in lts-11.22(full list with versions):

streamly

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.