• DocumentCode
    806811
  • Title

    The message flow model for routing in wormhole-routed networks

  • Author

    Lin, Xiaola ; McKinley, Philip K. ; Ni, Lionel M.

  • Author_Institution
    Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
  • Volume
    6
  • Issue
    7
  • fYear
    1995
  • fDate
    7/1/1995 12:00:00 AM
  • Firstpage
    755
  • Lastpage
    760
  • Abstract
    In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes
  • Keywords
    concurrency control; hypercube networks; operating systems (computers); 2D meshes; adaptive routing algorithms; arbitrary topologies; deadlock free routing; fully-adaptive routing; message flow model; necessary and sufficient condition; routing; wormhole-routed networks; Computer science; Delay; Intelligent networks; Mesh networks; Multicast algorithms; Multicast communication; Network topology; Routing; Sufficient conditions; System recovery;
  • fLanguage
    English
  • Journal_Title
    Parallel and Distributed Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9219
  • Type

    jour

  • DOI
    10.1109/71.395404
  • Filename
    395404
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=806811