Using asynchrony and zero degradation to speed up indulgent consensus protocols

DOI10.1016/J.JPDC.2008.02.007MaRDI QIDQ436832zbMATHOpenAlexDBLPWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Indulgent algorithms (preliminary version)
• Introduction to Distributed Algorithms
• Semi-passive replication and lazy consensus
• The overhead of consensus failure recovery
• The weakest failure detector for solving consensus
• Unreliable failure detectors for reliable distributed systems

Cited in

(4)

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

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)