Searching for "On obstruction-free transactions." – sorted by Relevance.
-
Toward a Theory of Transactional Contention Managers
- with the structure of software transactional memory (STM) systems. A concurrent algorithm is obstruction-free [9
- Cited by 31 (5 self) – Add To MetaCart
-
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem ∗
- , by obstruction-free transactions [5].) Quantitatively, the goal is to maximize the throughput, measured
- Cited by 3 (0 self) – Add To MetaCart

