HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement

Abstract : Asynchronous failure detector-based set agreement algorithms proposed so far assume that all the processes participate in the algorithm. This means that (at least) the processes that do not crash propose a value and consequently execute the algorithm. It follows that these algorithms can block forever (preventing the correct processes from terminating) when there are correct processes that do not participate in the algorithm. This paper investigates the wait-free set agreement problem, i.e., the case where the correct participating processes have to decide a value whatever the behavior of the other processes (i.e., the processes that crash and the processes that are correct but do not participate in the algorithm). The paper presents a wait-free set agreement algorithm. This algorithm is based on a leader failure detector class that takes into account the notion of participating processes. Interestingly, this algorithm enjoys a first class property, namely, design simplicity. \\ Ce rapport propose un détecteur de faute candidat à être le plus faible détecteur de fautes pour résoudre l'accord ensembliste asynchrone et sans attente.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Friday, August 25, 2006 - 2:05:11 PM
Last modification on : Tuesday, June 15, 2021 - 4:13:41 PM
Long-term archiving on: : Monday, April 5, 2010 - 11:16:19 PM


  • HAL Id : inria-00089977, version 1


Michel Raynal, Corentin Travers. In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. [Research Report] PI 1811, 2006, pp.14. ⟨inria-00089977⟩



Record views


Files downloads