Brief Announcement: On the Meaning of Solving a Task with a Failure Detector
- Cite this paper as:
- Delporte-Gallet C., Fauconnier H., Gafni E., Kuznetsov P. (2011) Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg
We amend the framework, of two decades, of failure detectors [3,4] to bring it in line with the modern view of solving a distributed task  that separates processes and threads. While the conventional framework precludes a thread from advancing in the absence of failure detector values to “its” process, we allow live processes to advance the threads of failed processes. This provides for the application of the wealth of simulation techniques [2,6,7] designed for read-write threads and consequently to completely characterize task solvability with failure detectors. When dealing with the extremes, consensus and set-consensus, the former framework sufficed. With the advances in understanding of more nuanced notions like k-set consensus the framework requires amendment.