Transactional Interference-Less Balanced Tree
Transactional Interference-Less Balanced Tree
复制标题
事务性干扰较少的平衡树
DOI：
10.1007/978-3-662-48653-5_22
复制
发表时间：
2015
影响因子：
5.3
通讯作者：
B. Ravindran
中科院分区：
文献类型：
--
作者：
Ahmed Hassan;R. Palmieri;B. Ravindran
在本文中，我们提出了一种平衡树TxCF-Tree，它的设计经过优化以支持事务访问。TxCF-Tree操作的核心优化是：提供一个不使用任何锁和/或推测的遍历阶段，并将锁获取或物理修改推迟到事务的提交阶段；在无干扰的内务线程中隔离重新平衡等结构化操作；最小化结构化操作与语义操作的关键路径之间的干扰，即树上的添加和删除。我们针对设计事务树的最先进的通用方法对TxCF-Tree进行了评估，结果表明TxCF-Tree的设计在大多数工作负载中都是值得的。
In this paper, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree's operations are: providing a traversal phase that does not use any lock and/or speculation, and deferring the lock acquisition or physical modification to the transaction's commit phase; isolating the structural operations such as re-balancing in an interference-less housekeeping thread; and minimizing the interference between structural operations and the critical path of semantic operations i.e., additions and removals on the tree. We evaluated TxCF-Tree against the state-of-the-art general methodologies for designing transactional trees and we show that TxCF-Tree's design pays off in most of workloads.