Which Broadcast Abstraction Captures k-Set Agreement? - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Which Broadcast Abstraction Captures k-Set Agreement?


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.
Fichier principal
Vignette du fichier
LIPIcs-DISC-2017-27.pdf (605.49 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01787801 , version 1 (07-05-2018)





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⟩
495 View
47 Download



Gmail Facebook Twitter LinkedIn More