Comments on “Concurrent Search and Insertion in AVL Trees”

Allan Gottlieb

doi:10.1109/TC.1981.1675700

Comments on “Concurrent Search and Insertion in AVL Trees”

Allan Gottlieb

Computer Science

Research output: Contribution to journal › Comment/debate › peer-review

Abstract

Ellis' concurrent AVL insertion algorithm' 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.

Original language	English (US)
Pages (from-to)	812
Number of pages	1
Journal	IEEE Transactions on Computers
Volume	C-30
Issue number	10
DOIs	https://doi.org/10.1109/TC.1981.1675700
State	Published - Oct 1981

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/TC.1981.1675700

Cite this

@article{2931e8ef5a00462bbeb4990b865b4f6a,

title = "Comments on “Concurrent Search and Insertion in AVL Trees”",

abstract = "Ellis' concurrent AVL insertion algorithm' 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.",

author = "Allan Gottlieb",

year = "1981",

month = oct,

doi = "10.1109/TC.1981.1675700",

language = "English (US)",

volume = "C-30",

pages = "812",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "10",

}

TY - JOUR

T1 - Comments on “Concurrent Search and Insertion in AVL Trees”

AU - Gottlieb, Allan

PY - 1981/10

Y1 - 1981/10

N2 - Ellis' concurrent AVL insertion algorithm' 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.

AB - Ellis' concurrent AVL insertion algorithm' 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.

UR - http://www.scopus.com/inward/record.url?scp=84939369409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84939369409&partnerID=8YFLogxK

U2 - 10.1109/TC.1981.1675700

DO - 10.1109/TC.1981.1675700

M3 - Comment/debate

AN - SCOPUS:84939369409

SN - 0018-9340

VL - C-30

SP - 812

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 10

ER -

Comments on “Concurrent Search and Insertion in AVL Trees”

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this