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
. 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
-set consensus the framework requires amendment.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten