Matches in SemOpenAlex for { <https://semopenalex.org/work/W2397569458> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W2397569458 abstract "The set consensus problem has played an important role in the study of distributed systems for over two decades. Indeed, the search for lower bounds and impossibility results for this problem spawned the topological approach to distributed computing, which has given rise to new techniques in the design and analysis of protocols. The design of efficient solutions to set consensus has also proven to be challenging. In the synchronous crash failure model, the literature contains a sequence of solutions to set consensus, each improving upon the previous ones. This paper presents an unbeatable protocol for nonuniform k-set consensus in the synchronous crash failure model. This is an efficient protocol whose decision times cannot be improved upon. Moreover, the description of our protocol is extremely succinct. Proving unbeatability of this protocol is a nontrivial challenge. We provide two proofs for its unbeatability: one is a subtle constructive combinatorial proof, and the other is a topological proof of a new style. These two proofs provide new insight into the connection between topological reasoning and combinatorial reasoning about protocols, which has long been a subject of interest. In particular, our topological proof reasons in a novel way about subcomplexes of the protocol complex, and sheds light on an open question posed by Guerraoui and Pochon (2009). Finally, using the machinery developed in the design of this unbeatable protocol, we propose a protocol for uniform k-set consensus that beats all known solutions by a large margin." @default.
- W2397569458 created "2016-06-24" @default.
- W2397569458 creator A5005055897 @default.
- W2397569458 creator A5020843617 @default.
- W2397569458 creator A5049856597 @default.
- W2397569458 date "2016-07-25" @default.
- W2397569458 modified "2023-10-02" @default.
- W2397569458 title "Unbeatable Set Consensus via Topological and Combinatorial Reasoning" @default.
- W2397569458 cites W1503184445 @default.
- W2397569458 cites W1892078242 @default.
- W2397569458 cites W1967858331 @default.
- W2397569458 cites W2024491172 @default.
- W2397569458 cites W2024624176 @default.
- W2397569458 cites W2027569465 @default.
- W2397569458 cites W2035362408 @default.
- W2397569458 cites W2049030791 @default.
- W2397569458 cites W2053469355 @default.
- W2397569458 cites W2056910803 @default.
- W2397569458 cites W2058777482 @default.
- W2397569458 cites W2065083916 @default.
- W2397569458 cites W2065110409 @default.
- W2397569458 cites W2066668094 @default.
- W2397569458 cites W2075601083 @default.
- W2397569458 cites W2089025815 @default.
- W2397569458 cites W2090633038 @default.
- W2397569458 cites W2091004544 @default.
- W2397569458 cites W2091732787 @default.
- W2397569458 cites W2092431596 @default.
- W2397569458 cites W2101712143 @default.
- W2397569458 cites W2149907923 @default.
- W2397569458 cites W2150475919 @default.
- W2397569458 cites W2397569458 @default.
- W2397569458 cites W2616454528 @default.
- W2397569458 doi "https://doi.org/10.1145/2933057.2933120" @default.
- W2397569458 hasPublicationYear "2016" @default.
- W2397569458 type Work @default.
- W2397569458 sameAs 2397569458 @default.
- W2397569458 citedByCount "6" @default.
- W2397569458 countsByYear W23975694582016 @default.
- W2397569458 countsByYear W23975694582017 @default.
- W2397569458 countsByYear W23975694582018 @default.
- W2397569458 countsByYear W23975694582019 @default.
- W2397569458 countsByYear W23975694582021 @default.
- W2397569458 countsByYear W23975694582022 @default.
- W2397569458 crossrefType "proceedings-article" @default.
- W2397569458 hasAuthorship W2397569458A5005055897 @default.
- W2397569458 hasAuthorship W2397569458A5020843617 @default.
- W2397569458 hasAuthorship W2397569458A5049856597 @default.
- W2397569458 hasBestOaLocation W23975694582 @default.
- W2397569458 hasConcept C114614502 @default.
- W2397569458 hasConcept C153046414 @default.
- W2397569458 hasConcept C177264268 @default.
- W2397569458 hasConcept C184720557 @default.
- W2397569458 hasConcept C199360897 @default.
- W2397569458 hasConcept C33923547 @default.
- W2397569458 hasConcept C41008148 @default.
- W2397569458 hasConcept C80444323 @default.
- W2397569458 hasConceptScore W2397569458C114614502 @default.
- W2397569458 hasConceptScore W2397569458C153046414 @default.
- W2397569458 hasConceptScore W2397569458C177264268 @default.
- W2397569458 hasConceptScore W2397569458C184720557 @default.
- W2397569458 hasConceptScore W2397569458C199360897 @default.
- W2397569458 hasConceptScore W2397569458C33923547 @default.
- W2397569458 hasConceptScore W2397569458C41008148 @default.
- W2397569458 hasConceptScore W2397569458C80444323 @default.
- W2397569458 hasLocation W23975694581 @default.
- W2397569458 hasLocation W23975694582 @default.
- W2397569458 hasOpenAccess W2397569458 @default.
- W2397569458 hasPrimaryLocation W23975694581 @default.
- W2397569458 hasRelatedWork W1480922982 @default.
- W2397569458 hasRelatedWork W1509467138 @default.
- W2397569458 hasRelatedWork W196405095 @default.
- W2397569458 hasRelatedWork W2068897649 @default.
- W2397569458 hasRelatedWork W2153798176 @default.
- W2397569458 hasRelatedWork W2162881047 @default.
- W2397569458 hasRelatedWork W2355215981 @default.
- W2397569458 hasRelatedWork W2594897463 @default.
- W2397569458 hasRelatedWork W4252539203 @default.
- W2397569458 hasRelatedWork W222603737 @default.
- W2397569458 isParatext "false" @default.
- W2397569458 isRetracted "false" @default.
- W2397569458 magId "2397569458" @default.
- W2397569458 workType "article" @default.