Validity Conditions in Agreement Problemsand Time Complexity - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2002

Validity Conditions in Agreement Problemsand Time Complexity

(1) , (2)
1
2

Abstract

We study the time complexity of different agreement problems in the synchrono- us model with crash failures, by varying their validity condition. We first introduce a continuous class of agreement problems, the k-TAg problems, which includes both the Uniform Consensus and Non-Blocking Atomic Commitment. We then exhibit a general early-deciding algorithm, that we instanciate to solve every problem of this class. The algorithm always achieves the previously established lower-bounds for early-deciding, showing that these lower-bounds are tight.
Fichier principal
Vignette du fichier
RR-4526.pdf (229.27 Ko) Télécharger le fichier

Dates and versions

inria-00072062 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072062 , version 1

Cite

Bernadette Charron-Bost, Fabrice Le Fessant. Validity Conditions in Agreement Problemsand Time Complexity. [Research Report] RR-4526, INRIA. 2002. ⟨inria-00072062⟩
119 View
133 Download

Share

Gmail Facebook Twitter LinkedIn More