vault backup: 2025-03-24 09:58:11
This commit is contained in:
parent
0856621409
commit
1cc08d5391
2 changed files with 13 additions and 3 deletions
|
@ -128,4 +128,14 @@ pop() :=
|
|||
```
|
||||
|
||||
REMARK: crashes do not compromise progress!
|
||||
PROBLEM: unboundedness of REG is not realistic
|
||||
PROBLEM: unboundedness of REG is not realistic
|
||||
|
||||
### A Non-blocking Bounded Stack
|
||||
Idea: every operation is started by the invoking process and finalized by the next process
|
||||
|
||||
`STACK[0...k]` : an array of registers that can be read or compare&setted
|
||||
`STACK[i]` is actually a pair ⟨val , seq_numb⟩ initialized at ⟨⊥,0⟩
|
||||
|
||||
This is needed for the so called ABA problem with compare&set:
|
||||
- A typical use of compare&set is
|
||||
```stm```
|
Loading…
Add table
Add a link
Reference in a new issue