Eventual Leader Election in the Crash-Recovery Failure Model

Authors:
Cristian Martín;Mikel Larrea
Affiliations:
-;-
Venue:
PRDC '08 Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing
Year:
2008

Citing 0
Cited 4

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

Information Processing Letters
Brief Announcement: A Simple and Quiescent Omega Algorithm in the Crash-Recovery Model

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Brief announcement: on implementing Omega efficiently in the crash-recovery model

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Communication-efficient leader election in crash-recovery systems

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unreliable failure detectors provide information about process failures. A particular failure detector called Omega has been shown to be the weakest for solving consensus with a majority of correct processes. This work addresses the implementation of Omega in the crash-recovery failure model. Firstly, the definition of Omega is adapted to that model, assuming that processes do not use stable storage. After that, an algorithm implementing Omega under some weak assumptions on communication reliability and synchrony is proposed.