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

vault backup: 2025-04-04 23:35:23

Browse source
This commit is contained in:
Marco Realacci 2025-04-04 23:35:23 +02:00
parent 96872ffa06
commit 6a9cf80167
13 changed files with 28 additions and 28 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?
![[Pasted image 20250304084537.png]]
![[images/Pasted image 20250304084537.png]]
![[Pasted image 20250304084901.png]]
![[images/Pasted image 20250304084901.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
![[Pasted image 20250304090219.png]]
![[images/Pasted image 20250304090219.png]]
esercizio: prova che NON soddisfa starvation freedom