17 citations · 34 across the 8 of their papers we have counts for
11 papers
KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version)
Clément Burgelin, Antoine Murat, Gal Sela +2
Strongly consistent geo-replication often relies on fast paths to reduce latency in the common case of no failures or contention. Existing fast-path schemes, however, are ad hoc an…
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…
Strong Linearizability without Compare&Swap: The Case of Bags
Faith Ellen, Gal Sela
Because strongly-linearizable objects provide stronger guarantees than linearizability, they serve as valuable building blocks for the design of concurrent data structures. Yet, ma…
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 FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems
Naama Ben-David, Gal Sela, Adriana Szekeres
Traditionally, distributed and parallel transactional systems have been studied in isolation, as they targeted different applications and experienced different bottlenecks. However…
Towards a large-area RPWELL detector: design optimization and performance
D. Zavazieva, L. Moleri, A. Jash +3
We present a new design and assembly procedure of a large-area gas-avalanche Resistive-Plate WELL (RPWELL) detector. A prototype was tested in $\mathrm{…
Concurrent Size
Gal Sela, Erez Petrank
The size of a data structure (i.e., the number of elements in it) is a widely used property of a data set. However, for concurrent programs, obtaining a correct size efficiently is…
Distributed Computations in Fully-Defective Networks
Keren Censor-Hillel, Shir Cohen, Ran Gelles +1
We address fully-defective asynchronous networks, in which all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be compl…
Data-Directed Search for New Physics based on Symmetries of the SM
Mattias Birman, Benjamin Nachman, Raphael Sebbah +3
We propose exploiting symmetries (exact or approximate) of the Standard Model (SM) to search for physics Beyond the Standard Model (BSM) using the data-directed paradigm (DDP). Sym…
Durable Queues: The Second Amendment
Gal Sela, Erez Petrank
We consider durable data structures for non-volatile main memory, such as the new Intel Optane memory architecture. Substantial recent work has concentrated on making concurrent da…
Linearizability: A Typo
Gal Sela, Maurice Herlihy, Erez Petrank
Linearizability is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions…