Comments on “Concurrent Search and Insertion in AVL Trees”

Research output: Contribution to journalComment/debatepeer-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 languageEnglish (US)
Pages (from-to)812
Number of pages1
JournalIEEE Transactions on Computers
VolumeC-30
Issue number10
DOIs
StatePublished - Oct 1981

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Comments on “Concurrent Search and Insertion in AVL Trees”'. Together they form a unique fingerprint.

Cite this