This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1980 (vol. 29 no. 9)
pp. 811-817
C.S. Ellis, Department of Computer Science, University of Rochester
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.
Index Terms:
search trees, Concurrent access, data bases, parallel processing, performance evaluation
Citation:
C.S. Ellis, "Concurrent Search and Insertion in AVL Trees," IEEE Transactions on Computers, vol. 29, no. 9, pp. 811-817, Sept. 1980, doi:10.1109/TC.1980.1675680
Usage of this product signifies your acceptance of the Terms of Use.