vault backup: 2025-03-25 17:17:22
This commit is contained in:
parent
10447c9ab9
commit
3276faf70d
2 changed files with 14 additions and 4 deletions
|
@ -103,5 +103,15 @@ We assume a weak timestamp generator, i.e. a function such that, if it returns a
|
|||
TS[1..n] : SWMR atomic R/W registers init at 0
|
||||
|
||||
need_help(i) :=
|
||||
TS[i]
|
||||
```
|
||||
TS[i] <- weak_ts()
|
||||
repeat
|
||||
competing <- {j : TS[j] != 0 and j ∉ suspected_i}
|
||||
⟨t,j⟩ <- min{⟨TS[x],x⟩ | x ∈ competing}
|
||||
until j = i
|
||||
|
||||
stop_help(i) :=
|
||||
TS[i] <- 0
|
||||
```
|
||||
|
||||
##### Theorem:
|
||||
the contention manager just seen transforms an obstruction-free implementation into a wait-free enriched implementation.
|
Loading…
Add table
Add a link
Reference in a new issue