Managed Agreement: Generalizing two fundamental distributed agreement problems

Authors:
Emmanuelle Anceaume;Roy Friedman;Maria Gradinariu
Affiliations:
IRISA, Rennes, France;Computer Science Department, The Technion, Haifa, Israel;LIP6, Université Paris 6, France
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 0

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Impossibility of distributed consensus with one faulty process

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)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
On the Relationship Between the Atomic Commitment and Consensus Problems

Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Non-blocking atomic commit in asynchronous distributed systems with failure detectors

Distributed Computing
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast non-blocking atomic commit: an inherent trade-off

Information Processing Letters
The notion of veto number for distributed agreement problems

IWDC'04 Proceedings of the 6th international conference on Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents a family of agreement problems called Managed Agreement, which is parameterized by the number of aristocrat nodes in the system; NBAC is a special case of this family when all nodes are aristocrats while Consensus is a special case of this family when there are no aristocrats. The paper also presents a parameterized family of failure detectors F(A) such that F(A) is the weakest failure detector class that enables solving Managed Agreement with a set A of aristocrats in an asynchronous environment.