Method for determining shortest route of network on RDT sheet

Abstract

The invention discloses a method for determining shortest route of network on RDT sheet. The present method requires multitime circulating calculation, so that the time consumption is big. The inventive method comprises the steps: building a coordinate system for the RDT network and determining the node number and the position of the communication node at first, then determining the mirroring superset M'(d) of the target node D and determining the optimal supper mirror point and building the X1-Y1 coordinate system, determining the vector decomposition result between the S and the M by using a VR method, storing the route project between the S and the D, starting the fault tolerance treatment mechanism. The invention effectively combines the advantage of the VR route method with the advantage of the CCVR route method, at the same time, overcomes the respective defect, can obtain the shortest route of any two points in the network on the RDT(n,1) sheet in the lesser calculation consumption. The fault tolerance mechanism provided by the invention can better solve the problem that the performance is lower in the present method.

Description

technical field [0001] The invention belongs to the field of computer technology, and relates to a network-on-chip (NoC) based on RDT, in particular to a method for finding the shortest route for an RDT (n, R, 1) network-on-chip and to deal with network links (Link ), the implementation method of the fault-tolerant mechanism for node (Tile) errors. Background technique [0002] The full name of RDT is Recursive Diagonal Torus, which is a general term for a type of on-chip interconnection network topology for massively parallel processors. The purpose of this topology is to reduce the network radius of massively parallel processors based on two-dimensional grid (2D-Mesh), so as to reduce the communication delay between different processors. It has been applied in massively parallel machines JUMP- 1 in. The idea of ​​RDT is to build Torus networks of different ranks and sizes on the basis of two-dimensional grids. The higher the level of the Torus network, the larger the li...

AI Technical Summary

Problems solved by technology

This method can solve the problem that VR cannot always find the shortest route, and the time complexity is much lower than that of CCVR

In addition, this method can solve the low-performance problem that the FVRSF and FVRMF fault-tolerant routing methods cannot produce global optimization results. According to the error status of the links in the entire RDT network, it can comprehensively consider different levels in the network under the condition of reducing the route length as much as possible. links, and eventually find an available route that avoids all faulty links

Images