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

vault backup: 2025-03-19 22:01:46

Browse source
This commit is contained in:
Marco Realacci 2025-03-19 22:01:46 +01:00
parent 40e8408656
commit 03c186157e
1 changed files with 1 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

1
Concurrent Systems/notes/2b - Round Robin algorithm.md
View file

@ -24,6 +24,7 @@ Since DLF is deadlock free, it is sufficient to prove that at least one process
If TURN = k and $p_k$ invoked lock, then it finds TURN = k and exits its wait. If TURN = k and $p_k$ invoked lock, then it finds TURN = k and exits its wait.
Otherwise, any other process will find `FLAG[TURN] = down` and exits from its wait. Otherwise, any other process will find `FLAG[TURN] = down` and exits from its wait.
###### Is it bounded bypass?
**Lemma 1:** if TURN = i and `FLAG[i] = up` then $p_i$ enters the CS in at most n-1 iterations **Lemma 1:** if TURN = i and `FLAG[i] = up` then $p_i$ enters the CS in at most n-1 iterations
Observation 1: TURN changes only when FLAG[i] is down (after pi has completed its CS) Observation 1: TURN changes only when FLAG[i] is down (after pi has completed its CS)