Sharing memory robustly in message-passing systems
From MaRDI portal
Recommendations
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- scientific article; zbMATH DE number 177544
- Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
Cited in
(68)- Asynchronous bounded lifetime failure detectors
- Practically-self-stabilizing virtual synchrony
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Communication-efficient randomized consensus
- Asynchronous reconfiguration with Byzantine failures
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
- Fragmented objects: boosting concurrency of shared large objects
- On atomic registers and randomized consensus in m\&m systems
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Practically stabilizing SWMR atomic memory in message-passing systems
- The \(k\)-simultaneous consensus problem
- Long-lived RAMBO: trading knowledge for communication
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Automated test case generation for the paxos single-decree protocol using a coloured Petri net model
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Tractable low-delay atomic memory
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- The Iterated Restricted Immediate Snapshot Model
- 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
- Robust simulation of shared memory: 20 years after
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- scientific article; zbMATH DE number 177544 (Why is no real title available?)
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Constructive, Deterministic Implementation of Shared Memory on Meshes
- A simple characterization of asynchronous computations
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- The collective memory of amnesic processes
- Integrated bounds for disintegrated storage
- Task computability in unreliable anonymous networks
- What can be computed in a distributed system?
- A coded shared atomic memory algorithm for message passing architectures
- Passing messages while sharing memory
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Self-stabilizing virtual synchrony
- Computing with faulty shared memory (extended abstract)
- Principles of Distributed Systems
- Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
- Wait-freedom with advice
- Distributed MST for constant diameter graphs
- Wait-free computing
- Brief Announcement: The MBroadcast Abstraction
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
- Asynchronous reconfiguration with Byzantine failures
- A topological view of partitioning arguments: reducing k-set agreement to consensus
- Efficient and robust sharing of memory in message-passing systems (extended abstract)
- On implementing SWMR registers from SWSR registers in systems with Byzantine failures
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- Optimal resilience in systems that mix shared memory and message passing
- The computational power of distributed shared-memory models with bounded-size registers
- The computational power of distributed shared-memory models with bounded-size registers
- Asynchronous wait-free runtime verification and enforcement of linearizability
- Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
- Byzantine-tolerant privacy-preserving atomic register
- Light-weight leases for storage-centric coordination
- Reconfigurable distributed storage for dynamic networks
- 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
This page was built for publication: Sharing memory robustly in message-passing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369859)
