A Hybrid Interconnect Structure for Network-on-Chip, Its Network Node Coding Method and its Hybrid Routing Algorithm
A network node, network-on-chip technology, applied in data exchange networks, forward error control, digital transmission systems, etc. Throughput, increase the average transmission delay, reduce the effect of the average distance of the path
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0065] When network node B communicates with network node C, network node B is the source node, and network node C is the target node, it is judged that network node B and network node C are both network nodes on the two-dimensional mesh structure, and they are the same two-dimensional mesh The network nodes on the network execute the XY routing algorithm. The XY coordinates of network node B are (110, 101), and the XY coordinates of network node C are (001, 110). According to the calculation method of offset, Xoffset can be obtained =011, Yoffset=101, converted to decimal Xoffset is +3, Yoffset is -1. So take three steps in the positive direction of the X axis, and then take one step in the negative direction of the Y axis, that is, from network node B to network node C.
Embodiment 2
[0067] The network node G communicates with the network node N, the network node G is the source node, and the network node N is the target node. If the network node G and the network node N are all nodes on the binary tree structure of the global network, the binary tree routing algorithm is directly executed. As follows, the network node G point binary tree code is 00_10_10_11, the network node N point binary tree code is 00_11_10_00, find that the bit segment that is not equal for the first time from left to right is L2, and then find the source node G that is not equal for the first time from right to left The bit segment of 00 is L, and m=i-j+1=4-2+1=3 is calculated, that is, the parent node needs to be searched up three times to reach the first forked node D. Then, starting from the network node D, starting from the L2 bit of the target node N, according to figure 2 Make a judgment, the L2 bit of the target node N is 11, route to the right child node M of the network no...
Embodiment 3
[0069] Network node B communicates with network node J. Network node B is the source node, and network node J is the target node. According to the node position judgment method, it can be known that network node B and network node J are located on different two-dimensional mesh networks, and the network node For the routing algorithm from B to network node G on the binary tree structure, network node B is first routed to network node Y. Referring to Embodiment 1, it can be seen that network node Y can be reached by walking along the forward direction of X once. Then the network node Y directly routes to the network node G, and then performs the routing from the network node G to the network node N, refer to the second embodiment. After routing from network node G to network node N, direct routing from network node N to corresponding network node Q is performed, and then the route from network node Q to network node J is executed. Referring to Embodiment 1, it can be seen that t...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


