Fault-tolerant wait-free shared objects

DOI10.1145/278298.278305zbMath1065.68503OpenAlexW1995128373MaRDI QIDQ3158512

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, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (14)

On atomic registers and randomized consensus in m\&m systems ⋮ Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ Wait-free regular storage from Byzantine components ⋮ Light-weight leases for storage-centric coordination ⋮ Randomized registers and iterative algorithms ⋮ Active disk Paxos with infinitely many processes ⋮ Tight bounds for shared memory systems accessed by Byzantine processes ⋮ Objects shared by Byzantine processes ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Recoverable mutual exclusion ⋮ Unnamed Item ⋮ Refined quorum systems ⋮ Wait-free Byzantine consensus.

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