vault backup: 2025-03-25 16:42:22
This commit is contained in:
parent
df6fd20117
commit
7e6858cd47
1 changed files with 1 additions and 1 deletions
|
@ -66,7 +66,7 @@ It can be proved that there exists no wait-free implementation of $\Omega$ in an
|
|||
|
||||
IDEA:
|
||||
- `PROGRESS[1..n]` is an array of SWMR atomic registers used by proc’s to signal that they’re alive
|
||||
- pi suspects pj if pi doesn’t see any progress of pj after a proper time interval (to be guessed) set in its timer
|
||||
- $p_{i}$ suspects $p_j$ if pi doesn’t see any progress of $p_{j}$ after a proper time interval (to be guessed) set in its timer
|
||||
- the leader is the least suspected process, or the one with smallest/biggest ID among the least suspected ones (if there are more than one)
|
||||
- this changes in time, but not forever
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue