A Topological Treatment of Early-Deciding Set-Agreement

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus problem.


Published in:
Theoretical Computer Science, 410, 6-7, 570-580
Year:
2009
Keywords:
Laboratories:




 Record created 2008-06-11, last modified 2019-03-24

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)