1 citations · 1 across the 4 of their papers we have counts for
5 papers
Execution of NVRAM Programs with Persistent Stack
Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler +2
Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits of traditional persistent memory (persistency of data over hardware failures) and D…
Separation and Equivalence results for the Crash-stop and Crash-recovery Shared Memory Models
Ohad Ben-Baruch, Srivatsan Ravi
Linearizability, the traditional correctness condition for concurrent data structures is considered insufficient for the non-volatile shared memory model where processes recover fo…
Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory
Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch +3
Flat combining (FC) is a synchronization paradigm in which a single thread, holding a global lock, collects requests by multiple threads for accessing a concurrent data structure a…
Upper and Lower Bounds on the Space Complexity of Detectable Object
Ohad Ben-Baruch, Danny Hendler, Matan Rusanovsky
The emergence of systems with non-volatile main memory (NVM) increases the interest in the design of \emph{recoverable concurrent objects} that are robust to crash-failures, since…
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou +2
This paper presents the tracking approach for deriving detectably recoverable (and thus also durable) implementations of many widely-used concurrent data structures. Such data stru…