This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1981 (vol. 30 no. 10)
pp. 812
A. Gottlieb, Courant Institute of Mathematical Sciences, New York University
Ellis' concurrent AVL insertion algorithm1is discussed in this correspondence. We note that obtaining a block of storage for the new AVL leaf may become a serial bottleneck for the entire insertion algorithm. We indicate a potential solution and refer the reader to another paper [1] in which the full details are given.
Index Terms:
search trees, Concurrent access, linked allocation, parallel processing
Citation:
A. Gottlieb, "Comments on "Concurrent Search and Insertion in AVL Trees"," IEEE Transactions on Computers, vol. 30, no. 10, pp. 812, Oct. 1981, doi:10.1109/TC.1981.1675700
Usage of this product signifies your acceptance of the Terms of Use.