论文信息 - Parallel Balancing of Binary Search Trees

Parallel Balancing of Binary Search Trees

A method for the balancing of binary search trees on a highly parallel computer is described. This method can be adapted for execution on a multiprocessor computer system.

Shi-Kuo Chang

[1] Chak-Kuen Wong,et al. Parallel Generation of Binary Search Trees , 1974, IEEE Transactions on Computers.

[2] Shi-Kuo Chang,et al. The Computation of Window Operations on a Parallel Organized Computer—A Case Study , 1973, IEEE Transactions on Computers.

[3] W. Donald Frazer,et al. Samplesort: A Sampling Approach to Minimal Storage Tree Sorting , 1970, JACM.