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/10 - Implementing Consensus.md
View file

@ -30,7 +30,7 @@ A configuration C obtained during the execution of all A is called:
If A wait-free implements binary consensus for n processes, then there exists a bivalent initial configuration.
*Proof:*
![[/Concurrent Systems/notes/images/Pasted image 20250401083747.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250401083747.png)
### CN(Atomic R/W registers) = 1
**Thm:** There exists no wait-free implementation of binary consensus for 2 processes that uses atomic R/W registers.
@ -135,7 +135,7 @@ propose(i, v) :=
Let us consider a verison of the compare&swap where, instead of returning a boolean, it always returns the previous value of the object, i.e.:
![[/Concurrent Systems/notes/images/Pasted image 20250401092557.png]]
![](Concurrent%20Systems/notes/images/Pasted%20image%2020250401092557.png)
```
CS a compare&swap object init at ⊥