• DocumentCode
    1220147
  • Title

    Optimal broadcast in all-port wormhole-routed hypercubes

  • Author

    Ho, Ching-Tien ; Kao, Ming-Yang

  • Author_Institution
    IBM Res. Div., Almaden Res. Center, San Jose, CA, USA
  • Volume
    6
  • Issue
    2
  • fYear
    1995
  • fDate
    2/1/1995 12:00:00 AM
  • Firstpage
    200
  • Lastpage
    204
  • Abstract
    We give an optimal algorithm that broadcasts on an n-dimensional hypercube in O(n/ log2 (n+1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of P.K. McKinley and C. Trefftz (1993) requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n ⩽7
  • Keywords
    hypercube networks; all-port communication; all-port wormhole-routed hypercubes; e-cube routing; optimal algorithm; optimal broadcast; Algebra; Bandwidth; Broadcasting; Circuit topology; Hypercubes; Multicast algorithms; Parallel algorithms; Parallel processing; Routing; System recovery;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.342134
  • Filename
    342134
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1220147