Skip to Main content Skip to Navigation
Conference papers

K-set agreement bounds in round-based models through combinatorial topology

Abstract : Round-based models are the main message-passing models; combinatorial topology applied to distributed computing provide sweeping results like general lower bounds. We combine both to study the computability of k set-agreement. Among all the possible round-based models, we consider oblivious ones, where the constraints are given only round per round by a set of allowed graphs. And among oblivious models, we focus on closed-above ones, that is models where the set of possible graphs is a union of above-closure of graphs. These capture intuitively the underlying structure required by some communication model, like containing a ring. We then derive lower bounds and upper bounds in one round for k set-agreement, such that these bounds are proved using combinatorial topology but stated only in terms of graph properties. These bounds extend to multiple rounds when limiting our algorithms to oblivious ones, that is ones that recall only pairs of process and initial value.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, September 28, 2020 - 11:37:33 AM
Last modification on : Thursday, June 10, 2021 - 3:07:37 AM
Long-term archiving on: : Thursday, December 3, 2020 - 7:38:49 PM


Files produced by the author(s)


  • HAL Id : hal-02950742, version 1
  • OATAO : 26404


Adam Shimi, Armando Castañeda. K-set agreement bounds in round-based models through combinatorial topology. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020), Aug 2020, Salerno, Italy. pp.395-404. ⟨hal-02950742⟩



Record views


Files downloads