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

vault backup: 2025-03-10 11:46:06

Browse source
This commit is contained in:
Marco Realacci 2025-03-10 11:46:06 +01:00
parent 92174244e8
commit 6dd6dff2f6
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Concurrent Systems/notes/3.md
View file

@ -192,7 +192,7 @@ Let pi and pj competing for the CS and pj wins
Then, pj enters its CS, completes it, unlocks and then invokes lock again Then, pj enters its CS, completes it, unlocks and then invokes lock again
- If pi has entered the CS, √ - If pi has entered the CS, √
- Otherwise, by Lemma1, MY_TURN[i] < MY_TURN[j], then pj cannot bypass pi again! - Otherwise, by Lemma1, $MY_TURN[i] < MY_TURN[j], then pj cannot bypass pi again!
- At worse, pi has to wait all other proceeses before entering its CS - At worse, pi has to wait all other proceeses before entering its CS
- (indeed, since there is no deadlock, when pi is waiting somebody enters the CS) - (indeed, since there is no deadlock, when pi is waiting somebody enters the CS)