vault backup: 2025-03-25 15:12:04

This commit is contained in:
Marco Realacci 2025-03-25 15:12:04 +01:00
parent baab34c50c
commit 2800d6aeb8
2 changed files with 4 additions and 5 deletions

View file

@ -16,8 +16,7 @@ Can we take the most basic protocol that satisfies the most basic liveness prope
REMARK: the moment in which all variables contain the same leader is unknown
#### From obstruction-freedom to non-blocking
### From obstruction-freedom to non-blocking
```
NEED_HELP[1..n] : SWMR atomic R/W boolean registers init at false
@ -72,7 +71,7 @@ Guessing the time duration for suspecting a process:
- The interval to use in the timers is the minimum Sk
- it can be proved that this eventually becomes ≥ $\nabla$
#### From obstruction-freedom to wait-freedom
### From obstruction-freedom to wait-freedom
**Eventually perfect:** failure detector ♢P provides each process $p_i$ a local variable $suspected_i$ such that
1. *(Eventual completeness)* eventually, $suspended_{i}$ contains all the indexes of crashed processes, for all correct $p_i$
2. (*Eventual accuracy*) eventually, $suspected_{i}$ contains only indexes of crashed processes, for all correct $p_{i}$.