A Tight Lower Bound for k-Set Agreement


We prove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of [f/k] + 1 rounds of communication for solutions to k-set agreement that tolerate f failures. This bound is tight, and shows that… (More)
DOI: 10.1109/SFCS.1993.366866


2 Figures and Tables