Building and using quorums despite any number of process of crashes

  • Authors:

  • Roy Friedman;Achour Mostefaoui;Michel Raynal

  • Affiliations:

  • Computer Science Department, Technion, Haifa, Israel;IRISA, Université de Rennes 1, Rennes, France;IRISA, Université de Rennes 1, Rennes, France

  • Venue:
  • EDCC'05 Proceedings of the 5th European conference on Dependable Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Failure detectors of the class denoted $\mathcal{P}^t$ eventually suspect all crashed processes in a permanent way (completeness) and ensure that, at any time, no more than n – t – 1 alive processes are falsely suspected (accuracy), n being the total number of processes. This paper first shows that a simple combination of such a failure detector with a two-step communication pattern can provide the processes with an interesting intersection property on sets of values. As an example illustrating the benefit and the property that such a combination can provide when designing protocols, a leader-based consensus protocol whose design relies on its systematic use is presented. Then the paper presents a $\mathcal{P}^t$-based protocol that builds quorums in systems where up to t processes can crash with t n.