DocumentCode
3064658
Title
A New Routing Method to Tolerate both Convex and Concave
Author
Gu, Huazi ; Liu, Zengji ; Kang, Guochang ; Shen, Hong
Author_Institution
State Key Laboratory of ISN, Xidian University, Xian, China
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
714
Lastpage
719
Abstract
To make the exiting fault routing algorithms tolerate concave fault regions without disabling any healthy nodes, the concept of hole is proposed in this paper. A hole consists of healthy nodes in the concave parts and neighborhood of a given concave fault region. By guiding the packet routing inside and outside the hole, the new routing method empowers the convex fault tolerant routing algorithm to tolerate concave shape regions without disabling any healthy nodes. The proposed modification method is simple and does not add new virtual channels. Moreover, it doesn’t change the rules of the previous algorithms. Finally, the performance of the modified routing algorithm is simulated under various concave fault patterns.
Keywords
Adaptive algorithm; Algorithm design and analysis; Fabrics; Fault tolerance; Information science; Laboratories; Multiprocessor interconnection networks; Routing; Shape; Supercomputers;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.27
Filename
1579014
Link To Document