Fault tolerant distributed majority commitment

DOI10.1016/0196-6774(88)90017-XMaRDI QIDQ3813293zbMATH OpenOpenAlexFDO

Authors Shay Kutten, Reuven Bar-Yehuda

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90017-x

zbMATH Keywords

asynchronous communication networkfault-tolerant algorithmFIFOleader electionmessage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Election in asynchronous complete networks with intermittent link failures
• scientific article; zbMATH DE number 4096766
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Leader election in the presence of n-1 initial failures
• Electing a leader in a ring with link failures

Cited in

(8)

• Optimal fault-tolerant distributed construction of a spanning forest
• An efficient fault-tolerant decentralized commit protocol
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• scientific article; zbMATH DE number 4096766 (Why is no real title available?)
• Election in asynchronous complete networks with intermittent link failures
• scientific article; zbMATH DE number 2080904 (Why is no real title available?)
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• New bounds for the controller problem

This page was built for publication: Fault tolerant distributed majority commitment

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