vault backup: 2025-03-10 19:22:05

Concurrent Systems/notes/3.md

@@ -265,6 +265,7 @@ It looks like I can experience at most $2n-1$ other critical sections, but it is
 - $p_{n}$ has to wait all other processes to complete their CSs
 - when $p_{n-1}$ completes its CS, its new DATE will be $n+(n-1)+1=2n$ -> RESET
 - now all $p_{1}\dots p_{n-1}$ invoke lock again and complete their CSs (after that $p_i$ completes its CS, now it has `DATE[i] <- n+i`)
+- so $p_n$ has to wait n-1 CSs for the reset, and another n-1 CSs before entering again
 
 
 #### Improvement of Aravind’s algorithm