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

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.

Modules

[Index]

Downloads

• lockfree-queue-0.2.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• RyanNewton, ryanglscott, peter_fogg

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates