By Topic

Multiple spanning tree construction for deadlock-free adaptive routing in irregular 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
$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)
Dong Xiang ; Sch. of Software, Tsinghua Univ., Beijing, China ; Jiangxue Han

This paper proposes a new adaptive deadlock-free routing scheme to improve the performance of irregular networks by using multiple spanning trees. The traditional up*/down* routing algorithm used a single root, where the root can be a hotspot. The multiple layer spanning tree scheme used different virtual networks for different spanning trees. Bandwidths of the system may be not fully utilized. The proposed new deadlock-free adaptive routing scheme uses multiple spanning trees, where different packets are delivered along different trees. There may exist some potential cyclic channel dependencies based on the multiple-spanning-tree-based routing scheme in VCT-switched networks. A simple scheme is proposed to avoid potential cyclic channel dependencies by selecting the minimum number of constrained turns. Sufficient simulation results are presented to show the effectiveness of the proposed method.

Published in:

Parallel and Distributed Processing with Applications (ISPA), 2012 IEEE 10th International Symposium on

Date of Conference:

10-13 July 2012