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

vault backup: 2025-03-10 17:00:21

Browse source
This commit is contained in:
Marco Realacci 2025-03-10 17:00:21 +01:00
parent 85011b1e0a
commit e614cd197d
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Concurrent Systems/notes/3.md
View file

@ -189,7 +189,7 @@ By contradiction, assume that there is a lock but nobody enters its CS
- if $p_j$ is in the bakery, by assumption `⟨MY_TURN[i] , i⟩ < ⟨MY_TURN[j] , j⟩` since it is the minimum. - if $p_j$ is in the bakery, by assumption `⟨MY_TURN[i] , i⟩ < ⟨MY_TURN[j] , j⟩` since it is the minimum.
#### Bounded bypass proof (bound n-1) #### Bounded bypass proof (bound n-1)
Let $p_i$ and $p_i$ competing for the CS and $p_j$ wins Let $p_i$ and $p_j$ competing for the CS and $p_j$ wins
Then, $p_j$ enters its CS, completes it, unlocks and then invokes lock again Then, $p_j$ enters its CS, completes it, unlocks and then invokes lock again
- If $p_j$ has entered the CS, √ - If $p_j$ has entered the CS, √