• DocumentCode
    1383982
  • Title

    A note on “A tight lower bound on the number of channels required for deadlock-free wormhole routing”

  • Author

    Sheng, Li ; Wu, Jie

  • Author_Institution
    Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USA
  • Volume
    49
  • Issue
    9
  • fYear
    2000
  • fDate
    9/1/2000 12:00:00 AM
  • Firstpage
    1005
  • Abstract
    R. Libeskind-Hadas (1998) provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this paper, we show a simpler proof of the tight lower bound
  • Keywords
    multiprocessor interconnection networks; network routing; deadlock-free wormhole routing; tight lower bound; Intelligent networks; Labeling; Multiprocessor interconnection networks; Routing; System recovery;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.869335
  • Filename
    869335
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1383982