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

Authors:
Cristian Martín;Mikel Larrea
Affiliations:
Ikerlan Research Centre, Arrasate-Mondragón, Spain 20500;The University of the Basque Country, San Sebastián, Spain 20018
Venue:
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Year:
2009

Citing 5
Cited 0

The weakest failure detector for solving consensus

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
On implementing omega with weak reliability and synchrony assumptions

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Eventual Leader Election in the Crash-Recovery Failure Model

PRDC '08 Proceedings of the 2008 14th IEEE Pacific Rim International Symposium on Dependable Computing
Implementing the Omega failure detector in the crash-recovery failure model

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple algorithm that implements the Omega failure detector in the crash-recovery model. The algorithm is quiescent, i.e., eventually all the processes but the leader stop sending messages. It assumes that processes have access to a nondecreasing local clock.