Consensus is Easier Than Reliable Broadcast

Abstract : We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More precisely, with finite memory, consensus can be solved with failure detector S , and P − (a variant of the perfect failure detector which is stronger than S ) is necessary and sufficient to solve reliable broadcast and repeated consensus.
Document type :
Other publications
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00325470
Contributor : Carole Delporte-Gallet <>
Submitted on : Monday, September 29, 2008 - 2:33:03 PM
Last modification on : Friday, January 4, 2019 - 5:32:56 PM
Long-term archiving on : Monday, October 8, 2012 - 1:40:56 PM

File

reliable.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00325470, version 1

Collections

Citation

Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, Franck Petit, Sam Toueg. Consensus is Easier Than Reliable Broadcast. 2008. ⟨hal-00325470⟩

Share

Metrics

Record views

536

Files downloads

337