Group :: System/Libraries
RPM: libcds
Navigation
Main Changelog Spec Patches Sources Download Gear Bugs and FR Repocop
Current version: 2.0.0-alt2
Build date: 28 october 2015, 21:28 ( 442.3 weeks ago )
Size: 1273.17 Kb
Home page: http://libcds.sourceforge.net/
License: BSD like
Summary: C++ template library of lock-free and fine-grained algorithms
Description:
List of contributors List of rpms provided by this srpm:
ACL:
Build date: 28 october 2015, 21:28 ( 442.3 weeks ago )
Size: 1273.17 Kb
Home page: http://libcds.sourceforge.net/
License: BSD like
Summary: C++ template library of lock-free and fine-grained algorithms
Description:
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
Current maintainer: Vitaly Lipatov 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
List of contributors List of rpms provided by this srpm:
- libcds
- libcds-debuginfo
- libcds-devel
- libcds-devel-debuginfo