(anti−Ωx × Σz)-based k-set Agreement Algorithms

Abstract : This paper considers the k-set agreement problem in a crash-prone asynchronous message passing system enriched with failure detectors. Two classes of failure detectors have been previously identified as necessary to solve asynchronous k-set agreement: the class anti-leader anti−Ωk and the weak-quorum class Σk. The paper investigates the families of failure detector (anti−Ωx)1xn and (Σz)1zn. It characterizes in an n processes system equipped with failure detectors anti−Ωx and Σz for which values of k, x and z k-set-agreement can be solved. While doing so, the paper (1) disproves previous conjunctures about the weakest failure detector to solve k-set-agreement in the asynchronous message passing model and, (2) introduces the first indulgent algorithm that tolerates a majority of processes failures.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/inria-00519606
Contributor : Zohir Bouzid <>
Submitted on : Monday, September 20, 2010 - 8:47:36 PM
Last modification on : Tuesday, May 14, 2019 - 11:03:44 AM
Long-term archiving on: Tuesday, December 21, 2010 - 3:07:39 AM

Files

SigmaSA-TR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00519606, version 1

Citation

Zohir Bouzid, Corentin Travers. (anti−Ωx × Σz)-based k-set Agreement Algorithms. [Research Report] 2010, pp.19. ⟨inria-00519606⟩

Share

Metrics

Record views

318

Files downloads

413