libcds - C++ template library of lock-free and fine-grained algorithms

Distribution: ALT Linux Sisyphus
Repository: Classic x86_64
Package name: libcds
Package version: 2.0.0
Package release: alt2
Package architecture: x86_64
Package type: rpm
Installed size: 34.51 KB
Download size: 34.51 KB
Official Mirror:
CDS is a C++ template library of lock-free and fine-grained algorithms. It contains a collection of concurrent data structure implementations: Atomic operations with memory ordering support for x86, amd64, Itanium, Sparc processor architectures Safe memory reclamation (SMR) algorithms: Michael's Hazard Pointer Pass-the-Buck SMR Gidenstam's Hazard Pointer with reference counting User-space RCU Data structures - a lot of intrusive and non-intrusive container algorithms for different SMR schemas intrusive and non-intrusive stacks intrusive and non-intrusive queues: Michael & Scott lock-free and read/write lock-based, Moir et al algo, Ladan-Mozes & Shavit optimistic queue, basket queue, bounded (ring-buffered) algos intrusive and non-intrusive deque: Michael's algo intrusive and non-intrusive ordered lists: Michael's algo, Lazy list algo intrusive and non-intrusive sets and maps: Michael hash-map, Split-ordere list by Ori Shalev & Nir Shavit, Skip-list, Cuckoo hash map/set Synchronization primitives - spin-lock with different back-off technique Michael's memory allocator. See cds::memory::michael::Heap in documentation



  • libcds = 2.0.0-alt2


    Install Howto

    1. Add the following line to /etc/apt/sources.list:
      rpm [Sisyphus] x86_64 classic
      rpm [Sisyphus] noarch classic
    2. Update the package index:
      # sudo apt-get update
    3. Install libcds rpm package:
      # sudo apt-get install libcds


    • /usr/lib64/


    2015-10-29 - Vitaly Lipatov <> 2.0.0-alt2 - real 2.0.0 build

    2015-08-11 - Vitaly Lipatov <> 2.0.0-alt1 - new version 2.0.0 (with rpmrb script)

    2014-12-09 - Vitaly Lipatov <> 1.6.0-alt1 - initial build for ALT Linux Sisyphus