chaselev-deque

Chase & Lev work-stealing lock-free double-ended queues (deques).

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

LTS Haskell 18.28:	0.5.0.5
Stackage Nightly 2021-06-14:	0.5.0.5
Latest on Hackage:	0.5.0.5

See all snapshots chaselev-deque appears in

BSD-3-Clause licensed by Ryan R. Newton, Edward Kmett

Maintained by [email protected]

This version can be pinned in stack with:chaselev-deque-0.5.0.5@sha256:7c2ae6933897c7323396c97f5d5e8f3463fc5f312a9a829d39fc7918a645e48f,2998

Module documentation for 0.5.0.5

Data
- Data.Concurrent
  - Data.Concurrent.Deque
    - Data.Concurrent.Deque.ChaseLev
      - Data.Concurrent.Deque.ChaseLev.DequeInstance

Depends on 7 packages(full list with versions):

abstract-deque, array, atomic-primops, base, ghc-prim, transformers, vector

A queue that is push/pop on one end and pop-only on the other. These are commonly used for work-stealing. This implementation derives directly from the pseudocode in the 2005 SPAA paper:

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.170.1097&rep=rep1&type=pdf