vault backup: 2025-03-04 09:04:45

Concurrent Systems/notes/Lezione2.md

@@ -67,4 +67,16 @@ Let $p_i$ invoke lock
 		- let us consider the last of such $p_h \to$ it will eventually win
 	2. In the ∀j.wait FLAG[j] = down
 		- this wait cannot block a process forever
-		- if pj doesn't lock, i
+		- if $pj$ doesn't lock, it flag is down
+		- if $pj$ doesn't find Y at ⊥, it puts its flag down
+		- if pj doesn't find X at j, it puts its flag down, otherwise pj enters its CS and eventually unlocks (flag down)
+	- 3. In the first wait Y = ⊥
+		- since pj read a value different from ⊥, there is at least one pk that wrote Y before (but has not yet unlocked)
+		- if $p_k$ eventually enters its CS -> ok, otherwise it must be blocked forever as well. Where?
+			- ![[Pasted image 20250304090207.png]]
+
+![[Pasted image 20250304090219.png]]
+
+esercizio: prova che NON soddisfa starvation freedom
+
+#### From deadlock freedom to bounded bypass