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

DOI10.1007/s00446-003-0093-9zbMath1448.68151OpenAlexW2070810807MaRDI QIDQ5138500

Matthieu Roy, Michel Raynal, Sergio Rajsbaum, Achour Mostefaoui

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

snapshotfault-toleranceshared memoryconsensusasynchronous systemstep complexity

Mathematics Subject Classification ID

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

Related Items

Synchronous condition-based consensus ⋮ A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems

Cites Work

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Impossibility results in the presence of multiple faulty processes
• A hierarchy of conditions for consensus solvability
• A combinatorial characterization of the distributed 1-solvable tasks
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
• Three-Processor Tasks Are Undecidable
• Atomic snapshots of shared memory
• Unreliable failure detectors for reliable distributed systems
• Atomic Snapshots in O (n log n) Operations
• Atomic snapshots using lattice agreement
• The BG distributed simulation algorithm
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item