Abstract
Several algorithms implementing failure detectors have been proposed in the literature. In particular, we have proposed a family of communication-efficient \(\diamondsuit\mathcal{P}\) algorithms, i.e., algorithms using n links to carry messages forever, being n the number of processes in the system. Moreover, we have recently proposed a \(\diamondsuit\mathcal{P}\) algorithm that uses only \(\mathcal{C}\) links, being \(\mathcal{C}\) the number of correct processes. In this paper, we show that \(\mathcal{C}\) is the minimum number of links required to implement \(\diamondsuit\mathcal{P}\). We also show that, assuming that there is at least one incorrect process, \(\mathcal{C}\) is optimal not only for \(\diamondsuit\mathcal{P}\) but also for \(\diamondsuit\mathcal{S}\) and Ω. We revisit our Reliable Broadcast based communication-optimal \(\diamondsuit\mathcal{P}\) algorithm, and we show that, regarding QoS measures, it performs better than the communication-efficient algorithms.
Research partially supported by the Spanish Research Council, under grants TIN2004-07474-C02-02 and TIN2006-15617-C03-01, the Basque Government, under grant S-PE06IK01, and the Comunidad de Madrid, under grant S-0505/TIC/0285.
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
Preview
Unable to display preview. Download preview PDF.
References
Aguilera, M., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 108–122. Springer, Heidelberg (2001)
Aguilera, M., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing Ω with weak reliability and synchrony assumptions. In: PODC 2003. Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, Boston, Massachusetts, pp. 306–314 (July 2003)
Aguilera, M., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: PODC 2004. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, St. John’s, Newfoundland, Canada, pp. 328–337 (July 2004)
Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685–722 (1996)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Chen, W., Toueg, S., Aguilera, M.K.: On the quality of service of failure detectors. IEEE Transactions on Computers 51(5), 561–580 (2002)
Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)
Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detector to boost obstruction-freedom. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 399–412. Springer, Heidelberg (2006)
Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S.J. (ed.) Distributed Systems, 2nd edn., vol. 5, pp. 97–146. Addison-Wesley, Reading (1993)
Larrea, M., Arévalo, S., Fernández, A.: Efficient algorithms to implement unreliable failure detectors in partially synchronous systems. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 34–48. Springer, Heidelberg (1999)
Larrea, M., Fernández, A., Arévalo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: SRDS 2000. Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, Nurenberg, Germany, pp. 52–59 (October 2000)
Larrea, M., Fernández, A., Arévalo, S.: Eventually consistent failure detectors. Journal of Parallel and Distributed Computing 65(3), 361–373 (2005)
Larrea, M., Lafuente, A.: Brief announcement: Communication-efficient implementation of failure detector classes \(\Diamond{\cal Q}\) and \(\Diamond{\cal P}\). In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 495–496. Springer, Heidelberg (2005)
Larrea, M., Lafuente, A., Wieland, J.: Brief announcement: Communication-optimal implementation of failure detector class \(\Diamond{\cal P}\). In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 569–571. Springer, Heidelberg (2006)
Larrea, M., Lafuente, A., Wieland, J.: Communication-efficient implementation of \(\Diamond{\cal P}\) with reduced detection latency. Technical Report EHU-KAT-IK-02-06, The University of the Basque Country (February 2006), Available at http://www.sc.ehu.es/acwlaalm/
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)
Wu, W., Cao, J., Yang, J., Raynal, M.: A hierarchical consensus protocol for mobile ad hoc networks. In: PDP 2006. Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Montbeliard-Sochaux, France, pp. 64–72. IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larrea, M., Lafuente, A., Soraluze, I., Cortiñas, R., Wieland, J. (2007). On the Implementation of Communication-Optimal Failure Detectors . In: Bondavalli, A., Brasileiro, F., Rajsbaum, S. (eds) Dependable Computing. LADC 2007. Lecture Notes in Computer Science, vol 4746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75294-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75294-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75293-6
Online ISBN: 978-3-540-75294-3
eBook Packages: Computer ScienceComputer Science (R0)