3 citations · 3 across the 4 of their papers we have counts for
10 papers
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…
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
Hagit Attiya, Constantin Enea, Jennifer Welch
A key way to construct complex distributed systems is through modular composition of linearizable concurrent objects. A prominent example is shared registers, which have crash-tole…
Optimal Resilience in Systems that Mix Shared Memory and Message Passing
Hagit Attiya, Sweta Kumari, Noa Schiller
We investigate the minimal number of failures that can partition a system where processes communicate both through shared memory and by message passing. We prove that this number p…
Locally Solvable Tasks and the Limitations of Valency Arguments
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature…
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
Hagit Attiya, Sweta Kumari, Archit Somani +1
We present an algorithm for implementing a store-collect object in an asynchronous crash-prone message-passing dynamic system, where nodes continually enter and leave. The algorith…
Privatization-Safe Transactional Memories (Extended Version)
Artem Khyzha, Hagit Attiya, Alexey Gotsman
Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often wou…