Using asynchrony and zero degradation to speed up indulgent consensus protocols

DOI10.1016/J.JPDC.2008.02.007zbMath1243.68091DBLPjournals/jpdc/WuCYR08OpenAlexW2093912643WikidataQ60249867 ScholiaQ60249867MaRDI QIDQ436832

Jin Yang, Michel Raynal, Weigang Wu, Jiannong Cao

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.02.007

zbMATH Keywords

fault tolerancedistributed algorithmconsensusasynchronous systemfailure detector

Mathematics Subject Classification ID

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

Related Items (1)

Self-stabilizing indulgent zero-degrading binary consensus

Cites Work

• Unnamed Item
• Unnamed Item
• Semi-passive replication and lazy consensus
• The overhead of consensus failure recovery
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Introduction to Distributed Algorithms
• Indulgent algorithms (preliminary version)

This page was built for publication: Using asynchrony and zero degradation to speed up indulgent consensus protocols