Issue No.10 - October (1981 vol.30)
A. Gottlieb , Courant Institute of Mathematical Sciences, New York University
Ellis' concurrent AVL insertion algorithm<sup>1</sup>is 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  in which the full details are given.
search trees, Concurrent access, linked allocation, parallel processing
A. Gottlieb, "Comments on "Concurrent Search and Insertion in AVL Trees"", IEEE Transactions on Computers, vol.30, no. 10, pp. 812, October 1981, doi:10.1109/TC.1981.1675700