4 The Concurrent Data Structures (CDS) library is a collection of concurrent containers
\r
5 that don't require external (manual) synchronization for shared access, and safe memory reclamation (SMR)
\r
6 algorithms like [Hazard Pointer](http://en.wikipedia.org/wiki/Hazard_pointer)
\r
7 and user-space [RCU](http://en.wikipedia.org/wiki/Read-copy-update).
\r
8 CDS is mostly header-only template library. Only SMR core implementation is segregated to .so/.dll file.
\r
10 The library contains the implementations of the following containers:
\r
11 - [lock-free](http://en.wikipedia.org/wiki/Non-blocking_algorithm) stack with optional elimination support
\r
12 - several algo for lock-free queue, including classic Michael & Scott algorithm and its derivatives,
\r
13 the flat combining queue, the segmented queue.
\r
14 - several implementation of unordered set/map - lock-free and fine-grained lock-based
\r
15 - [flat-combining] (http://mcg.cs.tau.ac.il/projects/projects/flat-combining) technique
\r
16 - lock-free [skip-list](http://en.wikipedia.org/wiki/Skip_list)
\r
18 Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to
\r
19 *cds::intrusive* and *cds::container* namespace respectively.
\r
21 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
22 and MS VC++ 12 (2013) Update 4.
\r
24 Download the latest release from http://sourceforge.net/projects/libcds/files/
\r
26 See online doxygen-generated doc here: http://libcds.sourceforge.net/doc/cds-api/index.html
\r
28 **Pull request requirements**
\r
29 - Pull-request to *master* branch will be unconditionally rejected
\r
30 - *integration* branch is intended for pull-request. Usually, *integration* branch is the same as *master*
\r
31 - *dev* branch is intended for main developing. Usually, it contains unstable code
\r
37 - *TreiberStack*: [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.
\r
38 - Elimination back-off implementation is based on idea from [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"
\r
39 - *FCStack* - flat-combining wrapper for *std::stack*
\r
42 - *BasketQueue*: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"
\r
44 * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"
\r
45 * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes"
\r
46 * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"
\r
47 - *RWQueue*: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"
\r
48 - *MoirQueue*: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm"
\r
49 - *OptimisticQueue*: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues"
\r
50 - *SegmentedQueue*: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency"
\r
51 - *FCQueue* - flat-combining wrapper for *std::queue*
\r
52 - *TsigasCycleQueue*: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems"
\r
53 - *VyukovMPMCCycleQueue* Dmitry Vyukov (see http://www.1024cores.net)
\r
56 - flat-combining deque based on *stl::deque*
\r
59 - *MichaelHashMap*: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"
\r
60 - *SplitOrderedList*: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"
\r
61 - *StripedMap*, *StripedSet*: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
62 - *CuckooMap*, *CuckooSet*: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
63 - *SkipListMap*, *SkipListSet*: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
65 *Ordered single-linked list*
\r
66 - *LazyList*: [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm"
\r
67 - *MichaelList*: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"
\r
70 - *MSPriorityQueue*: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"
\r
73 - *EllenBinTree*: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"
\r
77 * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes"
\r
78 * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"
\r
79 * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers"
\r
81 * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis,
\r
82 Chapter 6 "User-Level Implementations of Read-Copy Update"
\r
83 * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level
\r
84 Implementations of Read-Copy Update"
\r
87 - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"
\r
89 *Flat Combining* technique
\r
90 - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"
\r