Skip to Main content Skip to Navigation
Reports

A Failure Detector for k-Set Agreement in Asynchronous Dynamic Systems

Abstract : The k-set agreement problem is a generalization of the consensus problem where processes can decide up to k different values. Very few papers have tackled this problem in dynamic networks, and to the best of our knowledge, every algorithm proposed so far for k-set agreement in dynamic networks assumed synchronous communications. Exploiting the formalism of the Time-Varying Graph model, this paper proposes a new failure detector Sigma-bottom-k, based on Sigma-k and Sigma-bottom, for solving k-set agreement in asynchronous dynamic networks. We present two algorithms that implement this new failure detector, making assumptions on the number of process failures and graph connectivity. We also provide an algorithm for solving k-set agreement using Sigma-bottom-z , under an assumption on the relative values of k and z.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01151739
Contributor : Pierre Sens <>
Submitted on : Thursday, July 2, 2015 - 3:39:55 PM
Last modification on : Thursday, March 21, 2019 - 12:59:39 PM
Document(s) archivé(s) le : Tuesday, April 25, 2017 - 10:24:43 PM

File

Main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01151739, version 2

Citation

Denis Jeanneau, Thibault Rieutord, Luciana Arantes, Pierre Sens. A Failure Detector for k-Set Agreement in Asynchronous Dynamic Systems. [Research Report] RR-8727, UPMC Sorbonne Universités/CNRS/Inria - EPI REGAL; INRIA. 2015. ⟨hal-01151739v2⟩

Share

Metrics

Record views

478

Files downloads

198