Early-stopping k-set agreement in synchronous systems prone to any number of process crashes

Abstract

The k-set agreement problem is a generalization of the consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. This paper presents a surprisingly simple protocol that solves the k-set agreement problem in synchronous systems prone to up to t