Resilient consensus for infinitely many processes. (Extended abstract)

DOI10.1007/B13831MaRDI QIDQ5897396zbMATHOpenAlexFDO

Authors Michael Merritt, Gadi Taubenfeld

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13831

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• On the power of shared object types to implement one-resilient consensus
• N-Consensus is the Second Strongest Object for N + 1 Processes
• On the nonexistence of resilient consensus protocols
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds

Cited in

(8)

• Active disk Paxos with infinitely many processes
• Computing with infinitely many processes
• The impossibility of boosting distributed service resilience
• The computational structure of progress conditions and shared objects
• scientific article; zbMATH DE number 1696673 (Why is no real title available?)
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• Distributed universality
• Contention-sensitive data structures and algorithms

This page was built for publication: Resilient consensus for infinitely many processes. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897396)