Managed Agreement: Generalizing Two Fundamental Distributed Agreement Problems

Emmanuelle Anceaume 1 Roy Friedman 2 Maria Gradinariu 3
1 CIDER
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
3 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Consensus and Non-Blocking Atomic Commit (NBAC) are two fundamental distributed problems. The specifications of both problems may lead one to think that they are very similar. However, a black-box solution to any of them is not sufficient to solve the other. 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00916769
Contributor : Emmanuelle Anceaume <>
Submitted on : Friday, December 13, 2013 - 8:53:20 AM
Last modification on : Thursday, March 21, 2019 - 2:37:57 PM
Long-term archiving on : Friday, March 14, 2014 - 10:10:09 AM

File

ipl-final-verbose.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00916769, version 1

Citation

Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu. Managed Agreement: Generalizing Two Fundamental Distributed Agreement Problems. Information Processing Letters, Elsevier, 2007, 101 (5), pp.190--198. ⟨hal-00916769⟩

Share

Metrics

Record views

535

Files downloads

207