-
Notifications
You must be signed in to change notification settings - Fork 1
/
refs.bib
177 lines (158 loc) · 4.88 KB
/
refs.bib
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
@inproceedings{lcrq,
title={Fast concurrent queues for x86 processors},
author={Morrison, Adam and Afek, Yehuda},
booktitle={ACM SIGPLAN Notices},
volume={48},
number={8},
pages={103--112},
year={2013},
organization={ACM}
}
@article{herlihyBook,
title={The Art of Multiprocessor Programming},
author={Herlihy, Maurice and Shavit, Nir},
year={2008},
publisher={Morgan Kaufmann Publishers Inc.}
}
@article{wfsync,
title={Wait-free synchronization},
author={Herlihy, Maurice},
journal={ACM Transactions on Programming Languages and Systems (TOPLAS)},
volume={13},
number={1},
pages={124--149},
year={1991},
publisher={ACM}
}
@inproceedings{optCuckoo,
title={MemC3: Compact and concurrent memcache with dumber caching and
smarter hashing},
author={Fan, Bin and Andersen, David G and Kaminsky, Michael},
booktitle={Presented as part of the 10th USENIX Symposium on Networked
Systems Design and Implementation (NSDI 13)},
pages={371--384},
year={2013}
}
@inproceedings{hopscotch,
title={Hopscotch hashing},
author={Herlihy, Maurice and Shavit, Nir and Tzafrir, Moran},
booktitle={International Symposium on Distributed Computing},
pages={350--364},
year={2008},
organization={Springer}
}
@inproceedings{liu2014,
title={Dynamic-sized nonblocking hash tables},
author={Liu, Yujie and Zhang, Kunlong and Spear, Michael},
booktitle={Proceedings of the 2014 ACM symposium on Principles of
distributed computing},
pages={242--251},
year={2014},
organization={ACM}
}
@article{linearPaper,
title={Linearizability: A correctness condition for concurrent objects},
author={Herlihy, Maurice P and Wing, Jeannette M},
journal={ACM Transactions on Programming Languages and Systems (TOPLAS)},
volume={12},
number={3},
pages={463--492},
year={1990},
publisher={ACM}
}
@inproceedings{rpHash,
title={Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming.},
author={Triplett, Josh and McKenney, Paul E and Walpole, Jonathan},
year={2011}
}
@phdthesis{rpThesis,
title={Extending relativistic programming to multiple writers},
author={Howard, Philip William},
year={2012},
school={Portland State University}
}
@misc{rcuLinux,
title = {{What is RCU?} RCU Linux Overview},
howpublished = {\url{https://www.kernel.org/doc/Documentation/RCU/whatisRCU.txt}},
year = {2014},
note = {Accessed: 2016-12-23}
}
@article{splitOrder,
title={Split-ordered lists: Lock-free extensible hash tables},
author={Shalev, Ori and Shavit, Nir},
journal={Journal of the ACM (JACM)},
volume={53},
number={3},
pages={379--405},
year={2006},
publisher={ACM}
}
@inproceedings{perfectHash,
title={Concurrent multi-level arrays: Wait-free extensible hash maps},
author={Feldman, Steven and LaBorde, Pierre and Dechev, Damian},
booktitle={Embedded Computer Systems: Architectures, Modeling, and
Simulation (SAMOS XIII), 2013 International Conference on},
pages={155--163},
year={2013},
organization={IEEE}
}
@inproceedings{phaseConc,
title={Phase-concurrent hash tables for determinism},
author={Shun, Julian and Blelloch, Guy E},
booktitle={Proceedings of the 26th ACM symposium on Parallelism in
algorithms and architectures},
pages={96--107},
year={2014},
organization={ACM}
}
@inproceedings{conUpRCU,
author = {Arbel, Maya and Attiya, Hagit},
title = {Concurrent Updates with RCU: Search Tree As an Example},
booktitle = {Proceedings of the 2014 ACM Symposium on Principles of
Distributed Computing},
series = {PODC '14},
year = {2014},
isbn = {978-1-4503-2944-6},
location = {Paris, France},
pages = {196--205},
numpages = {10},
url = {http://doi.acm.org/10.1145/2611462.2611471},
doi = {10.1145/2611462.2611471},
acmid = {2611471},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {internal search tree, read-copy-update, shared
memory},
}
@article{hpPaper,
title={Hazard pointers: Safe memory reclamation for lock-free objects},
author={Michael, Maged M},
journal={IEEE Transactions on Parallel and Distributed Systems},
volume={15},
number={6},
pages={491--504},
year={2004},
publisher={IEEE}
}
@inproceedings{newMemRec,
author = {Dice, Dave and Herlihy, Maurice and Kogan, Alex},
title = {Fast Non-intrusive Memory Reclamation for Highly-concurrent Data Structures},
booktitle = {Proceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management},
series = {ISMM 2016},
year = {2016},
isbn = {978-1-4503-4317-6},
location = {Santa Barbara, CA, USA},
pages = {36--45},
numpages = {10},
url = {http://doi.acm.org/10.1145/2926697.2926699},
doi = {10.1145/2926697.2926699},
acmid = {2926699},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {concurrent data structures, hazard pointers, memory barriers, memory reclamation},
}
@phdthesis{fraserEBMR,
title={Practical lock-freedom},
author={Fraser, Keir},
year={2004},
}