论文信息 - Parallel Generation of Binary Search Trees

Parallel Generation of Binary Search Trees

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.

Chak-Kuen Wong | Shi-Kuo Chang

[1] A. J. Critcklow. Generalized multiprocessing and multiprogramming systems , 1963, AFIPS '63 (Fall).

[2] Thomas N. Hibbard,et al. Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting , 1962, JACM.

[3] Alexander S. Douglas,et al. Techniques for the Recording of, and Reference to data in a Computer , 1959, Comput. J..

[4] Chak-Kuen Wong,et al. On Binary Search Trees , 1971, IFIP Congress.

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

[6] Wesley W. Chu,et al. Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[7] Edward G. Coffman,et al. Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[8] P. F. Windley,et al. Trees, Forests and Rearranging , 1960, Comput. J..