Simplifying fault-tolerance

DOI10.1145/382780.382784zbMath1323.68040OpenAlexW2094785517MaRDI QIDQ3196621

Gil Neiger, Rida A. Bazzi

Publication date: 30 October 2015

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

Full work available at URL: https://doi.org/10.1145/382780.382784

zbMATH Keywords

translationsfault-tolerancecrash failures

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (8)

The perfectly synchronized round-based model of distributed computing ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Hundreds of impossibility results for distributed computing ⋮ On the impact of link faults on Byzantine agreement ⋮ Threshold protocols in survivor set systems ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Variable-structure coherent systems^† ⋮ Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound

This page was built for publication: Simplifying fault-tolerance