We study distributed algorithms that solve agreement problems, namely, k-set agreement.
Their purpose is to compute and irrevocably set the output yp of process p to some decision …

In the k-set agreement problem, each process (in a set of n processes) proposes a value
and has to decide a proposed value in such a way that at most k different values are …

In the traditional consensus task, processes are required to agree on a common value
chosen among the initial values of the participating processes. It is well known that …

This paper considers the k-set agreement problem in a crash-prone asynchronous message
passing system enriched with failure detectors. Two classes of failure detectors have been …

The objective of this paper is to understand the effect of partitioning in distributed computing
models. In spite of being quite similar agreement problems,(deterministic) consensus (1-set …

This paper continues our quest for the weakest failure detector which allows the k-set
agreement problem to be solved in asynchronous message-passing systems prone to …

The failure detector abstraction has been used to solve agreement problems in
asynchronous systems prone to crash failures, but so far it has mostly been used in static …

This paper investigates the relation linking the s-simultaneous consensus problem and the k-
set agreement problem in wait-free message-passing systems. To this end, it first defines the …

In the k-set agreement problem, each process proposes a value and has to decide a value
in such a way that a decided value is a proposed value and at most k different values are …

This paper presents two weak partially synchronous system models M anti (nk) and M sink
(nk), which are just strong enough for solving k-set agreement: We introduce the generalized …