• DocumentCode
    3298123
  • Title

    Hyperbanyan networks: a new class of networks for distributed-memory multiprocessors

  • Author

    Ferner, Clayton S. ; Lee, Kyungsook Y.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Denver Univ., CO, USA
  • fYear
    1992
  • fDate
    19-21 Oct 1992
  • Firstpage
    254
  • Lastpage
    261
  • Abstract
    A new class of connection topologies for distributed-memory multiprocessors, hyperbanyan networks, is introduced. A hyperbanyan is a combination of the topological designs of a banyan and the hypertree networks. Since the hypertree combines the advantages of the binary tree and the hypercube, a hyperbanyan has the features of a binary tree, a hypercube, and a banyan. The hyperbanyans have a fixed degree of five, and the diameter of an (n stage×2n-1 nodes/stage) hyperbanyan is 2(n-1). A routing algorithm which is close to optimal is presented
  • Keywords
    distributed memory systems; hypercube networks; banyan networks; connection topologies; distributed-memory multiprocessors; hyperbanyan networks; hypertree networks; routing algorithm; topological designs; Binary trees; Computer science; Databases; Fault tolerance; Hamming distance; Hypercubes; Mathematics; Network topology; Parallel processing; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
  • Conference_Location
    McLean, VA
  • Print_ISBN
    0-8186-2772-7
  • Type

    conf

  • DOI
    10.1109/FMPC.1992.234951
  • Filename
    234951
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3298123