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

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

@ -62,7 +62,7 @@ function withdraw() {
While `read()` and `write()` may be considered as atomic, their sequential composition **is not**.
![[/Concurrent Systems/notes/images/Pasted image 20250303090135.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250303090135.png)
#### Mutual Exclusion (MUTEX)
Ensure that some parts of the code are executed as *atomic*.
@ -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}$$
![[/Concurrent Systems/notes/images/Pasted image 20250303093116.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250303093116.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.