Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-07-16 , DOI: 10.1016/j.tcs.2020.07.007
Jeremy Ko

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\left(\stackrel{˙}{c}+\mathrm{log}n\right)$ for each operation, where $\stackrel{˙}{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.

down
wechat
bug