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

vault backup: 2025-04-04 23:58:09

Browse source
This commit is contained in:
Marco Realacci 2025-04-04 23:58:09 +02:00
parent 8e517b1bd4
commit 1ce5aec8cd
13 changed files with 34 additions and 50 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Concurrent Systems/notes/3b - Aravind's algorithm and improvements.md
View file

@ -31,7 +31,7 @@ unlock(i) :=
*Proof:* by contradiction.
Let's consider the execution of $p_i$ leading to its CS:
![[/Concurrent Systems/notes/images/Pasted image 20250310172134.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250310172134.png)
**Corollary** (of the MUTEX proof)**:** DATE is never written concurrently.
@ -57,7 +57,7 @@ Let's consider the execution of $p_i$ leading to its CS:
**Theorem:** the algorithm satisfies bounded bypass with bound $2n-2$.
*Proof:*
![[/Concurrent Systems/notes/images/Pasted image 20250310103703.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250310103703.png)
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: