The Alpha of Indulgent Consensus

Authors:
Rachid Guerraoui;Michel Raynal
Affiliations:
Distributed Programming Lab., EPFL Lausanne, Switzerland;IRISA, Campus de Beaulieu 35042 Rennes Cedex, France
Venue:
The Computer Journal
Year:
2007

Citing 0
Cited 10

Anti-Ω: the weakest failure detector for set agreement

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model

Information Processing Letters
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
The building blocks of consensus

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Anonymous asynchronous systems: the case of failure detectors

DISC'10 Proceedings of the 24th international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Exploring gafni's reduction land: from Ωko Wait-Free Adaptive (2p - ⌈p/k⌉)-Renaming Via k-Set Agreemen

DISC'06 Proceedings of the 20th international conference on Distributed Computing
From a store-collect object and Ω to efficient asynchronous consensus

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we introduce here, called Alpha, and which precisely captures consensus safety. Implementations of Alpha in shared memory, storage area network, message passing and active disk systems are presented, leading to directly derived consensus algorithms suited to these communication media. The paper also considers the case where the number of processes is unknown and can be arbitrarily large.