13 citations · 31 across the 13 of their papers we have counts for
8 papers · 1 filter
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…
B-slack trees: Highly Space Efficient B-trees
Trevor Brown
B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store keys in height , where is the maxim…
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…
Range Queries in Non-blocking -ary Search Trees
Trevor Brown, Hillel Avni
We present a linearizable, non-blocking -ary search tree (-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations…
Reclaiming memory for lock-free data structures: there has to be a better way
Trevor Brown
Memory reclamation for lock-based data structures is typically easy. However, it is a significant challenge for lock-free data structures. Automatic techniques such as garbage coll…