6 citations · 22 across the 15 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DC2018★ 1 cited
Space Complexity of Implementing Large Shared Registers
Yuanhao Wei
We prove two new space lower bounds for the problem of implementing a large shared register using smaller physical shared registers. We focus on the case where both the implemented…
cs.DC2018★ 4 cited
Delay-Free Concurrency on Faulty Persistent Memory
Naama Ben-David, Guy E. Blelloch, Michal Friedman +1
Non-volatile memory (NVM) promises persistent main memory that remains correct despite loss of power. This has sparked a line of research into algorithms that can recover from a sy…
cs.DC2018★ 3 cited
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
Naama Ben-David, Guy E. Blelloch, Yihan Sun +1
In this paper we are interested in bounding the number of instructions taken to process transactions. The main result is a multiversion transactional system that supports constant…