Comments on “Concurrent Search and Insertion in AVL Trees”

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)812
Number of pages1
JournalIEEE Transactions on Computers
VolumeC-30
Issue number10
DOIs
StatePublished - 1981

Fingerprint

Insertion
Concurrent
Leaves
Correspondence
Entire

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software
  • Theoretical Computer Science

Cite this

Comments on “Concurrent Search and Insertion in AVL Trees”. / Gottlieb, Allan.

In: IEEE Transactions on Computers, Vol. C-30, No. 10, 1981, p. 812.

Research output: Contribution to journalArticle

@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",
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

Y1 - 1981

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 - Article

VL - C-30

SP - 812

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 10

ER -