• DocumentCode
    2711753
  • Title

    A Unified Approach to Construct Search Trees in Parallel

  • Author

    Das, Sajal K. ; Min, Kwang Bae

  • Volume
    3
  • fYear
    1994
  • fDate
    15-19 Aug. 1994
  • Firstpage
    222
  • Lastpage
    226
  • Abstract
    We present a unified parallel algorithm for constructing various search trees. The tree construction is based on a unified scheme, called bottom-level balancing, which constructs a height balanced search tree having a uniform distribution of keys. The algorithm takes O(loglogN) time using N/loglogN processors on the EREW PRAM model, and 0(1) time with N processors on the CREW PRAM model, where N is the number of keys in the tree.
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1994. ICPP 1994 Volume 3. International Conference on
  • Conference_Location
    North Carolina, USA
  • ISSN
    0190-3918
  • Print_ISBN
    0-8493-2493-9
  • Type

    conf

  • DOI
    10.1109/ICPP.1994.48
  • Filename
    5727863
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2711753