lockfree-queue
Version 0.2.4 revision 0 uploaded by ryanglscott.
Package meta
- Synopsis
- Michael and Scott lock-free queues.
- Description
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.- Author
- Ryan R. Newton
- Bug reports
- https://github.com/rrnewton/haskell-lockfree/issues
- Category
- Data, Concurrent
- Copyright
- n/a
- Homepage
- https://github.com/rrnewton/haskell-lockfree/wiki
- Maintainer
- rrnewton@gmail.com
- Package URL
- n/a
- Stability
- n/a