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

vault backup: 2025-03-25 15:12:04

Browse source
This commit is contained in:
Marco Realacci 2025-03-25 15:12:04 +01:00
parent baab34c50c
commit 2800d6aeb8
2 changed files with 4 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

4
.obsidian/workspace.json vendored
View file

@ -211,14 +211,14 @@
"companion:Toggle completion": false "companion:Toggle completion": false
} }
}, },
"active": "879210c00db77468", "active": "0d64f519fd7f9420",
"lastOpenFiles": [ "lastOpenFiles": [
"Concurrent Systems/slides/class 8.pdf",
"Concurrent Systems/notes/8 - Enhancing Liveness Properties.md", "Concurrent Systems/notes/8 - Enhancing Liveness Properties.md",
"Concurrent Systems/slides/class 7.pdf", "Concurrent Systems/slides/class 7.pdf",
"Concurrent Systems/notes/6a - Alternatives to Atomicity.md", "Concurrent Systems/notes/6a - Alternatives to Atomicity.md",
"Concurrent Systems/notes/7- MUTEX-free concurrency.md", "Concurrent Systems/notes/7- MUTEX-free concurrency.md",
"Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md", "Concurrent Systems/notes/3a - Hardware primitives & Lamport Bakery algorithm.md",
"Concurrent Systems/slides/class 8.pdf",
"Pasted image 20250325090735.png", "Pasted image 20250325090735.png",
"Concurrent Systems/notes/images/Pasted image 20250324091452.png", "Concurrent Systems/notes/images/Pasted image 20250324091452.png",
"Concurrent Systems/notes/6 - Atomicity.md", "Concurrent Systems/notes/6 - Atomicity.md",

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

@ -16,8 +16,7 @@ Can we take the most basic protocol that satisfies the most basic liveness prope
REMARK: the moment in which all variables contain the same leader is unknown REMARK: the moment in which all variables contain the same leader is unknown
#### From obstruction-freedom to non-blocking ### From obstruction-freedom to non-blocking
``` ```
NEED_HELP[1..n] : SWMR atomic R/W boolean registers init at false NEED_HELP[1..n] : SWMR atomic R/W boolean registers init at false
@ -72,7 +71,7 @@ Guessing the time duration for suspecting a process:
- The interval to use in the timers is the minimum Sk - The interval to use in the timers is the minimum Sk
- 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
**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, $suspended_{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}$.