vault backup: 2025-03-10 17:40:21
This commit is contained in:
parent
f6767fc58b
commit
12ee83182c
2 changed files with 6 additions and 6 deletions
|
@ -260,7 +260,8 @@ Let's consider the execution of $p_i$ leading to its CS:
|
|||
so by this, the very worst possible case is that my lock experiences that.
|
||||
|
||||
It looks like I can experience at most $2n-1$ other critical sections, but it is even better, let's see:
|
||||
...
|
||||
- $p_n$ invokes lock alone, completes its CS (the first after the reset) and its new DATE is n+1
|
||||
- all processes invoke lock simultaneously
|
||||
|
||||
|
||||
#### Improvement of Aravind’s algorithm
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue