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

vault backup: 2025-03-31 10:07:33

Browse source
This commit is contained in:
Marco Realacci 2025-03-31 10:07:33 +02:00
parent 02d755e26d
commit 0656872fa4
1 changed files with 8 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Concurrent Systems/notes/9 - Consensus.md
View file

@ -192,3 +192,11 @@ mv_propose(i,v) :=
return PROP[k]
wait forever
```
why wait forever? Because we want to prove that it is wait free, but not because the loop finishes.
##### Validity, Agreement, Integrity, Termination:
- Let $p_{x}$ the first process that writes a proposal
- every $p_i$ that participates to the consensus reads the other proposals after that it has written `PROP[i]`
- all participants starts their for loops after $p_x$ has written its proposal
- every $p_i$ that participates to the consensus finds `PROP[x] != ⊥` in their for loop
- `BC[x]` o