Brief announcement: communication-optimal implementation of failure detector class ⋄P

  • Authors:

  • Mikel Larrea;Alberto Lafuente;Joachim Wieland

  • Affiliations:

  • The University of the Basque Country, San Sebastián, Spain;The University of the Basque Country, San Sebastián, Spain;The University of the Basque Country, San Sebastián, Spain

  • Venue:
  • DISC'06 Proceedings of the 20th international conference on Distributed Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.