research
∙
09/11/2023
The Fence Complexity of Persistent Sets
We study the psync complexity of concurrent sets in the non-volatile sha...
share
research
∙
02/25/2023
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures
Safe memory reclamation (SMR) algorithms are crucial for preventing use-...
research
∙
12/19/2022
PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures
To maximize the performance of concurrent data structures, researchers h...
research
∙
12/01/2022
Unexpected Scaling in Path Copying Trees
Although a wide variety of handcrafted concurrent data structures have b...
research
∙
08/17/2022
Performance Anomalies in Concurrent Data Structure Microbenchmarks
Recent decades have witnessed a surge in the development of concurrent d...
research
∙
12/31/2021
Elimination (a,b)-trees with fast, durable updates
Many concurrent dictionary implementations are designed and optimized fo...
research
∙
12/29/2020
NBR: Neutralization Based Reclamation
Safe memory reclamation (SMR) algorithms suffer from a trade-off between...
research
∙
01/02/2020
Analysis and Evaluation of Non-Blocking Interpolation Search Trees
We start by summarizing the recently proposed implementation of the firs...
research
∙
07/05/2019
On the Cost of Concurrency in Hybrid Transactional Memory
State-of-the-art software transactional memory (STM) implementations ach...
research
∙
08/13/2018
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
There has been significant progress in understanding the parallelism inh...
research
∙
04/03/2018
Distributionally Linearizable Data Structures
Relaxed concurrent data structures have become increasingly popular, due...
research
∙
12/18/2017
Pragmatic Primitives for Non-blocking Data Structures
We define a new set of primitive operations that greatly simplify the im...
research
∙
12/18/2017
A General Technique for Non-blocking Trees
We describe a general technique for obtaining provably correct, non-bloc...
research
∙
12/14/2017
Techniques for Constructing Efficient Lock-free Data Structures
Building a library of concurrent data structures is an essential way to ...
research
∙
12/14/2017
Range Queries in Non-blocking k-ary Search Trees
We present a linearizable, non-blocking k-ary search tree (k-ST) that su...
research
∙
12/13/2017
B-slack trees: Highly Space Efficient B-trees
B-slack trees, a subclass of B-trees that have substantially better wors...
research
∙
12/04/2017
