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

2
Concurrent Systems/notes/1 - CS Basics.md
View file

@ -100,7 +100,7 @@ Every solution to a problem should satisfy at least:
**Both inclusions are strict:**
$$\text{Deadlock freedom} \not \implies \text{Starvation freedom}$$
![[Pasted image 20250303093116.png]]
![[images/Pasted image 20250303093116.png]]
*p1 is starving!*
$$\text{Starvation freedom} \not \implies \text{Bounded bypass}$$
Assume a $f$ and consider the scheduling above, where p2 wins $f(3)$ times and so does p3, then p1 looses (at least) $2f(3)$ times before winning.