A Topological Treatment of Early-Deciding Set-Agreement

Guerraoui, RachidHerlihy, MauricePochon, Bastian2008-06-112008-06-112008-06-11200910.1016/j.tcs.2008.10.002https://infoscience.epfl.ch/handle/20.500.14299/26253WOS:000263635200009The 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.k-set-agreementTopologyTime complexityLower boundEarly decisionLocal decisionOptimistic algorithmConsensusA Topological Treatment of Early-Deciding Set-Agreementtext::journal::journal article::research article