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

vault backup: 2025-03-31 09:57:33

Browse source
This commit is contained in:
Marco Realacci 2025-03-31 09:57:33 +02:00
parent 4b83b6daee
commit d9a28cd90f
1 changed files with 5 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -111,7 +111,9 @@ local simulation of Z by p_i
k++ k++
exec_i <- CONS[k].propose(invoc_i) exec_i <- CONS[k].propose(invoc_i)
# sto proponendo UNA LISTA di operazioni # sto proponendo UNA LISTA di operazioni
# solo una vincerà # e propose in pratica me le mette in ordine
# così che posso eseguirle nello stesso ordine
# degli altri processi
for r=1 to |exec_i| for r=1 to |exec_i|
⟨z_i,res⟩ -> 𝛿(z_i,𝜋1(exec_i[r])) ⟨z_i,res⟩ -> 𝛿(z_i,𝜋1(exec_i[r]))
j <- 𝜋2(exec_i[r]) j <- 𝜋2(exec_i[r])
@ -165,3 +167,4 @@ Three possible ways!
2. additional consensus objects, one for every element of every list 2. additional consensus objects, one for every element of every list
3. reuse the same consensus object: for all k, `CONS[k]` not only chooses the list of invocations, but also the final state of every invocation 3. reuse the same consensus object: for all k, `CONS[k]` not only chooses the list of invocations, but also the final state of every invocation
- the proposals should also pre-calculate the next state and propose one - the proposals should also pre-calculate the next state and propose one