 |
|
|
|
| HAL: inria-00072062, version 1 |
| See detailed view |  BibTeX,EndNote,... |
|
|
|
|
| Validity Conditions in Agreement Problemsand Time Complexity |
|
|
| Bernadette Charron-BostFabrice Le Fessant 1 |
|
|
| (2002) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | SOR (INRIA Rocquencourt) |
|
|
|
INRIA |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Other |
|
|
| DISTRIBUTED CONSENSUS / SYNCHRONOUS MODEL / NON-BLOCKING ATOMIC COMMITMENT / ERALY-DECIDING ALGORITHM / K-TAG / LOWER-BOUNDS / VALIDITY CONDITIONS / TIME COMPLEXITY |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| inria-00072062, version 1 | |
| http://hal.inria.fr/inria-00072062 | |
| oai:hal.inria.fr:inria-00072062 | |
| From: Rapport De Recherche Inria | |
| Submitted on: Tuesday, 23 May 2006 19:40:38 | |
| Updated on: Thursday, 29 March 2007 10:50:18 | |
