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

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

Browse source
This commit is contained in:
Marco Realacci 2025-03-25 16:52:22 +01:00
parent fe69fd0e30
commit 2532a362f8
1 changed files with 2 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -73,6 +73,8 @@ IDEA:
Guessing the time duration for suspecting a process: Guessing the time duration for suspecting a process:
- `SUSPECT[i,j]` = # of times pi has suspected pj - `SUSPECT[i,j]` = # of times pi has suspected pj
- For all k, take the t+1 minimum values in `SUSPECT[1..n , k]` - For all k, take the t+1 minimum values in `SUSPECT[1..n , k]`
- remember: t is the max number of processes that can fail (it is known)
- so doing this we ensure considering at least a process that doesn't fail
- Sum them, to obtain $S_{k}$ - Sum them, to obtain $S_{k}$
- The interval to use in the timers is the minimum $S_{k}$ - The interval to use in the timers is the minimum $S_{k}$
- it can be proved that this eventually becomes ≥ $\nabla$ - it can be proved that this eventually becomes ≥ $\nabla$