• DocumentCode
    2742414
  • Title

    Structural properties of incomplete hypercube computers

  • Author

    Tzeng, Nian-Feng

  • Author_Institution
    Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
  • fYear
    1990
  • fDate
    28 May-1 Jun 1990
  • Firstpage
    262
  • Lastpage
    269
  • Abstract
    Incomplete hypercubes are analyzed. The elementary properties of complete hypercubes and a routing algorithm for incomplete hypercubes are briefly reviewed. Structural properties, including diameter, mean message traversal, and traffic density, of incomplete hypercube computers with size 2n+2k, 0⩽k<n, are investigated and presented. It is shown that traffic density in such an incomplete hypercube is bounded by two, despite its structural nonhomogeneity. Thus, cube links can easily be constructed so as to avoid any single point of congestion, guaranteeing good performance
  • Keywords
    hypercube networks; complete hypercubes; congestion; cube links; diameter; incomplete hypercube computers; mean message traversal; routing algorithm; structural properties; traffic density; Broadcasting; Computer architecture; Concurrent computing; Degradation; Hypercubes; Research and development; Routing; System recovery; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 1990. Proceedings., 10th International Conference on
  • Conference_Location
    Paris
  • Print_ISBN
    0-8186-2048-X
  • Type

    conf

  • DOI
    10.1109/ICDCS.1990.89293
  • Filename
    89293
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2742414