• DocumentCode
    3556952
  • Title

    The hyper-deBruijn multiprocessor networks

  • Author

    Ganesan, Elango ; Pradhan, Dhiraj K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
  • fYear
    1991
  • fDate
    20-24 May 1991
  • Firstpage
    492
  • Lastpage
    499
  • Abstract
    Hypercube and deBruijn networks each possess certain desirable properties. The architecture proposed is a combination of the hypercube and deBruijn architectures. Thus, it provides flexibility in terms of connections per node and the level of fault-tolerance. The graph structure allows a direct decomposition of the network into VLSI building blocks. These networks possess logarithmic diameter, optimal connectivity and simple routing algorithms amenable to networks with faults. These hyper-deBruijn networks admit many computationally important subnetworks such as rings, multidimensional meshes, complete binary trees and mesh of trees with perfect dilation, in addition to being pancyclic
  • Keywords
    fault tolerant computing; multiprocessor interconnection networks; trees (mathematics); VLSI building blocks; complete binary trees; deBruijn networks; direct decomposition; fault-tolerance; graph structure; hypercube networks; logarithmic diameter; mesh of trees; multidimensional meshes; optimal connectivity; rings; routing algorithms; Computer architecture; Computer networks; Concurrent computing; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Network topology; Routing; Tree graphs; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 1991., 11th International Conference on
  • Conference_Location
    Arlington, TX
  • Print_ISBN
    0-8186-2144-3
  • Type

    conf

  • DOI
    10.1109/ICDCS.1991.148716
  • Filename
    148716