O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies

Constructing a binary search tree of n nodes with best frequencies needs Ω(n log n) time on RAM, and Ω(log n) time on n-processor EREW, CREW, or CRCW PRAM. In this paper, we propose an O(1) time algorithm on n-processor BSR PRAM for the problem, which is the first constant time solution to the problem on any model of computation.

[1]  Kazuo Ushijima,et al.  ANSV Problem on BSRs , 1998, Inf. Process. Lett..

[2]  Changjie Tang,et al.  O(1) time algorithm on BSR for constructing a random binary search tree , 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[3]  Kazuo Ushijima,et al.  On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR , 2001, IEEE Trans. Parallel Distributed Syst..

[4]  Ivan Stojmenovic,et al.  An Efficient Implementation for the BROADCAST Instruction of BSR+ , 1999, IEEE Trans. Parallel Distributed Syst..

[5]  Kazuo Ushijima,et al.  Rearranging Scattered Information on BSR , 1999, Inf. Process. Lett..

[6]  Kazuo Ushijima,et al.  A Theorem on the Relation Between BSRk and BSR+ , 1999, Inf. Process. Lett..

[7]  Jianjun Zhao,et al.  Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR , 2002, Parallel Process. Lett..

[8]  Limin Xiang.  Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its i-p Sequence , 1999, Parallel Process. Lett..

[9]  Ivan Stojmenovic,et al.  Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals , 1996, IEEE Trans. Parallel Distributed Syst..

[10]  Kazuo Ushijima,et al.  O(1) Time Algorithm on BSR for Computing Convex Hull , 2002, IASTED PDCS.

[11]  Selim G. Akl,et al.  An Optimal Implementation of Broadcasting with Selective Reduction , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

[13]  Kazuo Ushijima,et al.  Optimal parallel merging algorithms on BSR , 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

[14]  Luc Devroye,et al.  On the Generation of Random Binary Search Trees , 1995, SIAM J. Comput..