Theoremresearch
Disjoint-access-parallel STM lower bound
Also called Attiya-Hillel-Milani bound.
Disjoint-access-parallel STMs with invisible reads pay a cost that grows with the read set, so read-only transactions are expensive (Attiya, Hillel, Milani 2009).
Disjoint-access-parallel STMs with invisible reads pay a cost that grows with the read set, so read-only transactions are expensive (Attiya, Hillel, Milani 2009).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KV109F Edit this page History Report an error