(anti-Omega^x × Σ_z) based k-set agreement algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

(anti-Omega^x × Σ_z) based k-set agreement algorithms

(1) , (2, 3)
1
2
3

Abstract

This paper considers the k-set agreement problem in a crashprone 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 )1≤x≤n and (Σz )1≤z≤n . 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
8.pdf (236.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00992778 , version 1 (19-05-2014)

Identifiers

Cite

Zohir Bouzid, Corentin Travers. (anti-Omega^x × Σ_z) based k-set agreement algorithms. OPODIS, Dec 2010, Tozeur, Tunisia. pp.189-204, ⟨10.1007/978-3-642-17653-1_16⟩. ⟨hal-00992778⟩
566 View
128 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More