| Research Support Tool |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Context
Fault-tolerant routing in multiply twisted cube topology
Title:
Fault-tolerant routing in multiply twisted cube topology
Archive:
Eprints@IIT Delhi
Author(s):
Agarwal, N
Ravikumar, C P
Ravikumar, C P
Date:
2005-06-08
Abstract:
In an attempt to improve the communication diameter of the hypercube interconnection network,variations of the hypercube topology called the twisted cubes have been proposed in the literature.among these,the multiply twisted cube (MTC)proposed by Efe(5)is a good condidate for massively parallel multiprocessors due to its properties such as smaller network diametere,high connectivity,regularity and recursive structure The routing algorithms proposed by Efe(5)suffers from two advantage.Due to its complex nature,a software implementation of the algorithm can be slow,and a hardware implementation expensive.Secondly,the algorithm is not tolorant to network condition such as fuilt and congestions.In thispaper we present a simple hierarchical router for the MTC,which has a efficient hardware implementation.We also present a simple,randomized variation of the hierarchical router which make the algorithm adpative to network condition without excessive hardware overhead.We compare the dynamics performance of our router with that of Efe routerour algorithm perform better in terms of network throughput and mean delay.Forthemore,the performance degrations is only marginal in the presence of a torable number of fuilts.
Index terms:
Discipline(s):
Twisted cubes
Subject(s):
Adaptive routing; Fault-tolerant routing; Randomized routing
Method/Approach:
Coverage:
Publisher:
Contributors:
Source:
Language:
en
Relation:
Type:
Article
Format:
261336 bytes
application/pdf
Copyright Information:
Browse Archive