3 citations · 14 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…