By Topic

A fault-tolerant routing strategy for Gaussian cube using Gaussian tree

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)
Loh, P.K.K. ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Xinhua Zhang

Gaussian cubes (GC) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of which can scale routing performance according to traffic loads without changing the routing algorithm. However, there is no existing fault-tolerant routing strategy for GC as well as node/link diluted cubes. In this paper, the void is filled for GC with an algorithm based on a new topology: Gaussian tree (GT). With a many-to-one mapping, the original problem is converted into routing in GT, which is found to be more definite and predictable. A new approach to categorizing faulty components is presented to overcome the problem of low node availability and the maximum number of faults tolerable is given. The algorithm is livelock free and generates deadlock-free routes, which are at most 2F hops longer than the optimal route in a fault-free setting, if F faults are encountered. Finally, simulation is done to show the algorithm's performance, demonstrating its contribution to making GC a more fault-tolerant topology.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003