+++ /dev/null
-CDS (Concurrent Data Structures) C++ library\r
-\r
-CDS library is (mostly) header-only template library. The shared library contains only garbage collector's core implementation.\r
-Download the latest release from http://sourceforge.net/projects/libcds/files/.\r
-\r
-The library contains implementation of some well-known lock-free and fine-grained data structures:\r
-\r
-Stack:\r
- TreiberStack\r
- [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.\r
- Elimination back-off implementation is based on idea from\r
- [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"\r
- \r
-Queue:\r
- BasketQueue\r
- [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"\r
- MSQueue\r
- [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
- [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes"\r
- [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
- RWQueue\r
- [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms"\r
- MoirQueue\r
- [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm"\r
- OptimisticQueue\r
- [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues"\r
- SegmentedQueue\r
- [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency"\r
- TsigasCycleQueue\r
- [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems"\r
- VyukovMPMCCycleQueue\r
- Dmitry Vyukov (see http://www.1024cores.net)\r
-\r
-Deque:\r
- MichaelDeque\r
- [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"\r
-\r
-Map, set:\r
- MichaelHashMap\r
- [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
- SplitOrderedList\r
- [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"\r
- StripedMap, StripedSet\r
- [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
- CuckooMap, CuckooSet\r
- [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
- SkipListMap, SkipListSet\r
- [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming"\r
- \r
-Ordered single-linked list (buckets for the map):\r
- LazyList\r
- [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm"\r
- MichaelList\r
- [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets"\r
-\r
-Priority queue:\r
- MSPriorityQueue\r
- [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"\r
-\r
-Tree:\r
- EllenBinTree\r
- [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"\r
-\r
-Garbage collection:\r
- Hazard Pointers\r
- [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes"\r
- [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects"\r
- [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers"\r
- Hazard pointers with reference counting\r
- [2006] A.Gidenstam "Algorithms for synchronization and consistency in concurrent system services", Chapter 5 "Lock-Free Memory Reclamation" Thesis for the degree of Doctor of Philosophy \r
- [2005] Anders Gidenstam, Marina Papatriantafilou and Philippas Tsigas "Allocating memory in a lock-free manner", Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), Lecture Notes in Computer Science Vol. 3669, pages 229 \96 242, Springer-Verlag, 2005\r
- Pass-the-Buck\r
- [2002] M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting\r
- dynamic-sized lockfree data structures. Technical Report TR-2002-112, Sun Microsystems Laboratories, 2002\r
- [2002] M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized Lockfree Data Structures. \r
- Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002\r
- [2005] M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Nonblocking Memory Management Support\r
- for Dynamic_Sized Data Structures. ACM Transactions on Computer Systems, Vol.23, No.2, May 2005\r
- User-space RCU\r
- [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis,\r
- Chapter 6 "User-Level Implementations of Read-Copy Update"\r
- [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level\r
- Implementations of Read-Copy Update"\r
-\r
-Memory allocation:\r
- [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation"\r
-\r
-Common approach:\r
- [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and \r
- the Synchronization-Parallelism Tradeoff"\r
- \r
-Supported compilers\r
----------------------------------\r
-\r
-GCC: 4.8 and above\r
-MS Visual C++: 12 (2013) Update 4 and above\r
-Clang: 3.3 and above\r
-\r
-How to build\r
-------------\r
-\r
-The CDS library is depend on boost header-only libraries (tested with boost 1.47 and later). \r
-The regression tests in tests directory also depends on boost_thread dynamic library. \r
-You should build boost_thread library before building CDS test.\r
-\r
-Windows\r
- Use Visual C++ 2013 solution projects\Win\vc12\cds.sln.\r
- The solution depends on BOOST_PATH environment variable that contains the path to boost root directory. \r
- The CDS tests also depends on boost_thread library in %BOOST_PATH%\stage\lib or %BOOST_PATH%\bin.\r
-\r
-Unix \r
- GCC compiler supported (4.8 and above) and Clang 3.3 and above for Linux\r
- Use script build/build.sh that builds release and debug libcds.so and tests executable. Please,\r
- do not try to call 'make' directly, - build.sh script sets necessary vars for make.\r
- See examples in build/sample directory.\r
-\r
- build.sh main options:\r
- -x compiler C++ compiler name (g++, gcc, clang; default g++)\r
- -p arch Processor architecture. Possible values are: x86, amd64, x86_64, sparc, ia64\r
- -o os_family OS family. Possible values are: linux, sunos, solaris, hpux\r
- -b bits Bits to build (32 or 64)\r
- -l options Extra linker options\r
- -x options Extra compiler options\r
- --with-boost path Path to boost root\r
- --clean Clean all before building\r
-\r
- For more options use build.sh -h\r
-\r
-Warnings\r
- GCC: compile CDS library and all projects that depends on libcds with -fno-strict-aliasing flag!\r
- \r
-Test suite\r
-----------\r
- Note the duration of full test set is up to 24 hours (depending on your hardware and test configuration)\r
projects / libcds.git / commitdiff