A Relaxed Balanced Non-Blocking Binary Search Tree
semanticscholar(2020)
摘要
We present a new relaxed balanced concurrent binary search
tree in which all operations are non-blocking. We utilise
the notion of separating balancing operation and update
operations in a concurrent environment and design a nonblocking balancing operation in addition to the regular insert,
search, and relaxed delete operations. Our design uses a single-word CAS supported by most modern CPUs.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要