一种并发最优二叉搜索树
A Concurrency-Optimal Binary Search Tree
摘要：
本文介绍了二叉查找树（BST）的第一个\emph{concurrency-optimal}实现。基于内部树的标准顺序实现的实现确保每个\emph{schedule}都被接受，即，顺序码步骤的交织，除非违反线性化性。为了确保这一属性，我们使用了一种新的读写锁定方案，保护树\emph{edges}除了节点。我们的实现优于最先进的BST的最基本的工作负载，这表明，优化的顺序代码的接受的时间表集可以是一个足够的设计原则，高效的并发数据结构。
英文摘要：
The paper presents the first \emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every \emph{schedule} is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree \emph{edges} in addition to nodes. Our implementation outperforms the state-of-the art BSTs on most basic workloads, which suggests that optimizing the set of accepted schedules of the sequential code can be an adequate design principle for efficient concurrent data structures.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
