Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with consensus
Search options not deleted
user 79284
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. use this tag for consensus kind of problem.
2
votes
Is the consensus number of SetAgree(3, 2) 2 or 1 (proof needed)?
We can prove that 2-set-consensus among 3 processors (noted (3,2)) cannot be used (together with registers) to solve consensus among 2 processors (noted (2,1)) using the Borowsky-Gafni simulation (BG simulation … Therefore, the BG simulation transforms an algorithm A solving consensus among 2 processors using (3,2) into an algorithm B solving consensus among 3 processors using registers only. …
- 166
1
vote
Why is the consensus number for test-and-set, 2?
using 2-processors consensus one obtains an implementation of 3-processors consensus using 2-processors consensus, which is impossible. … Thus test-and-set cannot solve 3-processors consensus. …
- 166
1
vote
a question related to consensus number of a concurrent object
Consensus is unsolvable in an asynchronous shared-memory or message-passing system of n>1 processes out of which at least one can fail. … Otherwise, you could implement consensus for 2 processes, which would contradict the impossibility. …
- 166
1
vote
Guaranteed existence of a blocking set in the accept definition of Stellar
What is guaranteed is that if a quorum of an intact nodes accepts a statement s, then eventually every intact node v will find itself v-blocked by a set of nodes that has accepted s, i.e. "accept s" c …
- 166
1
vote
Where were the ideas of vote, accept and commit phases originally introduced?
This dates back to the Byzantine broadcast algorithm of Bracha:
Bracha, Gabriel. "Asynchronous Byzantine agreement protocols." Information and Computation 75.2 (1987): 130-143.
- 166