By Topic

Performance studies of wormhole routing algorithms on 2D meshes

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)
Ho, W.H. ; Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong ; Cheung, Y.S.

In recent years many design methodologies have been proposed to construct adaptive routers with minimum number of virtual channels and maximum flexibility. This paper compares the performance of some of the most commonly known ones including the planar adaptive algorithm, Duato's methodology, the B&E model and the optimally fully adaptive algorithm. Based on the cost model proposed by A.A. Chien (1993) the costs in implementing virtual channels and adaptability for different routing algorithms are evaluated using extensive flit-level simulation. The costs are interpreted as the achievable clock rate which is used for normalizing the simulation results. The simulation results show that the dimension order router have the best performance under uniform random traffic, mainly due to its higher achievable clock rate. The results also show that fully adaptive algorithms give much better performance at non-uniform traffic load, even with a slower speed

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996