vault backup: 2025-03-31 17:19:16
This commit is contained in:
parent
7104a7cca2
commit
03255d0eb1
1 changed files with 2 additions and 1 deletions
|
@ -155,7 +155,8 @@ Every $p_{j}$ that participates in the k-th consensus increases `last_sn_j[i]` b
|
|||
- everything works because of determinism!
|
||||
|
||||
REMARK: bounded wait freedom does not hold:
|
||||
...
|
||||
- if the background process suspends for a long time, when it wakes up it has an unbounded number of agreed lists to locally execute
|
||||
- this may arbitrarily delay an operation issued before the sleep
|
||||
|
||||
### Solution for non-deterministic specifications
|
||||
If the specifications of Z’s operations are non-deterministic, then 𝛿 does not return one single possible pair after one invocation, but a set of possible choices.
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue