Title :
Efficient parallel algorithms for optimally locating a k-leaf tree in a tree network
Author :
Ku, Shan-Chyun ; Shih, Wei-Kuan ; Wang, Biing-Feng
Author_Institution :
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Abstract :
In this paper, an efficient parallel algorithm is proposed for finding a k-tree core of a tree network. The proposed algorithm performs on the EREW PRAM in O(log n log* n) time using O(n) work
Keywords :
computational complexity; multiprocessor interconnection networks; parallel algorithms; EREW PRAM; k-leaf tree; k-tree core; parallel algorithms; tree network; Computer science; Councils; Intelligent networks; Joining processes; Parallel algorithms; Phase change random access memory; TV; Tree data structures;
Conference_Titel :
Parallel Processing, 1997., Proceedings of the 1997 International Conference on
Conference_Location :
Bloomington, IL
Print_ISBN :
0-8186-8108-X
DOI :
10.1109/ICPP.1997.622537
