vault backup: 2025-03-31 08:55:43
This commit is contained in:
parent
5a1752193d
commit
66fa603146
1 changed files with 5 additions and 2 deletions
|
@ -62,11 +62,14 @@ The local simulation of Z by $p_i$ is
|
||||||
k <- 0
|
k <- 0
|
||||||
z_i <- Z.init()
|
z_i <- Z.init()
|
||||||
while true
|
while true
|
||||||
if invoc_i ≠ ⊥ then # pros
|
if invoc_i ≠ ⊥ then # prosegue se ci sono invocazioni
|
||||||
k++
|
k++
|
||||||
exec_i <- CONS[k].propose(invoc_i)
|
exec_i <- CONS[k].propose(invoc_i)
|
||||||
⟨zi , res⟩ <- 𝛿(zi , 𝜋1(exec_i))
|
⟨z_i , res⟩ <- 𝛿(z_i, 𝜋1(exec_i))
|
||||||
if 𝜋2(exec_i) = i then
|
if 𝜋2(exec_i) = i then
|
||||||
invoc_i <- ⊥
|
invoc_i <- ⊥
|
||||||
result_i <- res
|
result_i <- res
|
||||||
```
|
```
|
||||||
|
This solution is non-blocking but not wait-free (can run forever).
|
||||||
|
P.S. invoc, result e Z sono varia.
|
||||||
|
### A wait-free construction
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue