A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement
[chapter]
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.,
doi:10.1007/11945529_2
fatcat:vjdaqloeqjdntnz5k5i7jfbfzy