The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1981 vol.30)
pp: 812
A. Gottlieb , Courant Institute of Mathematical Sciences, New York University
ABSTRACT
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 [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, October 1981, doi:10.1109/TC.1981.1675700
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool