An Efficient Implementation of Search Trees on O(log N) Processors

Authors:
Clark D. Thompson;Michael J. Carey
Affiliations:
-;-
Venue:
An Efficient Implementation of Search Trees on O(log N) Processors
Year:
1982

Citing 0
Cited 3

Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
Dictionary machines with a small number of processors

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
An Efficient Implementation of Search Trees on [lg N + 1] Processors

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A scheme for maintaining a balanced search tree on O(lgN) parallel processors is described. O(lgN) search, insert, and delete operations are allowed to run concurrently, with each operation executing in O(lgN) timesteps. The scheme is based on pipelined versions of top-down 2-3-4 tree manipulation algorithms.