Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

DOI10.1007/S00446-003-0093-9MaRDI QIDQ5138500zbMATH OpenOpenAlexFDO

Authors Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-003-0093-9

zbMATH Keywords

asynchronous systemconsensusfault-toleranceshared memorysnapshotstep complexity

Mathematics Subject Classification ID

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

Recommendations

• A hierarchy of conditions for consensus solvability
• Synchronous condition-based consensus
• The Synchronous Condition-Based Consensus Hierarchy
• Condition-based consensus in synchronous systems
• Conditions on input vectors for consensus solvability in asynchronous distributed systems

Cites work

• A combinatorial characterization of the distributed 1-solvable tasks
• A hierarchy of conditions for consensus solvability
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots of shared memory
• Atomic snapshots using lattice agreement
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 139792 (Why is no real title available?)
• scientific article; zbMATH DE number 1346488 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 2013822 (Why is no real title available?)
• scientific article; zbMATH DE number 1559574 (Why is no real title available?)
• scientific article; zbMATH DE number 1418337 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Impossibility results in the presence of multiple faulty processes
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Reaching approximate agreement in the presence of faults
• The BG distributed simulation algorithm
• Three-Processor Tasks Are Undecidable
• Unreliable failure detectors for reliable distributed systems

Cited in

(14)

• Necessary and sufficient conditions for broadcast consensus protocols.
• Synchronous condition-based consensus
• A hierarchy of conditions for consensus solvability
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• One-Step Consensus Solvability
• scientific article; zbMATH DE number 2013822 (Why is no real title available?)
• Determining Consensus Numbers
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• The Synchronous Condition-Based Consensus Hierarchy
• The Complexity Gap between Consensus and Safe-Consensus
• Structural Information and Communication Complexity
• Condition-based consensus in synchronous systems
• Using conditions to expedite consensus in synchronous distributed systems
• A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems

This page was built for publication: Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

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