Efficient deadlock-free wormhole routing in shuffle based networks

To provide deadlock-free wormhole routing in simple regular networks, virtual channels have recently been introduced. This paper presents a deadlock-free routing scheme for a class of shuffle-based directed and undirected networks. First, the network graph is partitioned into a predetermined number of subdigraphs such that there are no cycles in each subdigraph. This enables not only a deadlock-free routing for de Bruijn digraphs, generalized de Bruijn digraphs, generalized de Bruijn graphs and directed shuffle-exchange networks, but also helps in determining maximum virtual channel requirements per physical channel, which again substantiates that our strategy provides better results than existing schemes