Skip to main content

Brief Announcement: Communication-Optimal Implementation of Failure Detector Class \(\diamond{\mathcal P}\)

  • Conference paper
Distributed Computing (DISC 2006)

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

Included in the following conference series:

Abstract

Several algorithms implementing the failure detector class \(\diamond{\mathcal P}\) have been proposed in the literature. Regarding communication efficiency, a performance parameter based on the number of links that carry messages forever, algorithms using n links have been proposed, being n the number of processes in the system. In this paper, we show that communication-optimal \(\diamond{\mathcal P}\) algorithms, i.e., using only \({\mathcal C}\) links, being \(2 \le {\mathcal C} \le n\) the number of correct processes, can be implemented. The price to pay for obtaining communication optimality is a higher number of messages exchanged when a failure suspicion occurs. However, one of the algorithms we propose shows that this cost can be linear in n.

Research partially supported by the Spanish Research Council (MCyT), under grant TIN2004-07474-C02-02, the Basque Government, under grant S-PE051K06, and the Gipuzkoa Provincial Council, under grant OF-204/2005.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.K., 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. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  4. Larrea, M., Lafuente, A., Wieland, J.: Communication-efficient implementation of \(\diamondsuit{\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/

  5. Larrea, M., Lafuente, A., Wieland, J.: Communication-optimal implementation of failure detector class \(\diamondsuit{\cal P}\). Technical Report EHU-KAT-IK-08-06, The University of the Basque Country (May 2006), Available at: http://www.sc.ehu.es/acwlaalm/

  6. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Larrea, M., Lafuente, A., Wieland, J. (2006). Brief Announcement: Communication-Optimal Implementation of Failure Detector Class \(\diamond{\mathcal P}\) . In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_48

Download citation

  • DOI: https://doi.org/10.1007/11864219_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44624-8

  • Online ISBN: 978-3-540-44627-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics