Skip to Main content Skip to Navigation
Conference papers

Which Broadcast Abstraction Captures k-Set Agreement?

Abstract : It is well-known that consensus (one-set agreement) and total order broadcast are equivalent in asynchronous systems prone to process crash failures. Considering wait-free systems, this article addresses and answers the following question: which is the communication abstraction that "captures" k-set agreement? To this end, it introduces a new broadcast communication abstraction, called k-BO-Broadcast, which restricts the disagreement on the local deliveries of the messages that have been broadcast (1-BO-Broadcast boils down to total order broadcast). Hence, in this context, k=1 is not a special number, but only the first integer in an increasing integer sequence. This establishes a new "correspondence" between distributed agreement problems and communication abstractions, which enriches our understanding of the relations linking fundamental issues of fault-tolerant distributed computing.
Complete list of metadata
Contributor : Damien Imbs Connect in order to contact the contributor
Submitted on : Monday, May 7, 2018 - 5:56:33 PM
Last modification on : Saturday, August 6, 2022 - 3:51:10 AM
Long-term archiving on: : Monday, September 24, 2018 - 6:58:32 PM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution 4.0 International License



Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Which Broadcast Abstraction Captures k-Set Agreement?. 31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. pp.1-16, ⟨10.4230/LIPIcs.DISC.2017.27⟩. ⟨hal-01787801⟩



Record views


Files downloads