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

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

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

5
.obsidian/workspace.json vendored
View file

@ -88,7 +88,7 @@
"state": { "state": {
"type": "search", "type": "search",
"state": { "state": {
"query": "tag:#𝑆X", "query": "",
"matchingCase": false, "matchingCase": false,
"explainSearch": false, "explainSearch": false,
"collapseAll": false, "collapseAll": false,
@ -109,7 +109,8 @@
"title": "Segnalibri" "title": "Segnalibri"
} }
} }
] ],
"currentTab": 1
} }
], ],
"direction": "horizontal", "direction": "horizontal",

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

@ -68,13 +68,13 @@ 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
- $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 - $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 (can be proved, but it's not covered here)
Guessing the time duration for suspecting a process: Guessing the time duration for suspecting a process:
- SUSPECT[i,j] = #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]`
- Sum them, to obtain Sk - Sum them, to obtain $S_{k}$
- The interval to use in the timers is the minimum Sk - 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$
### From obstruction-freedom to wait-freedom ### From obstruction-freedom to wait-freedom