Automatically increasing the fault-tolerance of distributed algorithms

DOI10.1016/0196-6774(90)90019-BzbMath0707.68013OpenAlexW1996730563MaRDI QIDQ3489432

Sam Toueg, Gil Neiger

Publication date: 1990

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90019-b

zbMATH Keywords

lower boundsfault-toleranceprotocolscrash failuresarbitrary failuresbenign failuresgeneral omission failures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (17)

On the round complexity of randomized Byzantine agreement ⋮ Common knowledge and consistent simultaneous coordination ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ The perfectly synchronized round-based model of distributed computing ⋮ On the performance of a retransmission-based synchronizer ⋮ Message-optimal protocols for Byzantine Agreement ⋮ The Failure Discovery problem ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Hundreds of impossibility results for distributed computing ⋮ Safety assurance via on-line monitoring ⋮ On the impact of link faults on Byzantine agreement ⋮ Threshold protocols in survivor set systems ⋮ The complexity of almost-optimal simultaneous coordination ⋮ Gossiping by processors prone to omission failures ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Using knowledge to optimally achieve coordination in distributed systems

This page was built for publication: Automatically increasing the fault-tolerance of distributed algorithms