research
∙
11/08/2022
The ERA Theorem for Safe Memory Reclamation
Safe memory reclamation (SMR) schemes for concurrent data structures off...
share
research
∙
10/31/2022
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
Multi-Version Concurrency Control (MVCC) is a common mechanism for achie...
research
∙
09/15/2022
Concurrent Size
The size of a data structure (i.e., the number of elements in it) is a w...
research
∙
08/09/2021
FliT: A Library for Simple and Efficient Persistent Algorithms
Non-volatile random access memory (NVRAM) offers byte-addressable persis...
research
∙
07/29/2021
VBR: Version Based Reclamation
Safe lock-free memory reclamation is a difficult problem. Existing solut...
research
∙
05/18/2021
Durable Queues: The Second Amendment
We consider durable data structures for non-volatile main memory, such a...
research
∙
05/14/2021
Linearizability: a Typo
Linearizability is the de facto consistency condition for concurrent obj...
research
∙
04/06/2020
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey
The recent availability of fast, dense, byte-addressable non-volatile me...
research
∙
09/02/2019
