Fault-tolerant wait-free shared objects

DOI10.1145/278298.278305MaRDI QIDQ3158512zbMATH OpenOpenAlexFDO

Authors Prasad Jayanti, Sam Toueg, Tushar Deepak Chandra

Publication date 25 January 2005

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/7222

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Computing with faulty shared objects
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• The cost of graceful degradation for omission failures
• Self-stabilization of wait-free shared memory objects
• Robust wait-free hierarchies

Cited in

(26)

• The cost of graceful degradation for omission failures
• Wait-free Byzantine consensus.
• 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
• On atomic registers and randomized consensus in m\&m systems
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Efficient test \& set constructions for faulty shared memory
• Timeliness-based wait-freedom, a gracefully degrading progress condition
• Computing with faulty shared objects
• Robust wait-free hierarchies
• Integrated bounds for disintegrated storage
• Progress under bounded fairness
• Objects shared by Byzantine processes
• Hundreds of impossibility results for distributed computing
• Randomized protocols for asynchronous consensus
• An algorithm for replicated objects with efficient reads (extended abstract)
• Abortable and query-abortable objects and their efficient implementation
• Self-stabilization of wait-free shared memory objects
• Recovering shared objects without stable storage
• Self-stabilization of wait-free shared memory objects
• Wait-free regular storage from Byzantine components
• Light-weight leases for storage-centric coordination
• Adaptive progress: a gracefully-degrading liveness property
• Refined quorum systems

This page was built for publication: Fault-tolerant wait-free shared objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158512)