Skip to Main content Skip to Navigation

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 metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Pierre Sens Connect in order to contact the contributor
Submitted on : Thursday, July 2, 2015 - 3:39:55 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 10:24:43 PM


Files produced by the author(s)


  • HAL Id : hal-01151739, version 2


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⟩



Record views


Files downloads