• DocumentCode
    962791
  • 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.
  • Issue
    6
  • fYear
    1985
  • fDate
    6/1/1985 12:00:00 AM
  • Firstpage
    563
  • Lastpage
    565
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1985.5009411
  • Filename
    5009411
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=962791