8 citations · 32 across the 12 of their papers we have counts for
16 papers
Adaptive Snapshots Require Visible Reads
Niv Sulimany, Tomer Cory, Erez Petrank
Snapshots are widely used to record the state of a running execution. Snapshots have been extensively studied in the literature, with the goal of improving performance and extendin…
Skiplists with Foresight: Skipping Cache Misses
Tomer Cory, Niv Sulimany, Erez Petrank
A skiplist is a fundamental data structure widely used in systems and applications for indexing data stores. In this work, we introduce Foresight, a cache-friendly skiplist optimiz…
A Study of Synchronization Methods for Concurrent Size
Hen Kas-Sharir, Gal Sela, Erez Petrank
The size of collections, maps, and data structures in general, constitutes a fundamental property. An implementation of the size method is required in most programming environments…
Concurrent aggregate queries
Gal Sela, Erez Petrank
Concurrent data structures serve as fundamental building blocks for concurrent computing. Many concurrent counterparts have been designed for basic sequential mechanisms; however,…
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…