Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: A non-topological proof for
the impossibility of k-set agreement
Hagit Attiya1
and Armando Casta~neda2
1
Department of Computer Science, Technion, Haifa 32000, Israel.
hagit@cs.technion.ac.il
2
IRISA-INRIA, Campus de Beaulieu, 35042 Rennes Cedex, France.
armando.castaneda@inria.fr
Abstract. In the 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 topo-
logical arguments it has been proved that k-set agreement is unsolvable
in the asynchronous 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 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

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences