In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement [chapter]

Michel Raynal, Corentin Travers
2006 Lecture Notes in Computer Science  
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.,
more » ... 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. A la recherche du plus faible détecteur de fautes pour résoudre l'accord ensembliste sans attente Résumé : 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.
doi:10.1007/11945529_2 fatcat:vjdaqloeqjdntnz5k5i7jfbfzy