Brief announcement: On the meaning of solving a task with a failure detector

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 [8] 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.

Original languageEnglish
Title of host publicationDistributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages145-146
Number of pages2
DOIs
Publication statusPublished - 2 Nov 2011
Externally publishedYes
Event25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy
Duration: 20 Sept 201122 Sept 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6950 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Symposium on Distributed Computing, DISC 2011
Country/TerritoryItaly
CityRome
Period20/09/1122/09/11

Fingerprint

Dive into the research topics of 'Brief announcement: On the meaning of solving a task with a failure detector'. Together they form a unique fingerprint.

Cite this