Efficient deadlock-free wormhole routing in shuffle based networks

• Published in: Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing pp. 92 - 99
• Main Authors: Park, H., Agrawal, D.P.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1995
• Subjects: Computer networks; Delay; Electronic mail; Hypercubes; Intelligent networks; Network topology; Optical buffering; Routing; System recovery; Telecommunication traffic
• ISBN: 9780818671951; 0818671955
• ISSN: 1063-6374
• DOI: 10.1109/SPDP.1995.530670

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.