OUYANG Yi-ming, HE Xin-cheng, LIANG Hua-guo, et al. A Fault-Tolerant Routing Algorithm Aiming at a Path Fault and Local Congestion in NoC[J]. Acta Electronica Sinica, 2016, 44(4): 920-925.
DOI:
OUYANG Yi-ming, HE Xin-cheng, LIANG Hua-guo, et al. A Fault-Tolerant Routing Algorithm Aiming at a Path Fault and Local Congestion in NoC[J]. Acta Electronica Sinica, 2016, 44(4): 920-925. DOI: 10.3969/j.issn.0372-2112.2016.04.024.
A Fault-Tolerant Routing Algorithm Aiming at a Path Fault and Local Congestion in NoC
As a new type of on-chip interconnection architecture
network-on-chip overcomes the bottleneck problem of the system-on-chip during the development.However
a failure arising in a router or a link between routers in network-on-chip will cause the reduction of network performance.To avoid this phenomenon
this paper puts forward a fault-tolerant routing algorithm aiming at a path fault and local congestion in network-on-chip.Firstly
the algorithm designs a fault model that reflects the fault status of the path within two hops.As a result
this novel fault model makes the router achieve a dynamic perception of path state within two hops with less cost.Secondly
a novel congestion model has been proposed for reflecting the state of the local network more accurately
contributing to balance network traffic.Finally
when a fault occurs
the algorithm not only is fault-tolerant but also makes sure the network has a good performance.What's more
the algorithm chooses the optimal path under the condition of fault-free.Experimental results show that the proposed algorithm has 10%~20% lower latency in average and 25% higher throughput rate than the contrast case when the network is fault-free.In the case of defective in the network
the advantage of the present scheme has a bigger superiority.