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

vault backup: 2025-03-10 23:03:12

Browse source
This commit is contained in:
Marco Realacci 2025-03-10 23:03:12 +01:00
parent 3e04af5cc3
commit 67f0545b57
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/3b - Aravind's algorithm and improvements.md
View file

@ -94,7 +94,7 @@ lock(i) :=
- $p_n$ invokes lock alone, completes its CS and its new DATE is n - $p_n$ invokes lock alone, completes its CS and its new DATE is n
- all other $p_i, i \in P$ (with P being the set of all processes) will have `DATE[i] < n`, as their value for DATE is decreased - all other $p_i, i \in P$ (with P being the set of all processes) will have `DATE[i] < n`, as their value for DATE is decreased
- suppose every process invoke lock, then $p_n$ has to wait all other processes to complete their CSs - suppose every process invoke lock, then $p_n$ has to wait all other processes to complete their CSs
- - scenario 1: every process keeps
**Lemma 1:** Suppose we have $n$ processes, then $\not \exists p_{j} : DATE[j]=DATE[i] \forall i \in [0, n]$ (non esistono due processi con lo stesso valore per DATE) **Lemma 1:** Suppose we have $n$ processes, then $\not \exists p_{j} : DATE[j]=DATE[i] \forall i \in [0, n]$ (non esistono due processi con lo stesso valore per DATE)
*Proof:* *Proof:*