Trevor Brown

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 45

Top Topics

Top Venues

Publications

Daewoo Kim, Trevor Brown, Ajay Singh
Are Your Epochs Too Epic? Batch Free Can Be Harmful. CoRR (2024)
Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov
Practical Hardware Transactional vEB Trees. PPoPP (2024)
Daewoo Kim, Trevor Brown, Ajay Singh
Are Your Epochs Too Epic? Batch Free Can Be Harmful. PPoPP (2024)
Justus Henneberg, Felix Schuhknecht, Rosina Kharal, Trevor Brown
More Bang For Your Buck(et): Fast and Space-efficient Hardware-accelerated Coarse-granular Indexing on GPUs. CoRR (2024)
Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin
Unexpected Scaling in Path Copying Trees. PPoPP (2023)
Ajay Singh, Trevor Brown, Michael Spear
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. CoRR (2023)
Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
The Fence Complexity of Persistent Sets. SSS (2023)
Ajay Singh, Trevor Brown, Michael Spear
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures. IPDPS (2023)
Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
The Fence Complexity of Persistent Sets. CoRR (2023)
Ilya Kokorin, Alexander Fedorov, Trevor Brown, Vitaly Aksenov
Unexpected Scaling in Path Copying Trees. CoRR (2022)
Rosina Kharal, Trevor Brown
Performance Anomalies in Concurrent Data Structure Microbenchmarks. CoRR (2022)
Trevor Brown, William Sigouin, Dan Alistarh
PathCAS: an efficient middle ground for concurrent search data structures. PPoPP (2022)
Rosina Kharal, Trevor Brown
Performance Anomalies in Concurrent Data Structure Microbenchmarks. OPODIS (2022)
Rosina Kharal, Trevor Brown
Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks. DISC (2022)
Anubhav Srivastava, Trevor Brown
Elimination (a, b)-trees with fast, durable updates. PPoPP (2022)
Trevor Brown, William Sigouin, Dan Alistarh
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures. CoRR (2022)
Anubhav Srivastava, Trevor Brown
Elimination (a, b)-trees with fast, durable updates. CoRR (2021)
Ajay Singh, Trevor Brown, Ali Mashtizadeh
NBR: neutralization based reclamation. PPoPP (2021)
Trevor Brown, Aleksandar Prokopec, Dan Alistarh
Non-blocking interpolation search trees with doubly-logarithmic running time. PPoPP (2020)
Dan Alistarh, Trevor Brown, Nandini Singhal
Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures. SPAA (2020)
Ajay Singh, Trevor Brown, Ali Mashtizadeh
NBR: Neutralization Based Reclamation. CoRR (2020)
Aleksandar Prokopec, Trevor Brown, Dan Alistarh
Analysis and Evaluation of Non-Blocking Interpolation Search Trees. CoRR (2020)
Trevor Brown, Srivatsan Ravi
On the Cost of Concurrency in Hybrid Transactional Memory. CoRR (2019)
Maya Arbel-Raviv, Trevor Brown, Adam Morrison
Getting to the Root of Concurrent Binary Search Tree Performance. USENIX Annual Technical Conference (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
Distributionally Linearizable Data Structures. SPAA (2018)
Eran Gilad, Trevor Brown, Mark Oskin, Yoav Etsion
Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking. Euro-Par (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. CoRR (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze
Distributionally Linearizable Data Structures. CoRR (2018)
Maya Arbel-Raviv, Trevor Brown
Harnessing epoch-based reclamation for efficient range queries. PPOPP (2018)
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC (2018)
Trevor Brown
Reclaiming memory for lock-free data structures: there has to be a better way. CoRR (2017)
Trevor Brown, Hillel Avni
Range Queries in Non-blocking k-ary Search Trees. CoRR (2017)
Maya Arbel-Raviv, Trevor Brown
POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors. PPOPP (2017)
Trevor Brown, Faith Ellen, Eric Ruppert
A General Technique for Non-blocking Trees. CoRR (2017)
Trevor Brown
B-slack trees: Highly Space Efficient B-trees. CoRR (2017)
Trevor Brown, Faith Ellen, Eric Ruppert
Pragmatic Primitives for Non-blocking Data Structures. CoRR (2017)
Maya Arbel-Raviv, Trevor Brown
Reuse, don't Recycle: Transforming Lock-free Algorithms that Throw Away Descriptors. CoRR (2017)
Trevor Brown
Techniques for Constructing Efficient Lock-free Data Structures. CoRR (2017)
Maya Arbel-Raviv, Trevor Brown
Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors. DISC (2017)
Trevor Brown, Srivatsan Ravi
Cost of Concurrency in Hybrid Transactional Memory. DISC (2017)
Trevor Brown
A Template for Implementing Fast Lock-free Trees Using HTM. CoRR (2017)
Trevor Brown
A Template for Implementing Fast Lock-free Trees Using HTM. PODC (2017)
Trevor Brown, Hillel Avni
PHyTM: Persistent Hybrid Transactional Memory. Proc. VLDB Endow. 10 (4) (2016)
Faith Ellen, Trevor Brown
Concurrent Data Structures. PODC (2016)
Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco
Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. SPAA (2016)
Trevor Brown, Faith Ellen, Eric Ruppert
A general technique for non-blocking trees. PPOPP (2014)
Trevor Brown
B-slack Trees: Space Efficient B-Trees. SWAT (2014)
Trevor Brown, Faith Ellen, Eric Ruppert
Pragmatic primitives for non-blocking data structures. PODC (2013)
Trevor Brown, Hillel Avni
-ary Search Trees. OPODIS (2012)
Trevor Brown, Joanna Helga
Non-blocking k-ary Search Trees. OPODIS (2011)