A proof that TDRF programs get strongly atomic semantics on privatization-safe transactional memories, plus an impossibility result ruling out progressive, invisible-read implementations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Privatization-Safe Transactional Memories (Extended Version)
A proof that TDRF programs get strongly atomic semantics on privatization-safe transactional memories, plus an impossibility result ruling out progressive, invisible-read implementations.