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.
Type de document :
Rapport
[Research Report] RR-4526, INRIA. 2002
Liste complète des métadonnées

https://hal.inria.fr/inria-00072062
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 23 mai 2006 - 19:40:38
Dernière modification le : samedi 17 septembre 2016 - 01:27:41
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:51:19

Fichiers

Identifiants

  • HAL Id : inria-00072062, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

151

Téléchargements de fichiers

78