Computing with faulty shared objects
From MaRDI portal
Recommendations
Cited in
(22)- The cost of graceful degradation for omission failures
- Recovering distributed objects
- The power of multiobjects.
- Randomized registers and iterative algorithms
- Active disk Paxos with infinitely many processes
- Tight bounds for shared memory systems accessed by Byzantine processes
- Recoverable mutual exclusion
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Efficient test \& set constructions for faulty shared memory
- Fault-tolerant wait-free shared objects
- The RedBlue Adaptive Universal Constructions
- On the power of breakable objects
- Introduction à l'algorithmique des objets partagés
- Distributed universal constructions: a guided tour
- Objects shared by Byzantine processes
- Hundreds of impossibility results for distributed computing
- Randomized protocols for asynchronous consensus
- Computing with faulty shared memory (extended abstract)
- An algorithm for replicated objects with efficient reads (extended abstract)
- Self-stabilization of wait-free shared memory objects
- Recovering shared objects without stable storage
- Fault-tolerant atomic computations in an object-based distributed system
This page was built for publication: Computing with faulty shared objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369897)