Seguir
Trevor Brown
Trevor Brown
University of Waterloo
Dirección de correo verificada de tbrown.pro - Página principal
Título
Citado por
Citado por
Año
A general technique for non-blocking trees
T Brown, F Ellen, E Ruppert
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of …, 2014
1522014
Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way
TA Brown
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015
1282015
Non-blocking k-ary search trees
T Brown, J Helga
Principles of Distributed Systems, 207-221, 2011
612011
Pragmatic primitives for non-blocking data structures
T Brown, F Ellen, E Ruppert
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
542013
Range queries in non-blocking k-ary search trees
T Brown, H Avni
Principles of Distributed Systems, 31-45, 2012
512012
Harnessing epoch-based reclamation for efficient range queries
M Arbel-Raviv, T Brown
ACM SIGPLAN Notices 53 (1), 14-27, 2018
452018
Investigating the performance of hardware transactions on a multi-socket machine
T Brown, A Kogan, Y Lev, V Luchangco
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
432016
Techniques for Constructing Efficient Lock-free Data Structures
T Brown
University of Toronto (Canada), 2017
352017
Distributionally linearizable data structures
D Alistarh, T Brown, J Kopinsky, JZ Li, G Nadiradze
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
342018
Persistent hybrid transactional memory for databases
H Avni, T Brown
Proceedings of the VLDB Endowment 10 (4), 409-420, 2016
342016
Non-blocking interpolation search trees with doubly-logarithmic running time
T Brown, A Prokopec, D Alistarh
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of …, 2020
332020
Getting to the Root of Concurrent Binary Search Tree Performance
M Arbel-Raviv, T Brown, A Morrison
2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18), 295-306, 2018
332018
NBR: neutralization based reclamation
A Singh, T Brown, A Mashtizadeh
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021
222021
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors
M Arbel-Raviv, T Brown
arXiv preprint arXiv:1708.01797, 2017
212017
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
D Alistarh, T Brown, J Kopinsky, G Nadiradze
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
172018
Elimination (a, b)-trees with fast, durable updates
A Srivastava, T Brown
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
152022
A Template for Implementing Fast Lock-free Trees Using HTM
T Brown
Proceedings of the ACM Symposium on Principles of Distributed Computing, 293-302, 2017
142017
PHyTM: Persistent Hybrid Transactional Memory.
T Brown, H Avni
Proc. VLDB Endow. 10 (4), 409-420, 2016
122016
B-slack trees: Space Efficient B-trees
T Brown
Algorithm Theory–SWAT 2014, 122-133, 2014
72014
PathCAS: an efficient middle ground for concurrent search data structures
T Brown, W Sigouin, D Alistarh
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
62022
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20