vault backup: 2025-03-17 21:37:45
This commit is contained in:
parent
fb4321db39
commit
6c6ae331e9
2 changed files with 11 additions and 8 deletions
|
@ -33,8 +33,11 @@ Implementation: every transaction uses a local working space
|
|||
#### A Logical Clock based STM system
|
||||
All the READs perform if no inconsistencies arise, or before any inconsistency
|
||||
|
||||
Let T be a transaction; its read prefix is formed by all its successful READ before its possible abortion.
|
||||
An execution is **opaque** if all committed transactions and all the read prefixes of all aborted transactions appear if executed one after the other, by following their real-time occurrence order.
|
||||
>[!def]
|
||||
>Let T be a transaction; its read prefix is formed by all its successful READ before its possible abortion.
|
||||
|
||||
>[!def]
|
||||
>An execution is **opaque** if all committed transactions and all the read prefixes of all aborted transactions appear if executed one after the other, by following their real-time occurrence order.
|
||||
|
||||
We now present an atomic STM system, called *Transactional Locking 2*:
|
||||
- CLOCK is an atomic READ/FETCH&ADD register initialized at 0
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue