Resilient consensus for infinitely many processes. (Extended abstract)

DOI10.1007/B13831zbMATH Open1180.68064OpenAlexW4247838468MaRDI QIDQ5897396FDOQ5897396

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Computing with infinitely many processes
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• Title not available (Why is that?)
• The impossibility of boosting distributed service resilience
• Distributed universality
• The computational structure of progress conditions and shared objects
• Active disk Paxos with infinitely many processes
• 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)