Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus

DOI10.1137/S0097539798344367zbMath1087.68124OpenAlexW1980364588MaRDI QIDQ4651538

Vassos Hadzilacos, Sam Toueg, Prasad Jayanti, Tushar Deepak Chandra

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539798344367

zbMATH Keywords

consensusimpossibility resultsfault tolerant algorithmswait-free algorithmsasynchronous distributed computation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (4)

Failure detectors as type boosters ⋮ The disagreement power of an adversary ⋮ The impossibility of boosting distributed service resilience ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations

This page was built for publication: Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus