cds Publisher's description
CDS is a C++ template library of lock-free and fine-grained algorithms.
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
Gidenstam's Hazard Pointer with reference counting
IDM tagged pointer technique (only for x86/amd64)
Data structures - a lot of algo for different SMR schemas
queues: Michael & Scott lock-free and read/write lock-based, Moir et al algo, Ladan-Mozes & Shavit optimistic queue, bounded (ring-buffered) algos
ordered lists: Michael's algo, Lazy list algo
maps: Michael hash-map, Split-ordere list by Ori Shalev & Nir Shavit
Synchronization primitives - spin-lock with different back-off technique
new in 0.8.0 Michael's memory allocator. See cds::memory::michael::Heap in documentation
The library is mostly header-only with small kernel in .dll (.so) file for core SMR functionality and small set of static data. See online documentation for detailed reference of CDS features.
System Requirements:No special requirements.
Program Release Status: Minor Update
Program Install Support: Install and Uninstall