Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2010

Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound

Résumé

The k-set agreement problem is a generalization of the uniform consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and at most k different values are decided. It has been shown that any algorithm that solves the k-set agreement problem in synchronous systems that can suffer up to t crash failures requires t/k+1 rounds in the worst case. It has also been shown that it is possible to design early deciding algorithms where no process decides and halts after min(f/k+2, t/k+1) rounds, where f is the number of actual crashes in a run (f

Dates et versions

hal-00543282 , version 1 (06-12-2010)

Identifiants

Citer

Achour Mostefaoui, Michel Raynal, Corentin Travers. Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Theoretical Computer Science, 2010, 411 (1), pp.58-69. ⟨10.1016/j.tcs.2009.09.002⟩. ⟨hal-00543282⟩
170 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More