Trevor Brown

According to our database, Trevor Brown authored at least 38 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization.

Ajay Singh, Trevor Alexander Brown, Ali José Mashtizadeh

IEEE Trans. Parallel Distributed Syst., February, 2024

Shared-Memory Synchronization, Second Edition

Michael L. Scott, Trevor Brown

Springer, ISBN: 978-3-031-38683-1, 2024

Are Your Epochs Too Epic? Batch Free Can Be Harmful.

Daewoo Kim, Trevor Brown, Ajay Singh

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Practical Hardware Transactional vEB Trees.

Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023

The Fence Complexity of Persistent Sets.

Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Unexpected Scaling in Path Copying Trees.

Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures.

Ajay Singh, Trevor Brown, Michael Spear

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks.

Rosina Kharal, Trevor Brown

Proceedings of the 36th International Symposium on Distributed Computing, 2022

PREP-UC: A Practical Replicated Persistent Universal Construction.

Gaetano C. Coccimiglio, Trevor Alexander Brown, Srivatsan Ravi

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Elimination (a, b)-trees with fast, durable updates.

Anubhav Srivastava, Trevor Brown

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

PathCAS: an efficient middle ground for concurrent search data structures.

Trevor Brown, William Sigouin, Dan Alistarh

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Performance Anomalies in Concurrent Data Structure Microbenchmarks.

Rosina Kharal, Trevor Brown

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021

NBR: neutralization based reclamation.

Ajay Singh, Trevor Brown, Ali José Mashtizadeh

Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

2020

Analysis and Evaluation of Non-Blocking Interpolation Search Trees.

Aleksandar Prokopec, Trevor Brown, Dan Alistarh

CoRR, 2020

Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.

Dan Alistarh, Trevor Brown, Nandini Singhal

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Non-blocking interpolation search trees with doubly-logarithmic running time.

Trevor Brown, Aleksandar Prokopec, Dan Alistarh

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

2018

Getting to the Root of Concurrent Binary Search Tree Performance.

Maya Arbel-Raviv, Trevor Brown, Adam Morrison

Proceedings of the 2018 USENIX Annual Technical Conference, 2018

Distributionally Linearizable Data Structures.

Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Harnessing epoch-based reclamation for efficient range queries.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.

Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking.

Eran Gilad, Trevor Brown, Mark Oskin, Yoav Etsion

Proceedings of the Euro-Par 2018: Parallel Processing, 2018

2017

Techniques for Constructing Efficient Lock-free Data Structures.

Trevor Alexander Brown

PhD thesis, 2017

Techniques for Constructing Efficient Lock-free Data Structures.

Trevor Brown

CoRR, 2017

Range Queries in Non-blocking k-ary Search Trees.

Trevor Brown, Hillel Avni

CoRR, 2017

B-slack trees: Highly Space Efficient B-trees.

Trevor Brown

CoRR, 2017

Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Cost of Concurrency in Hybrid Transactional Memory.

Trevor Brown, Srivatsan Ravi

Proceedings of the 31st International Symposium on Distributed Computing, 2017

POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors.

Maya Arbel-Raviv, Trevor Brown

Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2017

A Template for Implementing Fast Lock-free Trees Using HTM.

Trevor Brown

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

PHyTM: Persistent Hybrid Transactional Memory.

Trevor Brown, Hillel Avni

Proc. VLDB Endow., 2016

Investigating the Performance of Hardware Transactions on a Multi-Socket Machine.

Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Concurrent Data Structures.

Faith Ellen, Trevor Brown

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way.

Trevor Alexander Brown

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

B-slack Trees: Space Efficient B-Trees.

Trevor Brown

Proceedings of the Algorithm Theory - SWAT 2014, 2014

A general technique for non-blocking trees.

Trevor Brown, Faith Ellen, Eric Ruppert

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

2013

Pragmatic primitives for non-blocking data structures.

Trevor Brown, Faith Ellen, Eric Ruppert

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Range Queries in Non-blocking <i>k</i>-ary Search Trees.

Trevor Brown, Hillel Avni

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

Non-blocking k-ary Search Trees.

Trevor Brown, Joanna Helga

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011