1 citations · 1 across the 2 of their papers we have counts for
5 papers
KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines
Edward Bortnikov, Michael Azran, Asa Bornstein +11
We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advan…
The ERA Theorem for Safe Memory Reclamation
Gali Sheffi, Erez Petrank
Safe memory reclamation (SMR) schemes for concurrent data structures offer trade-offs between three desirable properties: ease of integration, robustness, and applicability. In thi…
EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation
Gali Sheffi, Pedro Ramalhete, Erez Petrank
Multi-Version Concurrency Control (MVCC) is a common mechanism for achieving linearizable range queries in database systems and concurrent data-structures. The core idea is to keep…
VBR: Version Based Reclamation
Gali Sheffi, Maurice Herlihy, Erez Petrank
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods (or their combinations): epoch based reclamation, hazard pointers, and optim…
Efficient Lock-Free Durable Sets
Yoav Zuriel, Michal Friedman, Gali Sheffi +2
Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks fo…