research
∙
08/31/2023
The Synchronization Power of Auditable Registers
Auditability allows to track all the read operations performed on a regi...
share
research
∙
08/09/2023
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit
Algorithms to solve fault-tolerant consensus in asynchronous systems oft...
research
∙
08/08/2023
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks
The paper compares two generic techniques for deriving lower bounds and ...
research
∙
08/07/2023
Recoverable and Detectable Self-Implementations of Swap
Recoverable algorithms tolerate failures and recoveries of processes by ...
research
∙
01/31/2023
Topological Characterization of Task Solvability in General Models of Computation
The famous asynchronous computability theorem (ACT) relates the existenc...
research
∙
04/25/2022
NVM-ESR: Using Non-Volatile Memory in Exact State Reconstruction of Preconditioned Conjugate Gradient
HPC systems are a critical resource for scientific research and advanced...
research
∙
02/22/2022
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model
This paper presents fault-tolerant asynchronous Stochastic Gradient Desc...
research
∙
09/05/2021
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing
As the High Performance Computing world moves towards the Exa-Scale era,...
research
∙
06/29/2021
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs
Strong adversaries obtain additional power when a linearizable object is...
research
∙
05/14/2021
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
A key way to construct complex distributed systems is through modular co...
research
∙
12/23/2020
Flat-Combining-Based Persistent Data Structures for Non-Volatile Memory
Flat combining (FC) is a synchronization paradigm in which a single thre...
research
∙
12/20/2020
Optimal Resilience in Systems that Mix Shared Memory and Message Passing
We investigate the minimal number of failures that can partition a syste...
research
∙
11/20/2020
Locally Solvable Tasks and the Limitations of Valency Arguments
An elegant strategy for proving impossibility results in distributed com...
research
∙
03/17/2020
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement
We present an algorithm for implementing a store-collect object in an as...
research
∙
08/08/2019
Privatization-Safe Transactional Memories (Extended Version)
Transactional memory (TM) facilitates the development of concurrent appl...
research
∙
05/31/2019
Tracking in Order to Recover: Recoverable Lock-Free Data Structures
We present the tracking approach for deriving recoverable implementation...
research
∙
05/28/2019
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects
It has been observed that linearizability, the prevalent consistency con...
research
∙
01/12/2018