• DocumentCode
    2840711
  • Title

    Combinatorial properties of mesh of trees

  • Author

    Chen, Wei-Mei ; Chen, Gen-Huey ; Hsu, D. Frank

  • Author_Institution
    Dept. of Appl. Math., Tatung Univ., Taipei, Taiwan
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    134
  • Lastpage
    139
  • Abstract
    A mesh of trees, which has two favorable properties: small diameter and large bisection, is known as the fastest network when considered in terms of speed. We show that the wide diameter, fault diameter, and Rabin number, which are three generalizations of diameter, of a two dimensional 2n×2n mesh of trees are equal to 5n+1
  • Keywords
    multiprocessor interconnection networks; Rabin number; bisection; combinatorial properties; diameter; mesh of trees; Binary trees; Computer science; Convolution; Information science; Mathematics; Multiprocessor interconnection networks; Nearest neighbor searches; Routing; Sorting; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures, Algorithms and Networks, 2000. I-SPAN 2000. Proceedings. International Symposium on
  • Conference_Location
    Dallas, TX
  • ISSN
    1087-4089
  • Print_ISBN
    0-7695-0936-3
  • Type

    conf

  • DOI
    10.1109/ISPAN.2000.900277
  • Filename
    900277
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2840711