A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Generic Methodologies for Deadlock-Free Routing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
A novel 3D NoC architecture based on De Bruijn graph
Computers and Electrical Engineering
| Hi-index | 0.00 |
This paper introduces a new deadlock-free routing algorithm with fewer virtual channels than the known algorithm for a generalized de Bruijn digraph of m virtual channels, where m is the maximum message path length and r is a radix. Our new algorithm requires maximum m-[/sup m-1///sub r/] virtual channels per physical channel. Extension to this algorithm for a generalized de Bruijn graph and a dBCube graph is introduced, and virtual channel requirements have also been identified. In most of dBCube graphs, maximum m-[/sup m-1///sub r/] virtual channels are required for the outcluster channels, and maximum m+1-[/sup m///sub r/] virtual channels for the incluster channels, where m is the maximum length of the cluster-to-cluster path.