5 citations · 11 across the 8 of their papers we have counts for
10 papers · 1 filter
Unexpected Scaling in Path Copying Trees
Ilya Kokorin, Alexander Fedorov, Trevor Brown +1
Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructi…
NBR: Neutralization Based Reclamation
Ajay Singh, Trevor Brown, Ali Mashtizadeh
Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms bound unrecl…
On the Cost of Concurrency in Hybrid Transactional Memory
Trevor Brown, Srivatsan Ravi
State-of-the-art \emph{software transactional memory (STM)} implementations achieve good performance by carefully avoiding the overhead of \emph{incremental validation} (i.e., re-r…
Pragmatic Primitives for Non-blocking Data Structures
Trevor Brown, Faith Ellen, Eric Ruppert
We define a new set of primitive operations that greatly simplify the implementation of non-blocking data structures in asynchronous shared-memory systems. The new operations opera…
A General Technique for Non-blocking Trees
Trevor Brown, Faith Ellen, Eric Ruppert
We describe a general technique for obtaining provably correct, non-blocking implementations of a large class of tree data structures where pointers are directed from parents to ch…
Techniques for Constructing Efficient Lock-free Data Structures
Trevor Brown
Building a library of concurrent data structures is an essential way to simplify the difficult task of developing concurrent software. Lock-free data structures, in which processes…