Fault tolerant distributed majority commitment

DOI10.1016/0196-6774(88)90017-XzbMATH Open0662.68036OpenAlexW2007127099MaRDI QIDQ3813293FDOQ3813293

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

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

zbMATH Keywords

leader electionFIFOfault-tolerant algorithmmessage complexityasynchronous communication network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

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

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)