25 citations · 60 across the 13 of their papers we have counts for
16 papers
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…
uBFT: Microsecond-scale BFT using Disaggregated Memory [Extended Version]
Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui +3
We propose uBFT, the first State-Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only replicas to tolerate Byzantine…
Survey of Persistent Memory Correctness Conditions
Naama Ben-David, Michal Friedman, Yuanhao Wei
The study of concurrent persistent programs has seen a surge of activity in recent years due to the introduction of non-volatile random access memories (NVRAM), yielding many model…
Lock-Free Locks Revisited
Naama Ben-David, Guy E. Blelloch, Yuanhao Wei
This paper presents a new and practical approach to lock-free locks based on helping, which allows the user to write code using fine-grained locks, but run it in a lock-free manner…
FliT: A Library for Simple and Efficient Persistent Algorithms
Yuanhao Wei, Naama Ben-David, Michal Friedman +2
Non-volatile random access memory (NVRAM) offers byte-addressable persistence at speeds comparable to DRAM. However, with caches remaining volatile, automatic cache evictions can r…
Frugal Byzantine Computing
M. K. Aguilera, N. Ben-David, R. Guerraoui +3
Traditional techniques for handling Byzantine failures are expensive: digital signatures are too costly, while using replicas is uneconomical ( denotes the maximum numb…