Set Agreement
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
... solve set agreement have also been proposed [27, 43, 51] but we do not know yet what is the minimum knowledge about failures that needs to be abstracted to solve this ...
31
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
... Set agreement has been extensively studied in both synchronous and asyn- chronous ...of set agreement in the context of partially synchronous systems, determining the minimum-sized window of ...
11
The Weakest Failure Detector for Set-Agreement in Message-Passing Networks
... of set-agreement still have to hold, while for the case that only one process is correct, even the liveness properties have to hold, ...therefore agreement could not have been ...
10
Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results
... k-set agreement problem in asynchronous systems prone to process crash ...k-set agreement cannot be solved in these models, the paper has presented recent results when the failure ...
13
K-set agreement bounds in round-based models through combinatorial topology
... dominating set has at most 𝛾 (𝐺) distinct values, at most 𝛾 (𝐺) values are decided, and thus our algo- rithm solves 𝛾 (𝐺)-set ...𝑘-set agreement in one round for 𝑘 < 𝛾 ...
12
A non-topological proof for the impossibility of $k$-set agreement
... Chaudhuri’s conjecture was proved by Borowsky and Gafni [3], Herlihy and Shavit [15] and Saks and Zaharoglou [18]. Indeed, these three papers discovered a strong relationship between distributed computing and topology ...
13
Anonymous obstruction-free (n,k)-set agreement with n−k+1 atomic read/write registers
... k-set agreement algorithm with only (n − k + 1) atomic ...k-set agreement problem that employs (n−k+x) atomic registers (with 1 ≤ x ≤ k < n), as well as a space-optimal solution for the ...
28
Chasing the Weakest Failure Detector for k-Set Agreement in Message-passing Systems
... 1 Introduction The k-set agreement problem This problem is a natural generalization of the consensus problem. It is a coordination problem (also called decision problem) introduced by S. Chaudhuri [10] to ...
16
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems
... k-set agreement boils down to consensus, and it is known that the failure detector denoted Ω is the weakest to solve consensus in asynchronous message-passing systems where t < n/2 ...
14
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems
... (n−1)-set agreement in the asynchronous message-passing model with t = ...1)-set agreement is not the same in the read/write shared memory model (where it is Ω n−1 ) and the send/receive ...
9
Anonymous Obstruction-free $(n,k)$-Set Agreement with $n-k+1$ Atomic Read/Write Registers
... k)-set agreement Obstruction-free consensus An obstruction-free consensus object is a one-shot object that provides each process with a single operation denoted ...
19
The Opinion Number of Set-Agreement
... CNRS and U. of Bordeaux, France travers@labri.fr § Abstract This paper carries on the effort to bridging runtime verification with distributed computabil- ity, studying necessary conditions for monitoring failure prone ...
19
Simultaneous Consensus vs Set Agreement a Message-Passing Sensitive Hierarchy of Agreement Problems
... Σ k captures information on process crashes that is necessary to solve k-set agreement). Last but not least, the paper considers the family of asymmetric {k 1 , ..., k s }-SSA problems, defined by s ...
15
Test&Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability
... The k -set agreement problem has been introduced in 9]. It is a paradigm of coordination problems encoutered in distributed computing, and is dened as follows. Each process is assumed to propose a value. ...
17
Narrowing power vs efficiency in synchronous set agreement
... The paper then shows that the value R t is optimal when, one wants to build, in a synchronous system, an nk] SA object from m`] SA base objects. This optimality result generalizes previous lower bounds proved for ...
16
Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n−k+1 Atomic Read/Write Registers
... University of Neuchâtel, Switzerland Abstract. This paper presents an obstruction-free solution to the (n, k)-set agree- ment problem in an asynchronous anonymous read/write system using solely (n − k + 1) ...
3
Which Broadcast Abstraction Captures k-Set Agreement?
... The correspondence linking k-BO-broadcast and k-set agreement, established in the paper, is depicted in Figure 1. The algorithm building k-SA on top of the k-BO-broadcast is surprisingly simple (which is ...
17
Looking for the Weakest Failure Detector for $k$-Set Agreement in Message-passing Systems: Is $\Pi_k$ the End of the Road?
... 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 ...k-set agreement ...
14
Strongly Terminating Early-Stopping ıt k-Set Agreement in Synchronous Systems with General Omission Failures
... 1 . k -set agreement can trivially be solved in crash-prone asynchronous systems when k > t [7]. A one communication step protocol is as follows: (1) t + 1 processes are arbitrarily selected prior to the ...
26
Modular randomized byzantine k-set agreement in asynchronous message-passing systems
... Roadmap The paper is composed of 5 sections. Section 2 presents the computation model and a basic broadcast abstraction (called ND-broadcast, where ND stand for “No Duplicity”) introduced in [25]. As indicated by its ...
18