_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
ghc-lockfree-queue 0.2.4
Dependencies: ghc-abstract-deque@0.3 ghc-atomic-primops@0.8.4
Channel: ajattix
Location: ajatt/packages/haskell.scm (ajatt packages haskell)
Home page: https://github.com/rrnewton/haskell-lockfree/wiki
Licenses: Modified BSD
Build system: haskell
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@.

Total results: 1