Using asynchrony and zero degradation to speed up indulgent consensus protocols

DOI10.1016/J.JPDC.2008.02.007zbMATH Open1243.68091DBLPjournals/jpdc/WuCYR08OpenAlexW2093912643WikidataQ60249867 ScholiaQ60249867MaRDI QIDQ436832FDOQ436832

Authors: Weigang Wu, Jiannong Cao, Jin Yang, Michel Raynal 

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

Recommendations

• A simple and fast asynchronous consensus protocol based on a weak failure detector
• A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
• Asynchronous byzantine agreement protocols
• On the Message Complexity of Indulgent Consensus
• Timeliness, failure-detectors, and consensus performance

zbMATH Keywords

consensusdistributed algorithmfault toleranceasynchronous systemfailure detector

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On the price of concurrency in group ratcheting protocols
• Optimistically tuning synchronous Byzantine consensus: another win for null messages
• Self-stabilizing indulgent zero-degrading binary consensus
• Space-efficient asynchronous consensus without shared memory initialization

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

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