322 citations · 383 across the 18 of their papers we have counts for
10 papers · 1 filter
Recoverable and Detectable Self-Implementations of Swap
Tomer Lev Lehman, Hagit Attiya, Danny Hendler
Recoverable algorithms tolerate failures and recoveries of processes by using non-volatile memory. Of particular interest are self-implementations of key operations, in which a rec…
Recovery of Distributed Iterative Solvers for Linear Systems Using Non-Volatile RAM
Yehonatan Fridman, Yaniv Snir, Harel Levin +3
HPC systems are a critical resource for scientific research. The increased demand for computational power and memory ushers in the exascale era, in which supercomputers are designe…
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing
Yehonatan Fridman, Yaniv Snir, Matan Rusanovsky +5
As the High Performance Computing world moves towards the Exa-Scale era, huge amounts of data should be analyzed, manipulated and stored. In the traditional storage/memory hierarch…
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…
Upper and Lower Bounds for Deterministic Approximate Objects
Danny Hendler, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step…
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…