Abstract
Eventual failure detectors, such as Ω or \(\Diamond\)P, can make arbitrarily many mistakes before they start providing correct information. This paper shows that any detector implementable in a purely asynchronous system can be implemented as a function of only the order of most-recently heard-from processes. The finiteness of this representation means that eventual failure detectors can be enumerated and their relative strengths tested automatically. The results for systems with two and three processes are presented.
Implementability can also be modelled as a game between Prover and Disprover. This approach not only speeds up automatic implementability testing, but also results in shorter and more intuitive proofs. I use this technique to identify the new weakest failure detector anti-Ω and prove its properties. Anti-Ω outputs process ids and, while not necessarily stabilizing, it ensures that some correct process is eventually never output.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K., Chen, W., Toueg, S.: Heartbeat: A timeout-free failure detector for quiescent reliable communication. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol. 1320, pp. 126–140. Springer, Heidelberg (1997)
Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, the Netherlands (September 1994)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving Consensus. Journal of the ACM 43(4), 685–722 (1996)
Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: 23rd PODC, St. John’s, Newfoundland, Canada, pp. 338–346 (2004)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed Consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)
Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 289–298. ACM Press, New York (2000)
Guerraoui, R., Kouznetsov, P.: Finally the weakest failure detector for Non-Blocking Atomic Commit. Technical Report LPD-2003-005, EPFL, Lausanne, Switzerland (December 2003)
Guerraoui, R., Hurfin, M., Mostéfaoui, A., Oliveira, R., Raynal, M., Schiper, A.: Consensus in asynchronous distributed systems: A concise guided tour. In: Krakowiak, S., Shrivastava, S.K. (eds.) Advances in Distributed Systems. LNCS, vol. 1752, pp. 33–47. Springer, Heidelberg (2000)
Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. In: 26th PODC, Portland, OR, US (August 2007)
Hadzilacos, V., Toueg, S.: Fault-tolerant broadcast and related problems. In: Mullender, S. (ed.) Distributed Systems, 2nd edn., vol. 5, pp. 97–146. ACM Press, New York (1993)
Raynal, M.: A short introduction to failure detectors for asynchronous distributed systems. ACM SIGACT News 35(1), 53–70 (2005)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)
Zieliński, P.: Anti-Ω: the weakest failure detector for set agreement. Technical Report UCAM-CL-TR-694, Computer Laboratory, University of Cambridge (July 2007)
Zieliński, P.: Automatic classification of eventual failure detectors. Technical Report UCAM-CL-TR-693, Computer Laboratory, University of Cambridge (July 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zieliński, P. (2007). Automatic Classification of Eventual Failure Detectors. In: Pelc, A. (eds) Distributed Computing. DISC 2007. Lecture Notes in Computer Science, vol 4731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75142-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-75142-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75141-0
Online ISBN: 978-3-540-75142-7
eBook Packages: Computer ScienceComputer Science (R0)