Paper Info
Title
Optimal fully adaptive minimal wormhole routing for meshes
Abstract
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the numberof virtual channels required and in the number of restrictions placed on the use of these virtualchannels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the onlyfully adaptive routing algorithm with uniform routers that achieves both of these goals. This newalgorithm requires only 4n \Gamma 2 virtual channels for an n-dimensional mesh. In addition, if more...
Year
DOI
Venue
1995
10.1006/jpdc.1995.1071
J. Parallel Distrib. Comput.
Keywords
DocType
Volume
adaptive minimal wormhole routing,adaptive routing,routing algorithms
Journal
27
Issue
ISSN
Citations 
1
Journal of Parallel and Distributed Computing
22
PageRank 
References 
Authors
1.91
10
2
Name
Order
Citations
PageRank
Loren Schwiebert187190.17
D. N. Jayasimha215816.02