marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-03-25 16:42:22

Browse source
This commit is contained in:
Marco Realacci 2025-03-25 16:42:22 +01:00
parent df6fd20117
commit 7e6858cd47
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Concurrent Systems/notes/8 - Enhancing Liveness Properties.md
View file

@ -66,7 +66,7 @@ It can be proved that there exists no wait-free implementation of $\Omega$ in an
IDEA: IDEA:
- `PROGRESS[1..n]` is an array of SWMR atomic registers used by proc’s to signal that they’re alive - `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) - 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 - this changes in time, but not forever