Fast fault-tolerant agreement algorithms

  • Authors:

  • Carole Delporte-Gallet;Hugues Fauconnier;Stephanie Lorraine Horn;Sam Toueg

  • Affiliations:

  • LIAFA, Université D. Diderot, Paris, Cedex, France;LIAFA, Université D. Diderot, Paris, Cedex, France;University of Toronto, Toronto, ON, Canada;University of Toronto, Toronto, ON, Canada

  • Venue:
  • Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the synchronous round-based model, a process crash is dirty if it occurs exactly while a process is sending messages in a round, and this causes the process to send to some, but not all, of the intended recipients for the given round. Dirty crashes are possible; however, they are unlikely to occur, since the time spent sending messages is usually very small compared to the maximum message delay (i.e., compared to the duration of a round). In this paper, we investigate how fast one can solve some agreement problems, namely consensus and terminating reliable broadcast (TRB), when the number of dirty crashes that occur is small. In particular, we describe some algorithms for the uniform and non-uniform versions of these problems, and provide some matching lower bounds. All our uniform algorithms are strictly better than conventional early-stopping algorithms, in the sense that they never take more rounds to decide or halt, and they take fewer rounds when the number of dirty crashes is small.