Progressive HyTMs force incremental validation on software transactions and admit optimal algorithms for progressiveness on transaction subsets with low hardware overhead.
Investigating the performance of hardware transactions on a multi-socket machine
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2verdicts
UNVERDICTED 2representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
citing papers explorer
-
On the Cost of Concurrency in Hybrid Transactional Memory
Progressive HyTMs force incremental validation on software transactions and admit optimal algorithms for progressiveness on transaction subsets with low hardware overhead.
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.