From: khizmax <khizmax@gmail.com>
Date: Tue, 2 Dec 2014 16:40:01 +0000 (+0300)
Subject: markdown readme
X-Git-Tag: v2.0.0~18
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=60d0b90ecd61baa0f45a6a04337745f52f2ae0fc;p=libcds.git

markdown readme
---

diff --git a/readme.md b/readme.md
index 8b3b16ef..83a8277f 100644
--- a/readme.md
+++ b/readme.md
@@ -23,14 +23,13 @@ Download the latest release from http://sourceforge.net/projects/libcds/files/.
 
 References
 ----------
-Stack
+#### Stack
     - TreiberStack: [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986.
-    - Elimination back-off implementation is based on idea from 
-      [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"
+    - Elimination back-off implementation is based on idea from [2004] Danny Hendler, Nir Shavit, Lena Yerushalmi "A Scalable Lock-free Stack Algorithm"
         
-Queue
+#### Queue
     - BasketQueue: [2007] Moshe Hoffman, Ori Shalev, Nir Shavit "The Baskets Queue"
-    - MSQueue
+    - 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"
@@ -41,27 +40,27 @@ Queue
     - 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
+#### Deque
     - MichaelDeque: [2003] Maged Michael "CAS-based Lock-free Algorithm for Shared Deque"
 
-Map, set
+#### 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"
         
-Ordered single-linked list (buckets for the map)
+#### 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"
 
-Priority queue
+#### Priority queue
     - MSPriorityQueue: [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient algorithm for concurrent priority queue heaps"
 
-Tree
+#### Tree
     - EllenBinTree: [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel "Non-blocking Binary Search Tree"
 
-Garbage collection
+#### 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"
@@ -72,6 +71,8 @@ Garbage collection
         * [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"
+#### 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"
+#### Flat Combining technique
+    - [2010] Hendler, Incze, Shavit and Tzafrir "Flat Combining and the Synchronization-Parallelism Tradeoff"