Implementing the Omega failure detector in the crash-recovery failure model

Authors:
Cristian Martín;Mikel Larrea;Ernesto Jiménez
Affiliations:
Departamento de Arquitectura y Tecnología de Computadores, Universidad del País Vasco, Paseo Manuel de Lardizabal 1, 20018 San Sebastián, Spain;Departamento de Arquitectura y Tecnología de Computadores, Universidad del País Vasco, Paseo Manuel de Lardizabal 1, 20018 San Sebastián, Spain;Departamento de Arquitectura y Tecnología de Computadores, Universidad Politécnica de Madrid, Ctra Valencia km. 7, 28031 Madrid, Spain
Venue:
Journal of Computer and System Sciences
Year:
2009

Citing 15
Cited 5

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Failure detectors in omission failure environments

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Stable Leader Election

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Consensus in Asynchronous Systems Where Processes Can Crash and Recover

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Optimal Implementation of the Weakest Failure Detector for Solving Consensus

SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
On implementing omega with weak reliability and synchrony assumptions

Proceedings of the twenty-second annual symposium on Principles of distributed computing
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems

IEEE Transactions on Computers
Communication-efficient leader election and consensus with limited link synchrony

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Failure detection and consensus in the crash-recovery model

Distributed Computing
Implementing unreliable failure detectors with unknown membership

Information Processing Letters
Minimal System Conditions to Implement Unreliable Failure Detectors

PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Communication-efficient implementation of failure detector classes ♦;Q and ♦;P

DISC'05 Proceedings of the 19th international conference on Distributed Computing

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
Specifying and implementing an eventual leader service for dynamic systems

International Journal of Web and Grid Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unreliable failure detectors are mechanisms providing information about process failures, that allow to solve several problems in asynchronous systems, e.g., Consensus. A particular failure detector, Omega, provides an eventual leader election functionality. This paper addresses the implementation of Omega in the crash-recovery failure model. We first propose an algorithm assuming that processes are reachable from the correct process that crashes and recovers a minimum number of times. Then, we propose two algorithms which assume only that processes are reachable from some correct process. Besides this, one of the algorithms requires the membership to be known a priori, while the other two do not.