• DocumentCode
    2421487
  • 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
  • fYear
    1997
  • fDate
    11-15 Aug 1997
  • Firstpage
    16
  • Lastpage
    19
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1997., Proceedings of the 1997 International Conference on
  • Conference_Location
    Bloomington, IL
  • ISSN
    0190-3918
  • Print_ISBN
    0-8186-8108-X
  • Type

    conf

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