CDS C++ library\r
===============\r
\r
-The Concurrent Data Structures (CDS) library is a collection of concurrent data structures \r
-that don't require external (manual) synchronization, and safe memory reclamation (SMR) \r
-algorithms like Hazard Pointer and user-space RCU. CDS is mostly header-only template library. \r
-Only SMR core implementation is segregated to .so (or .dll) file.\r
+The Concurrent Data Structures (CDS) library is a collection of concurrent containers\r
+that don't require external (manual) synchronization for shared access, and safe memory reclamation (SMR) \r
+algorithms like [Hazard Pointer](http://en.wikipedia.org/wiki/Hazard_pointer) \r
+and user-space [RCU](http://en.wikipedia.org/wiki/Read-copy-update). \r
+CDS is mostly header-only template library. Only SMR core implementation is segregated to .so/.dll file.\r
\r
The library contains the implementations of the following containers:\r
- - lock-free stack with optional elimination support\r
+ - [lock-free](http://en.wikipedia.org/wiki/Non-blocking_algorithm) stack with optional elimination support\r
- several algo for lock-free queue, including classic Michael & Scott algorithm and it's derivatives,\r
flat combining queue, segmented queue.\r
- several implementation of unordered set/map - lock-free and fine-grained lock-based\r
- - lock-free skip-list\r
+ - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)\r
\r
Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to \r
-cds::intrusive and cds::container namespace respectively.\r
+*cds::intrusive* and *cds::container* namespace respectively.\r
\r
Version 2.x of the library is written on C++11 and can be compiled by GCC 4.8+, clang 3.3+, Intel C++ 15+, \r
and MS VC++ 12 (2013) Update 4.\r
projects / libcds.git / blobdiff