Title :
O(1) time algorithm on BSR for constructing a random binary search tree
Author :
Xiang, Limin ; Ushijiam, Kazuo ; Zhao, Jianjun ; Zhang, Tianqing ; Tang, Changjie
Author_Institution :
Dept. of Social Inf. Syst., Kyushu Sangyo Univ., Fukuoka, Japan
Abstract :
Constructing a random binary search tree with n nodes needs θ(nlog n) time on RAM, and ω(log n) time on n-processor EREW, CREW, or CRCW PRAM. 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.
Keywords :
computational complexity; concurrency theory; parallel algorithms; tree searching; trees (mathematics); BSR PRAM; CRCW PRAM; CREW; O(1) time algorithm; RAM; n-processor EREW; random binary search tree; Binary search trees; Bismuth; Broadcasting; Chromium; Computational modeling; Computer science; Erbium; Information systems; Phase change random access memory; Read-write memory;
Conference_Titel :
Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on
Print_ISBN :
0-7803-7840-7
DOI :
10.1109/PDCAT.2003.1236373
