Skip to main content

Communication-Efficient Implementation of Failure Detector Classes \(\diamondsuit\mathcal{Q}\) and \(\diamondsuit\mathcal{P}\)

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

Abstract

Several algorithms implementing failure detector classes \(\diamondsuit\mathcal{Q}\) and \(\diamondsuit\mathcal{P}\) have been proposed in the literature. The algorithm proposed by Chandra and Toueg in [2] uses a heartbeat mechanism and all-to-all communication to detect faulty processes. The algorithms proposed by Aguilera et al. in [1] and by Larrea et al. in [4] use heartbeats too, and rely on a leader-based approach. On the other hand, the algorithm proposed by Larrea et al. in [3] uses a polling —or query/reply— mechanism on a ring arrangement of processes. The leader-based and the ringbased algorithms are more e.cient than the all-to-all algorithm regarding the number of messages exchanged (linear vs. quadratic). Compared to polling, the heartbeat mechanism reduces the number of messages to the half. Therefore, a heartbeat and ring-based algorithm should outperform the former ones.

Research partially supported by the Spanish Research Council (MCyT), under grants TIC2001-1586-C03-01 and TIN2004-07474-C02-02, the Basque Government, under grant S-PE04UN19, and the Gipuzkoa Provincial Council, under grant OF-846/2004.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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)

    Chapter  Google Scholar 

  2. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Larrea, M., Arévalo, S., Fernández, A.: Efficient algorithms to implement un- reliable failure detectors in partially synchronous systems. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 34–49. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Larrea, M., Fernández, A., Arévalo, S.: Eventually consistent failure detectors. Journal of Parallel and Distributed Computing 65(3), 361–373 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Larrea, M., Lafuente, A. (2005). Communication-Efficient Implementation of Failure Detector Classes \(\diamondsuit\mathcal{Q}\) and \(\diamondsuit\mathcal{P}\) . In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_38

Download citation

  • DOI: https://doi.org/10.1007/11561927_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics