Research And Implementation Of Fault Tolerant Routing Algorithm For NoC Based On 3D Mesh

At present,In the 3D No C fault-tolerant routing algorithms,there is a class of algorithms that encircling the fault nodes in the network in a number of disjoint cuboid fault areas.When routing data packets,if a packet meets such a cuboid fault zone,this kind of algorithm will route the data package around the edge of the cuboid fault zone and thus avoid the cuboid fault areas.Because in the form of such a cuboid fault zone,a part of the nodes itself are sacrificed,and all the fault nodes and the set of the sacrific ed node free nodes make up the cuboid fault zone in the network.The nodes that are sacrificed are equal to a fa ult node when they are routed,they cannot receive data flits or transmit data flits.However,there are two drawbacks in the division of cuboid fault areas: one is that it can not use the fault node in the fault area,because the non-fault nodes in the fault zone may also form a route channel,and the second is that the formation of the cuboid fault areas is at the expense of the sacrifice of a large number of non-fault nodes.In order to solve the above two existing problems,we have proposed a routing algorithm for packets forwarding in 3D No C,which only needs to sacrifice a few non-fault nodes to establish fault zones and can make use of the failed fault nodes in the built fault areas.The algorithm first decomposes the traditional 3D No C rectangle fault area into several two-dimensional planes.The two-dimensional fault zone in each plane consists of the set of fault nodes and the set of sacrificial nodes,and the packets are no longer routed around the rectangle fault area,and the routing of the rectangle fault zone in the two-dimensional plane is not routed.It can directly pass through the fault area under certain conditions,thus shortening the length of the packet routing path,and directly reducing the communication delay of the network.In this condition,the limit of passing through the fault zone path is to prevent the occurrence of deadlock,that is to prevent some turns,so this algorithm does not need the virtual channel to avoid the free lock.Finally,we modify and use the 3D No C simulation software Access Noxim to verify and evaluate the fault-tolerant routing algorithm proposed in this paper.By modifying the corresponding parameters,we set up the network size of 3D No C,packet injection rate and the number of experiment wheels,and then simulated the fault-tolerant algorithm proposed in this paper with the increasing packet injection rate under the uniform flow pattern and hot flow pattern,and evaluated the performance according to the data.Compared with the existing fault tolerant routing algorithms used cuboid fault areas,the experimental data show that our algorithm is able to reduce the network average delay greatly and significantly improve the throughput of the network.C ompared with the routing algorithm Ham FA,our algorithm can also significantly reduce network delay and have higher reliability.