Simplifying fault-tolerance
From MaRDI portal
Publication:3196621
DOI10.1145/382780.382784zbMath1323.68040MaRDI QIDQ3196621
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
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
Hundreds of impossibility results for distributed computing, Variable-structure coherent systems†, On the impact of link faults on Byzantine agreement, Threshold protocols in survivor set systems, The perfectly synchronized round-based model of distributed computing, Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures, Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound, Renaming in synchronous message passing systems with Byzantine failures