25 citations · 60 across the 13 of their papers we have counts for
5 papers · 1 filter
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…
Fast and Fair Randomized Wait-Free Locks
Naama Ben-David, Guy E. Blelloch
We present a randomized approach for wait-free locks with strong bounds on time and fairness in a context in which any process can be arbitrarily delayed. Our approach supports a t…
Space and Time Bounded Multiversion Garbage Collection
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou +3
We present a general technique for garbage collecting old versions for multiversion concurrency control that simultaneously achieves good time and space complexity. Our technique t…
Classifying Trusted Hardware via Unidirectional Communication
Naama Ben-David, Kartik Nayak
It is well known that Byzantine fault tolerant (BFT) consensus cannot be solved in the classic asynchronous message passing model when one-third or more of the processes may be fau…