lockfree-queue

Michael and Scott lock-free queues. https://github.com/rrnewton/haskell-lockfree/wiki

Latest on Hackage:0.2.3.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD3 licensed by Ryan R. Newton
Maintained by rrnewton@gmail.com

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.

comments powered byDisqus