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

vault backup: 2025-03-08 17:51:57

Browse source
This commit is contained in:
Marco Realacci 2025-03-08 17:51:57 +01:00
parent 561e4939e7
commit db7262759e
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

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

@ -101,9 +101,9 @@ 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]]
Starvation freedom $\not \implies$ 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.
*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.
### Atomic R/W registers
We will consider different computational models according to the available level of atomicity of the operations provided.