vault backup: 2025-03-25 17:02:22
This commit is contained in:
parent
9b6cc48c08
commit
1eef509d01
1 changed files with 1 additions and 1 deletions
|
@ -81,7 +81,7 @@ Guessing the time duration for suspecting a process:
|
||||||
|
|
||||||
### 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
|
**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$
|
1. *(Eventual completeness)* eventually, $suspected_{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}$.
|
2. (*Eventual accuracy*) eventually, $suspected_{i}$ contains only indexes of crashed processes, for all correct $p_{i}$.
|
||||||
|
|
||||||
**Definition:** A failure detector FD1 is **stronger** than a failure detector FD2 if there exists an algorithm that builds FD2 from instances of FD1 and atomic R/W registers.
|
**Definition:** A failure detector FD1 is **stronger** than a failure detector FD2 if there exists an algorithm that builds FD2 from instances of FD1 and atomic R/W registers.
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue