Parallel Generation of Binary Search Trees

Authors:
C. K. Wong; Shi-Kuo Chang
Affiliations:
Department of Computer Science, University of Illinois;-
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 5
Cited 0

Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

Journal of the ACM (JACM)
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Optimal File Allocation in a Multiple Computer System

IEEE Transactions on Computers
Optimal Preemptive Scheduling on Two-Processor Systems

IEEE Transactions on Computers
Generalized multiprocessing and multiprogramming systems

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

A method of constructing binary search trees in a multiprocessor computer system is proposed. Asymptotically, this method achieves the maximum possible increase in speed as compared with a single processor computer system. To make better use of this method, a parametrized restructuring of binary search trees is also discussed.