What is it all about?
CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms.
Key Features
It contains a collection of concurrent data structure implementations: * Safe memory reclamation (SMR) algorithms: Michael's Hazard Pointer, 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 ordered lists: Michael's algo, Lazy list algo, Iterable list. intrusive and non-intrusive sets and maps: Michael hash-map, Split-ordere list by Ori Shalev & Nir Shavit, Skip-list, Feldman's multi-level array, Cuckoo hash map/set, Flat-combining wrappers for standard containers. * Synchronization primitives - spin-lock with different back-off technique.
Pricing
Yearly
Monthly
Lifetime
Free
Freemium
Trial With Card
Trial No Card
By Quote
Description
free
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
){kind=logo}
Top DiscoverSDK Experts
Gilad Levi
Software developer and Cyber security expert
Networking | Security and 13 more
View Profile
Interested in becoming a DiscoverSDK Expert? Learn more
X
Compare Products
Select up to three two products to compare by clicking on the compare icon () of each product.
{{compareToolModel.Error}}Now comparing:
{{product.ProductName | createSubstring:25}} X