(anti−Ωx × Σz)-based k-set Agreement Algorithms - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2010

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

(1) , (2)
1
2
Zohir Bouzid
  • Function : Author
  • PersonId : 860591

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.
Fichier principal
Vignette du fichier
SigmaSA-TR.pdf (279.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00519606 , version 1 (20-09-2010)

Identifiers

  • HAL Id : inria-00519606 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More