A comparison of tree-balancing algorithms
Communications of the ACM
A concurrent database manipulation problem: binary search trees
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Model, Design, and Evaluation of a Compiler for a Parallel Processing Environment
IEEE Transactions on Software Engineering
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
| Hi-index | 14.98 |
This paper addresses the problem of concurrent access to dynamically balanced binary search trees. Specifically, two solutions for concurrent search and insertion in AVL trees are developed. The first solution is relatively simple and is intended to allow several readers to share nodes with a writer process. The second solution uses the first as a starting point and introduces additional concurrency among writers by applying various parallelization techniques. Simulation results used to evaluate the parallel performance of these algorithms with regard to the amount of concurrency achieved and the parallel overhead incurred are summarized.