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

vault backup: 2025-03-03 09:32:47

Browse source
This commit is contained in:
Marco Realacci 2025-03-03 09:32:47 +01:00
parent 6c75cd86c1
commit a3df39231a
3 changed files with 9 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Concurrent Systems/notes/Lezione1.md
View file

@ -96,3 +96,9 @@ So safety is necessary for correctness, liveness for meaningfulness.
todo: riscrivere meglio l'ultimo
Both inclusions are strict:
Deadlock freedom $\not{\implies}$ Starvation freedom
![[Pasted image 20250303093116.png]]
Starvation freedom $not \implies$ Bounded bypass
Assume a $f$ and consider the scheduling above, where p2 wins $f(3)$ times and so does p3