By Topic

Efficient deadlock-free wormhole routing in shuffle based networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Park ; Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA ; D. P. Agrawal

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

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995