The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the <it>message flow model</it>. 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.</p>
Channel dependency graph, message flow model, wormhole routing, multicast communication, mesh networks, deadlock-free routing, adaptive routing.

P. K. McKinley, L. M. Ni and X. Lin, "The Message Flow Model for Routing in Wormhole-Routed Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 755-760, 1995.
87 ms
(Ver 3.3 (11022016))