Paper Info
Title
Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults
Abstract
The 3-ary n-cube network is widely used in large-scale multi-processor parallel computers. It is an important issue to design high-performance communication technology with fault tolerance. In this paper, we study the fault-tolerant routing of 3-ary n-cube without desired intersection. Firstly, we propose a fully adaptive routing algorithm for 3-ary n-cube network based on the new virtual network partition technology. The virtual channel allocation of the algorithm is given and its deadlock free property is proved. Secondly, we propose a construction of disjoint paths in 3-ary n-cube networks under the fault model. Finally, we propose a novel fault-tolerant routing algorithm for 3-ary n-cube networks based on the disjoint path with structure faults. The simulation results show that the proposed fault-tolerant routing algorithm outperforms the previous fault-tolerant routing algorithm in many situations, which has a 19–21 percent increase in throughput and the injection rate.
Year
DOI
Venue
2021
10.1007/s11227-021-03799-0
The Journal of Supercomputing
Keywords
DocType
Volume
3-Ary n-cube, Disjoint path, Structure faults, Fault-tolerance, Routing algorithm
Journal
77
Issue
ISSN
Citations 
11
0920-8542
0
PageRank 
References 
Authors
0.34
31
5
Name
Order
Citations
PageRank
Yujie Zhang100.34
Weibei Fan211.36
Zhijie Han3149.31
Yunfei Song400.34
Ruchuan Wang541464.49