From binary consensus to multivalued consensus in asynchronous message-passing systems

DOI10.1016/S0020-0190(00)00027-2zbMath1338.68026OpenAlexW2057077472MaRDI QIDQ294742

Michel Raynal, Frédéric Tronel, Achour Mostefaoui

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000272?np=y

zbMATH Keywords

asynchronous distributed systemsconsensuscrash failurereliable broadcast

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (13)

The \(k\)-simultaneous consensus problem ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ A simple population protocol for fast robust approximate majority ⋮ Extending the wait-free hierarchy to multi-threaded systems ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Agreeing within a few writes ⋮ Consensus in the presence of mortal Byzantine faulty processes ⋮ On the Validity of Consensus ⋮ The weakest failure detector for eventual consistency ⋮ Bounded cost algorithms for multivalued consensus using binary consensus instances ⋮ Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links ⋮ Randomized consensus with regular registers ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Unnamed Item
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Early consensus in an asynchronous system with a weak failure detector

This page was built for publication: From binary consensus to multivalued consensus in asynchronous message-passing systems