A Topological Treatment of Early-Deciding Set-Agreement

• Published in: Theoretical Computer Science Journal
• Publication date: 2008

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.

Keywords: k-set-agreement ; Topology ; Time complexity ; Lower bound ; Early decision ; Local decision ; Optimistic algorithm ; Consensus

Reference

• LPD-ARTICLE-2008-013
• doi:10.1016/j.tcs.2008.10.002
• View record in Web of Science

Record created on 2008-06-11, modified on 2012-03-21