vault backup: 2025-03-25 17:12:22
This commit is contained in:
parent
51be7d3a8f
commit
10447c9ab9
2 changed files with 7 additions and 6 deletions
|
@ -95,12 +95,13 @@ Forall i
|
|||
$\Omega_{X}$ is not stronger than ♢P (so, ♢P is strictly stronger)
|
||||
|
||||
The formal proof consists in showing that if $\Omega_{X}$ was stronger than ♢P, then consensus would be possible in an asynchronous system with crashes and atomic R/W registers.
|
||||
(because ♢P can solve consensus, )
|
||||
(because ♢P can be used to solve consensus)
|
||||
#### A contention manager for ♢P
|
||||
We assume a weak timestamp generator, i.e. a function such that, if it returns a positive value t to some process, only a finite number of invocations can obtain a timestamp smaller than or equal to t
|
||||
|
||||
```
|
||||
TS[1..n] : SWMR atomic R/W registers init at 0
|
||||
|
||||
...
|
||||
need_help(i) :=
|
||||
TS[i]
|
||||
```
|
Loading…
Add table
Add a link
Reference in a new issue