BSD3 licensed by Ryan R. Newton
Maintained by

Module documentation for

Michael and Scott queues are described in their PODC 1996 paper:

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.

Used by 2 packages:
comments powered byDisqus