Tight failure detection bounds on atomic object implementations
From MaRDI portal
Recommendations
- Fault-tolerant atomic computations in an object-based distributed system
- An assertional criterion for atomicity
- Safe-errors on SPA protected implementations with the atomicity technique
- Distributed Computing
- The Complexity of Predicting Atomicity Violations
- A challenge for atomicity verification
- A criterion for atomicity revisited
- Beyond atomic registers: Bounded wait-free implementations of nontrivial objects
Cited in
(16)- The cost of graceful degradation for omission failures
- The weakest failure detector for eventual consistency
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Efficient test \& set constructions for faulty shared memory
- A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
- Anonymous asynchronous systems: the case of failure detectors
- Error recovery points management for dynamically identified recoverable atomic actions
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication
- Computing with faulty shared objects
- scientific article; zbMATH DE number 1569121 (Why is no real title available?)
- What can be computed in a distributed system?
- On the road to the weakest failure detector for k-set agreement in message-passing systems
- Wait-freedom with advice
- On set consensus numbers
- The minimum information about failures for solving non-local tasks in message-passing systems
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
This page was built for publication: Tight failure detection bounds on atomic object implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578204)
