A simple and communication-efficient Omega algorithm in the crash-recovery model

  • Authors:

  • Cristian Martín;Mikel Larrea

  • Affiliations:

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

  • Venue:
  • Information Processing Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.89

Visualization

Abstract

This paper presents a new algorithm implementing the Omega failure detector in the crash-recovery model. Contrary to previously proposed algorithms, this algorithm does not rely on the use of stable storage and is communication-efficient, i.e., eventually only one process (the elected leader) keeps sending messages. The algorithm relies on a nondecreasing local clock associated with each process. Since stable storage is not used to keep the identity of the leader in order to read it upon recovery, unstable processes, i.e., those that crash and recover infinitely often, output a special @? value upon recovery, and then agree with correct processes on the leader after receiving a first message from it.