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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Afek, Y., Nir, I.: Failure detectors in loosely named systems. In: PODC, pp. 65–74. ACM Press, New York (2008)
Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91–100. ACM Press, New York (1993)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4) (2010)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 8–21. Springer, Heidelberg (2009)
Gafni, E., Kuznetsov, P.: Turning adversaries into friends: Simplified, made constructive, and extended. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 380–394. Springer, Heidelberg (2010)
Lamport, L.: The Part-Time parliament. ACM Transactions on Computer Systems 16(2), 133–169 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-24100-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-24100-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24099-7
Online ISBN: 978-3-642-24100-0
eBook Packages: Computer ScienceComputer Science (R0)