使用HTM的线程安全动态范围最小-最大树的经验评估
Empirical Evaluation of a Thread-Safe Dynamic Range Min-Max Tree using HTM
摘要：
简洁树，例如小波树和基于例如范围最小-最大树（RMMT）的简洁树，是存储接近于其信息理论空间下界的信息的实用数据结构族。这些结构通常是静态的;这意味着一旦它们被构建，节点就不能被添加、删除或修改。此只读属性简化了并发性。然而，这些数据结构的较新版本允许相当程度的动态性。几年前，使用硬件transmittance Memory（HTM）的并行编程已经在主流微处理器中可用。HTM的一个限制仍然是每个交易的大小。这就是为什么HTM的使用目前仅限于涉及很少需要原子更新的内存地址的操作，或者并发级别较低的操作。我们提供了一个并发的，动态的RMMT的基础上HTM的第一个可用的实现，我们比较经验如何以及HTM相比，一个天真的实现使用锁。我们已经证明，由于RMMT的形式属性，HTM非常适合将并发性添加到其他缓慢的基于锁的替代方案中。我们还表明，当写操作的数量增加时，HTM的性能优于锁，使其成为在几个写密集型上下文中使用的实用结构。据我们所知，这是使用HTM进行彻底测试的RMMT的唯一实际实现。
英文摘要：
Succinct trees, such as wavelet trees and those based on, for instance, range Min-Max trees (RMMTs), are a family of practical data structures that store information close to their information-theoretic space lower bound. These structures are often static; meaning that once they are built, nodes cannot be added, deleted or modified. This read-only property simplifies concurrency. However, newer versions of these data structures allow for a fair degree of dynamism. Parallel programming using Hardware Transactional Memory(HTM), has been available in mainstream microprocessors since a few years ago. One limitation of HTM is still on the size of each transaction. This is why HTM's use, for the moment, is limited to operations that involve few memory addresses that need to be updated atomically, or where the level of concurrency is low. We provide the first available implementation of a concurrent, dynamic RMMT based on HTM, and we compare empirically how well HTM performs compared to a naive implementation using locks. We have shown that because of the formal properties of RMMTs, HTM is a good fit for adding concurrency to otherwise slow lock-based alternatives. We have also shown that HTM performs better than locks when the number of write operations increase, making it a practical structure to use in several write-intensive contexts. This is, as far as we know, the only practical implementation of RMMTs thoroughly tested using HTM.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
