A non-blocking chromatic tree is a type of balanced binary search tree where multiple processes can concurrently perform search and update operations. We prove that a certain implementation has amortized cost $O(\dot{c}+\log n)$ for each operation, where $\dot{c}$ is the maximum number of concurrent operations during the execution and n is the maximum number of keys in the tree during the operation. This amortized analysis presents new challenges compared to existing analyses of other non-blocking data structures.

中文翻译：

---

无阻塞色树的摊销分析

无阻塞色树是一种平衡的二进制搜索树，其中多个进程可以同时执行搜索和更新操作。我们证明某种实现已摊销了成本$Ø（\dot{C}+\mathrm{日志}ñ）$ 对于每个操作， $\dot{C}$是执行期间并发操作的最大数量，n是操作期间树中键的最大数量。与其他非阻塞数据结构的现有分析相比，这种摊销分析带来了新的挑战。