Skip to Main content Skip to Navigation

Validity Conditions in Agreement Problemsand Time Complexity

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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:40:38 PM
Last modification on : Thursday, January 20, 2022 - 4:15:44 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:51:19 PM


  • HAL Id : inria-00072062, version 1



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



Les métriques sont temporairement indisponibles