-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathindex.html
211 lines (202 loc) · 7.68 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
<!DOCTYPE html>
<html lang="en">
<head>
<!-- Basic Page Needs
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<meta charset="utf-8">
<title>Concurrent data structures</title>
<meta name="description" content="">
<meta name="author" content="">
<!-- Mobile Specific Metas
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<meta name="viewport" content="width=device-width, initial-scale=1">
<!-- FONT
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<link href="//fonts.googleapis.com/css?family=Raleway:400,300,600" rel="stylesheet" type="text/css">
<!-- CSS
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<link rel="stylesheet" href="css/normalize.css">
<link rel="stylesheet" href="css/skeleton.css">
<!-- Favicon
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<link rel="icon" type="image/png" href="images/favicon.png">
</head>
<body>
<!-- Primary Page Layout
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
<div class="container">
<div class="row">
<div class="twelve column">
<h1>Concurrent data structures</h1>
<p>The following repository contains a recompilation of the available
concurrent data structures on the web that have at least <i>lock-free</i> or
<i>wait-free</i> properties.</p>
<table class="u-full-width">
<thead>
<tr>
<th>Category</th>
<th>Name</th>
<th>Status</th>
<th>Rescued from</th>
<th>Annotations</th>
</tr>
</thead>
<tbody>
<tr>
<td>Stack</td>
<td>Stack</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td></td>
</tr>
<tr>
<td>Queue</td>
<td>Queue</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td></td>
</tr>
<tr>
<td>Queue</td>
<td>Bounded Queue</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td>Bounded, single-consumer, single-producer</td>
</tr>
<tr>
<td>Queue</td>
<td>Ringbuffer (circular queue)</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td></td>
</tr>
<tr>
<td>List</td>
<td>Linked list</td>
<td>Not tested</td>
<td><a href="http://people.csail.mit.edu/bushl2/rpi/project_web/page5.html">Lawrence Bush</a></td>
<td></td>
</tr>
<tr>
<td>List</td>
<td>Free list</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td></td>
</tr>
<tr>
<td>List</td>
<td>Single linked List (ordered)</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td>Add-only, ordered, singly-linked</td>
</tr>
<tr>
<td>List</td>
<td>Single linked List (unordered)</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td>Add-only, singly-linked, unordered</td>
</tr>
<tr>
<td>Hash</td>
<td>Hash map</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a</td>
<td>Add-only</td>
</tr>
<tr>
<td>Tree</td>
<td>Binary tree</td>
<td>Not tested</td>
<td><a href="http://liblfds.org/">http://liblfds.org/</a></td>
<td>Add-only, unbalanced</td>
</tr>
<tr>
<td>Tree</td>
<td>Suffix tree</td>
<td>Not tested</td>
<td><a href="https://github.com/npgall/concurrent-trees">
Concurrent Suffix Trees for Java</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>Ratix tree</td>
<td>Not tested</td>
<td><a href="https://github.com/npgall/concurrent-trees">
Concurrent Radix Trees for Java</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>B tree</td>
<td>Not tested</td>
<td><a href="https://github.com/malbrain/Btree-source-code/">
Btree-source-code</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>Segment tree</td>
<td></td>
<td></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>Red black tree</td>
<td>Not tested</td>
<td><a href="http://www.cl.cam.ac.uk/research/srg/netos/projects/archive/lock-free/">University of Cambridge</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>AVL tree</td>
<td>Not tested</td>
<td><a href="https://github.com/wichtounet/btrees/">Concurrent Trees</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>Trie</td>
<td>Not tested</td>
<td><a href="http://arxiv.org/abs/1405.2850">Lock-Free Hash Trie Design</a></td>
<td></td>
</tr>
<tr>
<td>Tree</td>
<td>Heap</td>
<td>Not tested</td>
<td><a href="http://libcds.sourceforge.net/doc/cds-api/index.html">cds</a></td>
<td></td>
</tr>
<tr>
<td>Array</td>
<td></td>
<td>Not tested</td>
<td><a href="http://libcds.sourceforge.net/doc/cds-api/index.html">cds</a></td>
<td></td>
</tr>
<tr>
<td>Matrices</td>
<td></td>
<td></td>
<td></td>
<td></td>
</tr>
</tbody>
</table>
<p>Information: <a href="https://github.com/izenecloud/big-data-made-easy">Big Data Made Easy</a></p>
<h2>Contributors</h2>
<ul>
<li>Matías Agustín Bustos Paredes (<a href="mailto:[email protected]" target="_top"[email protected]>[email protected]</a>)</li>
<li>Chien-Hao Chen (<a href="mailto:[email protected]" target="_top">[email protected]</a>)</li>
</ul>
</div>
</div>
</div>
<!-- End Document
–––––––––––––––––––––––––––––––––––––––––––––––––– -->
</body>
</html>