4 The Concurrent Data Structures (CDS) library is a collection of concurrent data structures
\r
5 that don't require external (manual) synchronization, and safe memory reclamation (SMR)
\r
6 algorithms like Hazard Pointer and user-space RCU. CDS is mostly header-only template library.
\r
7 Only SMR core implementation is segregated to .so (or .dll) file.
\r
9 The library contains the implementations of the following containers:
\r
10 - lock-free stack with optional elimination support
\r
11 - several algo for lock-free queue, including classic Michael & Scott algorithm and it's derivatives,
\r
12 flat combining queue, segmented queue.
\r
13 - several implementation of unordered set/map - lock-free and fine-grained lock-based
\r
14 - lock-free skip-list
\r
16 Generally, each container has an intrusive and non-intrusive (STL-like) version belonging to
\r
17 cds::intrusive and cds::container namespace respectively.
\r
19 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
20 and MS VC++ 12 (2013) Update 4.
\r
22 Download the latest release from http://sourceforge.net/projects/libcds/files/.
\r
27 - TreiberStack: [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.
\r
28 - Elimination back-off implementation is based on idea from
\r
29 [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"
\r
32 - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"
\r
34 * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"
\r
35 * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes"
\r
36 * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"
\r
37 - RWQueue: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"
\r
38 - MoirQueue: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm"
\r
39 - OptimisticQueue: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues"
\r
40 - SegmentedQueue: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency"
\r
41 - TsigasCycleQueue: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems"
\r
42 - VyukovMPMCCycleQueue Dmitry Vyukov (see http://www.1024cores.net)
\r
45 MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"
\r
48 - MichaelHashMap: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"
\r
49 - SplitOrderedList: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"
\r
50 - StripedMap, StripedSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
51 - CuckooMap, CuckooSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
52 - SkipListMap, SkipListSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"
\r
54 Ordered single-linked list (buckets for the map):
\r
55 - 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
56 - MichaelList: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"
\r
59 - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"
\r
62 - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"
\r
66 * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes"
\r
67 * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"
\r
68 * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers"
\r
70 * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis,
\r
71 Chapter 6 "User-Level Implementations of Read-Copy Update"
\r
72 * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level
\r
73 Implementations of Read-Copy Update"
\r
75 Memory allocation: [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"
\r
77 Flat Combining technique: [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"
\r