By Topic

Universal wormhole routing

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
$31 $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)
Greenberg, R.I. ; Dept. of Math. & Comput. Sci., Loyola Univ., Chicago, IL, USA ; Hyeong-Cheol Oh

We examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+dη log P) time with high probability, where L is the number of flits in a packet, and η=min {d, L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat tree network of area ⊖(A) can simulate wormhole routing on any network of comparable area with O(log3 A) slowdown, when all worms have the same length. Variable length worms are also considered. We run some simulations on the fat tree which show that not only does wormhole routing tend to perform better than the more heavily studied store and forward routing in this context, but that performance superior to our provable bound is attainable in practice

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:8 ,  Issue: 3 )