Title :
Comments on "Concurrent Search and Insertion in AVL Trees"
Author_Institution :
Courant Institute of Mathematical Sciences, New York University
Abstract :
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.
Keywords :
Concurrent access; linked allocation; parallel processing; search trees; Art; Computational modeling; Concurrent computing; Data structures; Equations; Parallel architectures; Parallel processing; Programming; Upper bound; Concurrent access; linked allocation; parallel processing; search trees;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1981.1675700
