• DocumentCode
    2371969
  • Title

    Design and analysis of a class of hierarchical interconnection networks

  • Author

    Karam, Omar H. ; Agrawal, Dharma P.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
  • fYear
    1990
  • fDate
    30 Sep-2 Oct 1990
  • Firstpage
    369
  • Lastpage
    373
  • Abstract
    Most interconnection networks have either a large diameter value or relatively high connectivity. To overcome some of these problems, the authors present a class of hierarchical interconnection networks (HINs) which can be implemented by many existing topologies as the base of the HIN. A joint is defined as the common nodes and links between two successive levels of an HIN. In all existing HINs, only one node is used as a joint within the hierarchy and hence the joint length is one. In the proposed class of HINs, the authors change the joint length to include two or more nodes. The two structures of the hierarchy need not be of the same type. The authors have also studied the impact of varying the number of interhierarchical connections, and the technique is illustrated by the example of a hypercube structure
  • Keywords
    multiprocessor interconnection networks; common nodes; hierarchical interconnection networks; hypercube structure; joint length; Computer aided instruction; Computer networks; Costs; Distributed computing; Hypercubes; Multiprocessor interconnection networks; Network topology; Protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 1990. Proceedings., Second IEEE Workshop on Future Trends of
  • Conference_Location
    Cairo
  • Print_ISBN
    0-8186-2088-9
  • Type

    conf

  • DOI
    10.1109/FTDCS.1990.138348
  • Filename
    138348