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

vault backup: 2025-04-04 23:58:09

Browse source
This commit is contained in:
Marco Realacci 2025-04-04 23:58:09 +02:00
parent 8e517b1bd4
commit 1ce5aec8cd
13 changed files with 34 additions and 50 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Concurrent Systems/notes/2 - Fast mutex by Lamport.md
View file

@ -49,9 +49,9 @@ unlock(i) :=
##### MUTEX proof
How can pi enter its CS?
![[/Concurrent Systems/notes/images/Pasted image 20250304084537.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250304084537.png)
![[/Concurrent Systems/notes/images/Pasted image 20250304084901.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250304084901.png)
(*must finished before nel senso che $p_i$ deve aspettare $p_j$*)
##### Deadlock freedom
Let $p_i$ invoke lock
@ -72,6 +72,6 @@ Let $p_i$ invoke lock
- In the second wait Y = ⊥: but then there exists a $p_h$ that eventually enters its CS -> good
- In the ∀j.wait FLAG[j]=down: this wait cannot block a process forever
![[/Concurrent Systems/notes/images/Pasted image 20250304090219.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250304090219.png)
esercizio: prova che NON soddisfa starvation freedom