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

vault backup: 2025-04-05 00:05:56

Browse source
This commit is contained in:
Marco Realacci 2025-04-05 00:05:56 +02:00
parent a99d09af0c
commit 47b74f3eec
4 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -140,7 +140,7 @@ Easy to generalize to k-MUTEX.
Peterson's algorithm cost $O(n^2)$
A first way to reduce this cost is by using a tournament of MUTEX between pairs of processes:
![350](Concurrent%20Systems/notes/images/Pasted%20image%2020250304082459.png|)
![350](images/Pasted%20image%2020250304082459.png|)
Of course this is a binary tree, and the height of a binary tree is logaritmic to the number of leaves. A process then wins after $\lceil \log_{2}n \rceil$ competitions $\to O(\log n)$ cost.