The Weakest Failure Detector for Set-Agreement in Message-Passing Networks

Abstract : Reaching agreement is one of the most fundamental problems in distributed computing. In the set-agreement problem, n processes try to agree on at most n − 1 different values. This paper determines the weakest failure detector for set-agreement in message-passing networks where processes may fail by crashing. The failure detector is called weak−FS and it returns at every invocation “go” or “wait”. It ensures that (1) there is at least one process where the output is always “wait”, and (2) if there is only one correct process, then the output at this process is eventually “go”.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00260000
Contributor : Carole Delporte-Gallet <>
Submitted on : Sunday, March 2, 2008 - 12:33:55 PM
Last modification on : Friday, January 4, 2019 - 5:32:56 PM
Long-term archiving on : Friday, September 28, 2012 - 10:31:50 AM

File

set-agreement.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00260000, version 1

Collections

Citation

Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann. The Weakest Failure Detector for Set-Agreement in Message-Passing Networks. 2008. ⟨hal-00260000⟩

Share

Metrics

Record views

181

Files downloads

134