IMDEA Networks Institute Publications Repository

Implementing the weakest failure detector for solving the consensus problem

Larrea, Mikel and Fernández Anta, Antonio and Arévalo, Sergio (2013) Implementing the weakest failure detector for solving the consensus problem. [Journal Articles]

[img]
Preview
PDF (Implementing the weakest failure detector for solving the consensus problem) - Published Version
Download (326Kb) | Preview

Abstract

The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, such as the consensus problem. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve the consensus problem, namely the Eventually Strong class (<>S), are presented. While the first algorithm is wait-free, the second algorithm is f-resilient, where f is a known upper bound on the number of faulty processes. Both algorithms guarantee that, eventually, all the correct processes agree permanently on a common correct process, i.e. they also implement a failure detector of the class Omega (Ω). They are also shown to be optimal in terms of the number of communication links used forever. Additionally, a wait-free algorithm that implements a failure detector of the Eventually Perfect class (<>P) is presented. This algorithm is shown to be optimal in terms of the number of bidirectional links used forever.

Item Type: Journal Articles
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Antonio Fernandez
Date Deposited: 10 Sep 2013 11:53
Last Modified: 10 Sep 2013 11:53
URI: http://eprints.networks.imdea.org/id/eprint/567

Actions (login required)

View Item View Item