On Avoiding Spare Aborts in Transactional Memory
On Avoiding Spare Aborts in Transactional Memory
复制标题
关于避免事务内存中的备用中止
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
D. Perelman
中科院分区：
文献类型：
--
作者：
I. Keidar;D. Perelman
本文采取了一个步骤，发展一个理论，理解中止在事务存储系统（TM）。现有的TM可以中止许多事务，这些事务实际上可以在不违反正确性的情况下提交。我们把这种不必要的中止称为备用中止。我们对哪些类型的备用异常中止可以消除，哪些不能消除进行了分类。我们进一步研究了什么样的备用中止可以有效地避免。具体而言，我们表明，一些备用中止是无法避免的，并且有一个固有的权衡之间的开销的TM和程度，它减少了备用中止的数量。我们还提出了一个有效的例子TM算法，避免某些类型的备用中止，并分析其属性和性能。
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, commit without violating correctness. We call such unnecessary aborts spare aborts. We classify what kinds of spare aborts can be eliminated, and which cannot. We further study what kinds of spare aborts can be avoided efficiently. Specifically, we show that some spare aborts cannot be avoided, and that there is an inherent tradeoff between the overhead of a TM and the extent to which it reduces the number of spare aborts. We also present an efficient example TM algorithm that avoids certain kinds of spare aborts, and analyze its properties and performance.