Sharing memory robustly in message-passing systems
From MaRDI portal
Publication:4369859
DOI10.1145/200836.200869zbMath0886.68018OpenAlexW2065180040WikidataQ29042067 ScholiaQ29042067MaRDI QIDQ4369859
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/200836.200869
Related Items
On atomic registers and randomized consensus in m\&m systems ⋮ Unnamed Item ⋮ Practically-self-stabilizing virtual synchrony ⋮ The \(k\)-simultaneous consensus problem ⋮ Long-lived RAMBO: trading knowledge for communication ⋮ Light-weight leases for storage-centric coordination ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Tractable low-delay atomic memory ⋮ Store-collect in the presence of continuous churn with application to snapshots and lattice agreement ⋮ The weakest failure detector to implement a register in asynchronous systems with hybrid communication ⋮ Wait-free computing ⋮ Automated test case generation for the paxos single-decree protocol using a coloured Petri net model ⋮ Reconfigurable distributed storage for dynamic networks ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Brief Announcement: The MBroadcast Abstraction ⋮ Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds ⋮ \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems ⋮ GeoQuorums: implementing atomic memory in mobile ad hoc networks ⋮ Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ The Weakest Failure Detector for Message Passing Set-Agreement ⋮ Optimistic Erasure-Coded Distributed Storage ⋮ On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory ⋮ A simple characterization of asynchronous computations ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ A coded shared atomic memory algorithm for message passing architectures ⋮ What Can be Computed in a Distributed System? ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Refined quorum systems ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Self-stabilizing Virtual Synchrony ⋮ Wait-freedom with advice ⋮ Distributed MST for constant diameter graphs ⋮ Communication-efficient randomized consensus ⋮ Asynchronous bounded lifetime failure detectors ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ Asynchronous reconfiguration with Byzantine failures ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems ⋮ Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps ⋮ Fragmented objects: boosting concurrency of shared large objects
