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

Carole Delporte-Gallet (1) , Hugues Fauconnier (1) , Andreas Tielmann (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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”.

Mots clés: failure detecors; set-agreement

Domaines: Informatique

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