Brief Announcement: On the Meaning of Solving a Task with a Failure Detector

  • Carole Delporte-Gallet
  • Hugues Fauconnier
  • Eli Gafni
  • Petr Kuznetsov
Conference paper

DOI: 10.1007/978-3-642-24100-0_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)
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

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Carole Delporte-Gallet
    • 1
  • Hugues Fauconnier
    • 1
  • Eli Gafni
    • 2
  • Petr Kuznetsov
    • 3
  1. 1.University Paris DiderotFrance
  2. 2.Computer Science DepartmentUniversity of CaliforniaLos AngelesUSA
  3. 3.TU Berlin/Deutsche Telekom LaboratoriesBerlinGermany

Personalised recommendations