DocumentCode :
1115280
Title :
Parallel Balancing of Binary Search Trees
Author :
Chang, Shi-kuo
Author_Institution :
IBM T. J. Watson Research Center
Issue :
4
fYear :
1974
fDate :
4/1/1974 12:00:00 AM
Firstpage :
441
Lastpage :
444
Abstract :
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.
Keywords :
Binary search trees, highly parallel computer, information retrieval, parallel computation, sorting.; Application software; Binary search trees; Computational modeling; Concurrent computing; Counting circuits; Information retrieval; Sorting; Binary search trees, highly parallel computer, information retrieval, parallel computation, sorting.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1974.223959
Filename :
1672552
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1115280
بازگشت