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

vault backup: 2025-03-08 18:41:57

Browse source
This commit is contained in:
Marco Realacci 2025-03-08 18:41:57 +01:00
parent e0117166f1
commit e93bde0276
1 changed files with 2 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
Concurrent Systems/notes/1b - Peterson algorithm.md
View file

@ -95,7 +95,8 @@ We say that: $p_i$ is at level $h$ when it exits from the $h$-th wait $\to$ a pr
>[!info] What is the `wait` condition actually checking? >[!info] What is the `wait` condition actually checking?
>In the wait condition we check that all other processes are at a lower level. >In the wait condition we check that all other processes are at a lower level.
##### MUTEX proof ##### MUTEX proof
Lemma: for every $ℓ \in \{0,\dots,n-1\}$ , at most n-ℓ processes are at level ℓ, this implies MUTEX by taking ℓ = n-1 >[!def] Lemma
>For every $ℓ \in \{0,\dots,n-1\}$ , at most n-ℓ processes are at level ℓ, this implies MUTEX by taking ℓ = n-1
Proof by induction on ℓ Proof by induction on ℓ