The Message Flow Model for Routing in Wormhole-Routed Networks

Authors:
Xiaola Lin;Philip K. McKinley;Lionel M. Ni
Affiliations:
Michigan State University;Michigan State University;Michigan State University
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Year:
1993

Citing 0
Cited 10

Generic Methodologies for Deadlock-Free Routing

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
An Analytic Model for Communication Latency in Wormhole-Switched k-ary n-Cube Interconnection Networks with Digit-Reversal Traffic

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
A Performance Model of Adaptive Routing in k-Ary n-Cubes with Matrix-Transpose Traffic

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
An accurate mathematical performance model of adaptive routing in the star graph

Future Generation Computer Systems
Adaptive routing for convergence enhanced ethernet

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Complement routing: A methodology to design reliable routing algorithm for Network on Chips

Microprocessors & Microsystems
A new adaptive fault-tolerant protocol for direct multiprocessors networks

ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Analytic performance modeling of a fully adaptive routing algorithm in the torus

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Performance modeling of a fully adaptive and fault-tolerant wormhole switching strategy in 2-d mesh

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. 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 show how to use the model to prove that a given adaptive routing algorithm is deadlock-free. Finally, we use the method to de卢 velop new, efficient adaptive routing algorithms for 2D meshes and hypercubes.