Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
From MaRDI portal
Publication:2700388
DOI10.1007/s00453-022-01023-wOpenAlexW2805407707MaRDI QIDQ2700388
Shlomi Dolev, Elad M. Schiller, Thomas Petig
Publication date: 21 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.03498
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A coded shared atomic memory algorithm for message passing architectures
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Distributed computing and networking. 10th international conference, ICDCN 2009, Hyderabad, India, January 3--6, 2009. Proceedings
- On interprocess communication. II: Algorithms
- Highly resilient correctors for polynomials
- Stabilization and pseudo-stabilization
- Practically-self-stabilizing virtual synchrony
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- When consensus meets self-stabilization
- Practically stabilizing SWMR atomic memory in message-passing systems
- Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
- How to share a secret
- RADON: Repairable Atomic Data Object in Networks
- Polynomial Codes Over Certain Finite Fields
- Self-stabilizing systems in spite of distributed control
- Sharing memory robustly in message-passing systems
- Space Bounds for Reliable Storage
- Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
- A Layered Architecture for Erasure-Coded Consistent Distributed Storage
- Fast Access to Distributed Atomic Memory
- Introduction to Coding Theory
- Distributed Computing
This page was built for publication: Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
