Matches in SemOpenAlex for { <https://semopenalex.org/work/W4296285616> ?p ?o ?g. }
Showing items 1 to 35 of
35
with 100 items per page.
- W4296285616 abstract "Despite of being quite similar agreement problems, consensus and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than relatively simple bivalence arguments as in the impossibility proof for consensus (= 1-set agreement) in the presence of a single crash failure, known proofs for the impossibility of k-set agreement in systems with at least k>1 crash failures use algebraic topology or a variant of Sperner's Lemma. In this paper, we present a generic theorem for proving the impossibility of k-set agreement in various message passing settings, which is based on a simple reduction to the consensus impossibility in a certain subsystem. We demonstrate the broad applicability of our result by exploring the possibility/impossibility border of k-set agreement in several message-passing system models: (i) asynchronous systems with crash failures, (ii) partially synchronous processes with (initial) crash failures, and (iii) asynchronous systems augmented with failure detectors. In (i) and (ii), the impossibility part is just an instantiation of our main theorem, whereas the possibility of achieving k-set agreement in (ii) follows by generalizing the consensus algorithm for initial crashes by Fisher, Lynch and Patterson. In (iii), applying our technique yields the exact border for the parameter k where k-set agreement is solvable with the failure detector class (Sigma_k,Omega_k), for (1<= k<= n-1), of Bonnet and Raynal. Considering that Sigma_k was shown to be necessary for solving k-set agreement, this result yields new insights on the quest for the weakest failure detector." @default.
- W4296285616 created "2022-09-19" @default.
- W4296285616 creator A5006249454 @default.
- W4296285616 creator A5047184088 @default.
- W4296285616 creator A5050189962 @default.
- W4296285616 date "2011-03-18" @default.
- W4296285616 modified "2023-09-29" @default.
- W4296285616 title "Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems" @default.
- W4296285616 doi "https://doi.org/10.48550/arxiv.1103.3671" @default.
- W4296285616 hasPublicationYear "2011" @default.
- W4296285616 type Work @default.
- W4296285616 citedByCount "0" @default.
- W4296285616 crossrefType "posted-content" @default.
- W4296285616 hasAuthorship W4296285616A5006249454 @default.
- W4296285616 hasAuthorship W4296285616A5047184088 @default.
- W4296285616 hasAuthorship W4296285616A5050189962 @default.
- W4296285616 hasBestOaLocation W42962856161 @default.
- W4296285616 hasLocation W42962856161 @default.
- W4296285616 hasLocation W42962856162 @default.
- W4296285616 hasLocation W42962856163 @default.
- W4296285616 hasOpenAccess W4296285616 @default.
- W4296285616 hasPrimaryLocation W42962856161 @default.
- W4296285616 hasRelatedWork W1553085581 @default.
- W4296285616 hasRelatedWork W2037891597 @default.
- W4296285616 hasRelatedWork W2111129657 @default.
- W4296285616 hasRelatedWork W2116232297 @default.
- W4296285616 hasRelatedWork W2148436660 @default.
- W4296285616 hasRelatedWork W2148488729 @default.
- W4296285616 hasRelatedWork W2181270995 @default.
- W4296285616 hasRelatedWork W2950925847 @default.
- W4296285616 hasRelatedWork W3092946270 @default.
- W4296285616 hasRelatedWork W3155124353 @default.
- W4296285616 isParatext "false" @default.
- W4296285616 isRetracted "false" @default.
- W4296285616 workType "article" @default.