From f897b877f3e918ffe42f0b026d93b20d4734a190 Mon Sep 17 00:00:00 2001 From: khizmax Date: Tue, 2 Dec 2014 19:47:22 +0300 Subject: [PATCH] markdown readme --- readme.md | 66 +++++++++++++++++++++++++++---------------------------- 1 file changed, 33 insertions(+), 33 deletions(-) diff --git a/readme.md b/readme.md index 99632a73..9279e390 100644 --- a/readme.md +++ b/readme.md @@ -19,7 +19,7 @@ cds::intrusive and cds::container namespace respectively. 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+, and MS VC++ 12 (2013) Update 4. -Download the latest release from http://sourceforge.net/projects/libcds/files/. +Download the latest release from http://sourceforge.net/projects/libcds/files/ References ---------- @@ -28,51 +28,51 @@ Stack - Elimination back-off implementation is based on idea from [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm" Queue - - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue" - - MSQueue: - * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms" - * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes" - * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects" - - RWQueue: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms" - - MoirQueue: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm" - - OptimisticQueue: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues" - - SegmentedQueue: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency" - - TsigasCycleQueue: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems" - - VyukovMPMCCycleQueue Dmitry Vyukov (see http://www.1024cores.net) + - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue" + - MSQueue: + * [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms" + * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-free objects using atomic reads and writes" + * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects" + - RWQueue: [1998] Maged Michael, Michael Scott "Simple, fast, and practical non-blocking and blocking concurrent queue algorithms" + - MoirQueue: [2000] Simon Doherty, Lindsay Groves, Victor Luchangco, Mark Moir "Formal Verification of a practical lock-free queue algorithm" + - OptimisticQueue: [2008] Edya Ladan-Mozes, Nir Shavit "An Optimistic Approach to Lock-Free FIFO Queues" + - SegmentedQueue: [2010] Afek, Korland, Yanovsky "Quasi-Linearizability: relaxed consistency for improved concurrency" + - TsigasCycleQueue: [2000] Philippas Tsigas, Yi Zhang "A Simple, Fast and Scalable Non-Blocking Concurrent FIFO Queue for Shared Memory Multiprocessor Systems" + - VyukovMPMCCycleQueue Dmitry Vyukov (see http://www.1024cores.net) Deque - - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque" + - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque" Map, set - - MichaelHashMap: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets" - - SplitOrderedList: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables" - - StripedMap, StripedSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" - - CuckooMap, CuckooSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" - - SkipListMap, SkipListSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" + - MichaelHashMap: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets" + - SplitOrderedList: [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables" + - StripedMap, StripedSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" + - CuckooMap, CuckooSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" + - SkipListMap, SkipListSet: [2008] Maurice Herlihy, Nir Shavit "The Art of Multiprocessor Programming" Ordered single-linked list - - LazyList: [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm" - - MichaelList: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets" + - LazyList: [2005] Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, and Nir Shavit "A Lazy Concurrent List-Based Set Algorithm" + - MichaelList: [2002] Maged Michael "High performance dynamic lock-free hash tables and list-based sets" Priority queue - - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps" + - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps" Tree - - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree" + - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree" Garbage collection - - Hazard Pointers - * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes" - * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects" - * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers" - - User-space RCU - * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis, - Chapter 6 "User-Level Implementations of Read-Copy Update" - * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level - Implementations of Read-Copy Update" + - Hazard Pointers + * [2002] Maged M.Michael "Safe memory reclamation for dynamic lock-freeobjects using atomic reads and writes" + * [2003] Maged M.Michael "Hazard Pointers: Safe memory reclamation for lock-free objects" + * [2004] Andrei Alexandrescy, Maged Michael "Lock-free Data Structures with Hazard Pointers" + - User-space RCU + * [2009] M.Desnoyers "Low-Impact Operating System Tracing" PhD Thesis, + Chapter 6 "User-Level Implementations of Read-Copy Update" + * [2011] M.Desnoyers, P.McKenney, A.Stern, M.Dagenias, J.Walpole "User-Level + Implementations of Read-Copy Update" Memory allocation - - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation" + - [2004] M.Michael "Scalable Lock-free Dynamic Memory Allocation" Flat Combining technique - - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff" + - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff" -- 2.34.1