Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Details Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

2011-03-18

arxiv.org/abs/1103.3671v2

Computer Science

Distributed, Parallel, and Cluster Computing

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185784