Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. Abstract: The concept of virtual channels is extended to multiple virtual ...
The purpose of this paper is to present simple, deadlock-free, adaptable, and fault-tolerant wormhole routing techniques for a popular topology-the k-ary n-cube ...
LINDER AND HARDEN: WORMHOLE ROUTING FOR k-ARY n-CUBES. 3 k-ary n-cube will not be deadlock-free regardless of how the input to output channel connections are ...
A simple mathematical model of adaptive routing in wormhole k-ary n-cubes. SAC '02: Proceedings of the 2002 ACM symposium on Applied computing.
Wormhole routing makes the communication latency insensitive to the network diameter and reduces the size of the channel buffer of each router. The concept of ...
TL;DR: This paper presents a model for designing wormhole routing algorithms based on analyzing the directions in which packets can turn in a network and the ...
An accurate model of adaptive wormhole routing in k-ary n-cubes interconnection networks ... Fault-tolerant routing strategy using routing capability in hypercube ...
1242-1256. [16] D. Linder, J. Harden, An adaptive and fault tolerant wormhole routing strategy for k-ary. hypecubes, IEEE Trans. Computers , vol. 40, no. 1 ...
This paper describes a new fault-tolerant routing algorithm for k-ary n-cubes ... An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes · D ...
D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, C40:2-12, 1991.