A non-topological proof for the impossibility of $k$-set agreement - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A non-topological proof for the impossibility of $k$-set agreement


In the \emph{$k$-set agreement} task each process proposes a value, and it is required that each correct process has to decide a value which was proposed and at most $k$ distinct values must be decided. Using topological arguments it has been proved that $k$-set agreement is unsolvable in the asynchronous \emph{wait-free} read/write shared memory model, when $k < n$, the number of processes. This paper presents a simple, non-topological impossibility proof of $k$-set agreement. The proof depends on two simple properties of the \emph{immediate snapshot executions}, a subset of all possible executions, and on the well known graph theory result stating that every graph has an even number of vertices with odd degree (the \emph{handshaking lemma}).
Fichier principal
Vignette du fichier
proofSA-5.pdf (192.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00650623 , version 1 (12-12-2011)


  • HAL Id : hal-00650623 , version 1


Attiya Hagit, Armando Castaneda. A non-topological proof for the impossibility of $k$-set agreement. 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Oct 2011, Grenoble, France. ⟨hal-00650623⟩
230 View
201 Download


Gmail Facebook Twitter LinkedIn More