Title :
A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
Author :
Moitra, Abha ; Iyengar, S. Sitharama
Author_Institution :
Department of Computer Science, Cornell University, Ithaca, NY 14853.
fDate :
6/1/1985 12:00:00 AM
Abstract :
We present a new iterative balancing algorithm for binary trees of size N = 2n -1 by exploiting the similarity of pointer restructuring at each level. We also extract parallelism from this algorithm to yield a constant time complexity balancing algorithm for an N-processor configuration. This achieves the theoretical limit of speedup possible.
Keywords :
Arithmetic; Binary search trees; Binary trees; Computer science; Concurrent computing; Iterative algorithms; Logic; Parallel algorithms; Parallel processing; Read-write memory; Balancing binary trees; binary search trees; complete binary trees; parallel algorithm;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1985.5009411
