CN107517159A - On-chip network structure and its shortest path acquisition methods based on butterfly network coding - Google Patents

On-chip network structure and its shortest path acquisition methods based on butterfly network coding Download PDF

Info

Publication number
CN107517159A
CN107517159A CN201710786146.7A CN201710786146A CN107517159A CN 107517159 A CN107517159 A CN 107517159A CN 201710786146 A CN201710786146 A CN 201710786146A CN 107517159 A CN107517159 A CN 107517159A
Authority
CN
China
Prior art keywords
node
axis
network
state
line
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710786146.7A
Other languages
Chinese (zh)
Other versions
CN107517159B (en
Inventor
张家勋
陈亦欧
凌翔
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201710786146.7A priority Critical patent/CN107517159B/en
Publication of CN107517159A publication Critical patent/CN107517159A/en
Application granted granted Critical
Publication of CN107517159B publication Critical patent/CN107517159B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/122Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to communication technical field in piece, more particularly to a kind of on-chip network structure and its shortest path acquisition methods based on butterfly network coding.The each node of the network architecture is in cellular distribution, and each honeycomb is the equilateral triangle that the line of adjacent three nodes is formed.The Z X Y Shortest path routings that on-chip network structure provided by the invention based on butterfly network coding coordinates with cellular topology can search out most short routed path in the case where avoiding deadlock;Compared to traditional topological structure, such as mesh topologys, the cellular topology in framework provided by the invention has natural shortcut, can shorten critical link hop count;Meanwhile butterfly network will be used to encode in framework provided by the invention, network hotspot can be significantly eliminated, solves network congestion problem;Cellular architecture provided by the invention using wireless come transmission packet, it is wired come transmission of control signals, data separate with control signal, so as to complete the data transfer of high-speed and high-efficiency.

Description

On-chip network structure and its shortest path acquisition methods based on butterfly network coding
Technical field
The present invention relates to communication technical field in piece, more particularly to a kind of on-chip network structure based on butterfly network coding And its shortest path acquisition methods.
Background technology
The key of chip multi-core processor (CMP) development is the communication construction scheme between multinuclear.In traditional total knot Under structure, the communication technology encounters the bottleneck of development in piece, even if the characteristic for constantly improving transmission line also is difficult to meet intercore communication Demand.In recent years in order to improve the performance to be communicated in piece, the scheme that conventional bus technologies are substituted with network-on-chip (NoC) is carried Go out.Although traditional network-on-chip interconnection architecture scalability based on inter metal dielectric has reached requirement, in power consumption and Can not meet the needs of being communicated in following piece in interconnection speeds;In order to solve the bottleneck problem of metal transmission line, wireless piece online Because the features such as being wirelessly transferred high-speed, low-power consumption starts to be studied gradually, Cheng Li et al. propose a kind of profit for network interconnection Photon on-chip network structure -- the LumiNOC to be communicated with nano-photon;M.-C.F.Chang et al. propose with guided wave transmission come Carry out the communication plan of network-on-chip;S.Watanabe et al. proposes UWB (Ultra Wideband) communicated in piece Scheme;The wireless network-on-chip worldlet (Small-Word) that has pointed out is although framework creates shortcut and subtracted using being wirelessly transferred Few critical path delay, but as the increase of internal subnet scale still results in the appearance of high delay path.Moreover, inner layer net The high delay and transfer rate that wire transmission is brought if network is excessive, in subnet reduce the still bad solution of problem.Meanwhile wireless biography The long difficulty that will cause with the inconsistency of the transmission range of wave point in design of distance of defeated interface.
The content of the invention
It is an object of the invention to overcome the above-mentioned deficiency in the presence of prior art, there is provided one kind is compiled based on butterfly network Code has low delay, low-power consumption honeycomb NoC frameworks.
In order to realize foregoing invention purpose, the invention provides following technical scheme:
A kind of on-chip network structure based on butterfly network coding, each node is in cellular distribution, and each honeycomb is phase The equilateral triangle that the line of adjacent three nodes is formed.
Further, in the framework, using wired mode transmission of control signals;Meanwhile using wireless way for transmitting data.
Further, the state of the node includes idle condition, sends state, direct forwarding state, coding forwarding shape State and secondary status;Wherein,
The node of idle condition does not do the processing of any packet;
The node of transmission state is sent out packet as sending node;
The node of direct forwarding state is receiving the packet come of sending node transmission, and without network code Directly the packet is forwarded;
The node of coding forwarding state just receives the packet transmitted at least two directions at the same time, and by all data Bag is broadcast to surroundings nodes after carrying out network code;
The packet that the node of secondary status is receiving sending node is prepared for network decoding, it is also possible to is being received The packet and then progress network decoding of forward node are prepared;
Further, encode the node pair of forwarding state while receive the packet transmitted at least two directions and encode When, handled by the way of by data packet signal XOR.
Further, node is in the state of transmission, direct forwarding state, coding forwarding state and during secondary status, Idle condition is returned to after completing the task of current state.
Present invention simultaneously provides it is a kind of apply as described above based on butterfly network coding on-chip network structure when obtain The method of shortest path between arbitrary two nodes, one in any two node is referred to as source node, another is referred to as Destination node.
Any node in framework is set as origin node, is (0,0,0) by the setting coordinate of the origin node;Origin node is appointed One is set as the first line with the lines of other nodes, is x-axis positive direction by the direction setting that the first line extends, by origin node With the first line rotate 60 degree of obtained lines be set as the second line, the bearing of trend for setting second line is set as z Axle positive direction, origin node is rotated into 120 degree of obtained lines with the first line and is named as the 3rd line, sets the 3rd line Bearing of trend be set as y-axis positive direction;
Using the shortest path between any two node of following workflow management:
Obtain coordinate (x of the source node relative to origin node1,y1,z1), obtain coordinate of the destination node relative to origin node (x2,y2,z2);
(1) the first relative numbering (x', y', z') is calculated, wherein, x'=x2-x1;Y'=y2-y1;Z'=z2-z1
(2) judge whether p=x' × y' is more than 0 in the first relative numbering;In this way, then such as otherwise enter into step (3) Step (5);
(3) formula d is passed throughz=min | x'|, | y'|, | z'| } calculate source node and distance d of the destination node in z-axisZ, Min { } is to take minimum value function;If z ' > 0, in z-axis positive direction displacement dZIf z ' < 0, in z-axis negative direction Displacement dZIf z '=0, displacement is 0 in z-axis;
(4) formula x "=sgn (x') × (x'-d is passed throughz);Y "=sgn (y') × (y'-dz);Z "=sgn (z') × (z'- dz) the second relative numbering (x ", y ", z ") is drawn, wherein sgn () is sign function;
(5) this step such as is gone to from step (2), then third phase is to numbering (x " ', y " ', z " ')=(x', y', z');
This step such as is gone to from step (4), then third phase is to numbering (x " ', y " ', z " ')=(x ", y ", z ");
The distance d that source node moves in the direction of the x axis to destination nodex=| x " ' |;Source node is to destination node in y-axis The distance d just moved upy=| y " ' |;If x " ' > 0, in x-axis positive direction displacement dx" ' the < 0, in x if x Axle negative direction displacement dxIf x " '=0, displacement is 0 in x-axis;If y " ' > 0, moved in y-axis positive direction Dynamic distance dyIf y " ' < 0, in y-axis negative direction displacement dyIf y " '=0, displacement is 0 on the y axis.
Compared with prior art, beneficial effects of the present invention:Piece online provided by the invention based on butterfly network coding Network framework has the following advantages that:
(1) the Z-X-Y Shortest path routings coordinated with cellular topology can search out most short in the case where avoiding deadlock Routed path.
(2) topological compared to such as mesh, the cellular topology in framework provided by the invention has natural shortcut, can shorten pass Key link hop count.
(3) butterfly network will be used to encode in cellular architecture, and will significantly eliminate network hotspot, and solved network congestion and ask Topic.
(4) cellular architecture provided by the invention using wireless come transmission packet, it is wired come transmission of control signals, data with Control signal separates, so as to complete the data transfer of high-speed and high-efficiency.
Brief description of the drawings:
Fig. 1 is the embodiment when on-chip network structure that butterfly network provided by the invention encodes has 19 nodes.
Fig. 2 is that embodiment sets origin and other node corresponding coordinate schematic diagrames in Fig. 1.
Fig. 3 is that XYZ direction of principal axis sets example in embodiment.
Fig. 4 is the mesh example topology figures of 16 nodes.
Fig. 5 is the exemplary plot when on-chip network structure that butterfly network provided by the invention encodes has 16 nodes.
Fig. 6 a are to reduce by a unit distance path profile directed downwardly in Fig. 5 examples.
Fig. 6 b are to reduce by a unit distance in Fig. 5 examples towards the path profile on a left side.
Fig. 6 c are the path profile that Z axis reduces distance in Fig. 5 examples.
Fig. 7 is that any node receives the packet schematic diagram that both direction transmits when encoding forwarding state.
Fig. 8 flow path switch figures between each state of node.
Fig. 9 a~Fig. 9 h are different nodes state change schematic diagram in transmitting procedure.
Embodiment
Below in conjunction with the accompanying drawings and specific embodiment the present invention is described in further detail.But this should not be interpreted as to this The scope for inventing above-mentioned theme is only limitted to following embodiment, all to belong to the present invention based on the technology that present invention is realized Scope.
Embodiment 1:The present embodiment provides a kind of on-chip network structure based on butterfly network coding, and each node is in honeycomb Shape is distributed, the equilateral triangle that each honeycomb is formed for the line of adjacent three nodes.In the framework, transmitted using wired mode Control signal;Meanwhile using wireless way for transmitting data.Fig. 1 gives the figure when on-chip network structure has 19 nodes Example.
The state of node includes idle condition, sends state, direct forwarding state, coding forwarding state and auxiliary shape State;Wherein, the node of idle condition does not do the processing of any packet;The node of transmission state is outside as sending node Send packet;The node of direct forwarding state is receiving the packet come of sending node transmission, and without network Coding is directly forwarded the packet;The node of coding forwarding state just receives the number transmitted at least two directions at the same time According to bag, and surroundings nodes are broadcast to after all packets are carried out into network code;The node of secondary status is receiving transmission The packet of node is prepared for network decoding, it is also possible to is done receiving the packet of forward node and then carrying out network decoding Prepare;Further, encode as shown in Figure 7 pair of the node of forwarding state while receive the packet transmitted at least two directions During row coding, handled by the way of by data packet signal XOR.Node in send state, direct forwarding state, When encoding forwarding state and secondary status, idle condition is returned to after completing the task of current state, the state of each node turns It is as shown in Figure 8 to change detailed process.
Each node may undergo this five kinds of states.This 5 kinds of states are described with algorithmic state machine figure (ASMD) Transfer process, as shown in Figure 8.As seen from Figure 8, when any request of no surroundings nodes, node is in oneself Idle condition;When present node is in idle condition, when locally having the request for sending packet, present node state becomes to send out State is sent, after transmission task is completed, node state becomes idle condition again;Here transmission task will illustrate have Two kinds, the first is sent to other nodes, and second is to be sent after receiving the data that other nodes come to local PE.
When present node is in idle condition, surroundings nodes have auxiliary request when, present node state becomes auxiliary State is helped, after the decoding effort of auxiliary node is completed, auxiliary node becomes transmission state;Present node is in idle condition When, when surroundings nodes have forwarding request, if without network code, present node state becomes direct forwarding state, when After front nodal point completes the forwarding of data, present node becomes transmission state, if carrying out network code, present node state becomes Forwarding state is encoded, after the data transfer of completion forward node to auxiliary node, present node state becomes transmission state.
Then, we will be discussed in transmitting procedure in the figure 7, each node state transfer figure, as shown in Fig. 9 a~Fig. 9 h.
In the figure 7, S1 nodes need to deliver a packet to D1 nodes, and S2 nodes need to deliver a packet to D2 sections Point.First according to Z-X-Y shortest-path rout ing algorithms, the transmitting path for calculating S1 nodes is to be forwarded by T nodes and then arrive D1 Node, the transmitting path of S2 nodes are to be forwarded by T nodes and then arrive D2 nodes.Next whole wire and wireless combination is just carried out Transmitting procedure.
With reference to Fig. 7, it is that S1 nodes and S2 nodes locally send request due to having first, becomes sending node, as Fig. 9 a are arrived Shown in Fig. 9 b, S1 nodes and S2 nodes are changed into transmission state S from idle condition F;S1 nodes and S2 nodes with T nodes by being connected Wire transmission line ask T nodes to forward simultaneously, T nodes become forwarding state T by idle condition F, as is shown in fig. 9 c.T nodes Judge that the data that the two nodes come can carry out network code, then T nodes are connected by oneself with D1 nodes and D2 nodes The wired control line connect asks the two nodes to be aided in as auxiliary node, because D1 nodes and D2 nodes are initially located in sky Not busy state F, then pass through the request that auxiliary is ready oneself in the wire transmission line response being connected with T nodes, while the state of oneself Become secondary status A, as shown in figure 9d.After the response of two auxiliary nodes is obtained, T points start to inform sending node S1 nodes Start to send packet with S2 nodes, then two sending nodes are by wireless channel broadcast data, as shown in figure 9e.
After forward node and auxiliary node receive by wireless channel the packet that sending node is broadcasted, by with The wired connection line of sending node sends the control signal oneself received.When sending node receives forward node and auxiliary section After the signal that point all receives, change the node state of oneself, become idle node state F, as shown in figure 9f.
After forward node receives the packet that two sending nodes are sent, network code, network are proceeded by After end-of-encode, begin through wire transmission line and ask the packet after two auxiliary reception codings, auxiliary node saves to forwarding After point returns to answer signal, forward node is begun to by the packet after wireless channel broadcast code to two auxiliary nodes, As shown in figure 9g.
After two auxiliary nodes have received the network code packet of forward node transmission, auxiliary node passes through wired biography Defeated line informs forward node.After forward node receives the control signal that two auxiliary nodes all receive, start to change oneself Node state, become idle node state F, as shown in Fig. 9 h.
After auxiliary node has received the packet of forward node, start with the sending node packet and forward node received Packet carries out network code decoding, and after the completion of decoding, state becomes idle condition F, as illustrated in fig. 9:
So far, the complete network code transmitting procedure introduction of node one finishes.
Forward node state above is coding forwarding state, and also direct forwarding state, is exactly without net in practice The forwarding state of network coding, in that state, if after forward node has received packet, becoming idle node, if worked as Front nodal point is not destination node, and node state becomes sending node, and continuation is sent forward.Just now in example, if two Auxiliary node is not destination node, and auxiliary completes posterior nodal point and becomes sending node again, continues to send towards destination node.In a word, The state of each node is carrying out corresponding state change when packet transmission is carried out, and is finally completed packet Transformation task.
In the cellular topology that the present embodiment provides, positioned at six sections of each node (except fringe node) with surrounding Point is adjacent, every three two-by-two adjacent node form an equilateral triangle;This structure expansion, connective and traditional mesh Structure is compared and increased, meanwhile, compared with mesh structures, cellular topology provided by the invention has the shortcut of itself;For The quality of quantitative comparison topological structure provided by the invention and mesh structures, we further by one as shown in Figure 5 The cellular topology comprising 16 nodes contrasted with the mesh structures for equally including 16 nodes as shown in Figure 4; We define an average beeline daverageTo describe the average beeline in any one framework.
Wherein N represents the number of node, the numbering of node (1 < i < j < N), min (d from 1 to Ni,j) represent in N number of section Point interior joint i to node j beeline (beeline drawn with Shortest path routing,
We are route using dimension under mesh topologys, and Z-X-Y Shortest path routings are used in cellular topology), h (di,j) Whether the node i of expression can reach node j, if can reach, h (di,j)=1, if cannot reach, h (di,j)=0. In the case of interstitial content identical, daverageValue it is smaller, this framework of surface under average beeline this standard more With advantage.
More convincingness is contrasted in order to allow, we will be contrasted under N (N=n*n) individual node, with the non-directed graph of this topological structure DaverageThan the d of the non-directed graph of mesh topological structureaverageWill reduction unit distance it is (most short by two in regular topological structure The distance between individual node is defined as unit distance) number.
As described above, Fig. 4 and Fig. 5 are 16 node wireless mesh structures and radio honeycomb structure provided by the invention respectively Schematic diagram, under two kinds of topological structures, each node can reach each other, as follows we have proposed theorem 1:
In cellular topology, there is k (0 in the path of two nodes in z-axis<k<N) individual unit distance, then with the two sections Compare it is necessary to reduce by k unit distance in path of the point in mesh topologys.
If the mark of node is carried out using the x-axis into 120 degree of angles and y-axis in radio honeycomb structure, if origin As wireless mesh is chosen, x positive directions are consistent with y positive directions, then coordinate of each point in radio honeycomb structure and It is the same in mesh structures.If filling out z-axis coordinate to cellular topology, it is possible to have been found that a node along z Axle is to another node, if z-axis coordinate reduces (increase) k, then x-axis coordinate and y-axis coordinate will be reduced (increase) accordingly k.That is z-axis walks a unit distance, if doing equivalence with x and y-axis is walked, needs two unit distances altogether, walks z Axle just reduces a unit distance.
It can be seen from theorem 1, honeycomb comes from z-axis to for N (N=n* entirely than the transmission range of mesh structure saving N) individual node, it is as follows than being derived using the transmission range of mesh structure reductions using honeycomb:
Firstly, for N (n*n) individual node, if any two node is all up (in the case of non-directed graph), path number It is exactly daverageDenominator term be exactly
Secondly, we are using first decomposing again comprehensive mathematical thought to the source node of N (n*n) individual node to destination node Routed path is sorted out, and the first is the route for only passing through z directions, and second is not pass through x or y also merely through the route in z directions The route in direction.It can also be subdivided into relative to the unit distance number of the reduction under mesh topologys and the side in path for second To.In view of being non-directed graph, in terms of path of Research problem, source node and destination node exchange do not influence.By the road in z directions By then through the i.e. reachable destination node in x directions or y directions.Definition is moved as to the left, y-axis moves positive direction along x-axis positive direction Movement is downward, and Fig. 6 a, Fig. 6 b are that relative mesh structures reduce a unit distance, direction down respectively, and relative mesh is tied Structure reduces by a unit distance, towards the path schematic diagram towards a left side, and in figure, same lines specification is a kind of path.
Due to the systematicness of cellular topology, we can calculate reduction k (1≤k≤n-2) individual unit distance and be directed downward All it is towards left number with directionSo the unit distance number of reduction altogether in this case It is:
If make i=n-k, then the expression formula of top can equivalence below:
Above formula calculates situation of the part path on z, situation of the All Paths on z is considered below, as fig. 6 c.
Due to the regularity in its path, we can calculate in this case, and the unit distance number of reduction is:
Formula (2) is added with formula (3), it can be deduced that under cellular topology, than under mesh topology, the unit distance of reduction is individual Counting sum is:
So for N (N=n*n) individual node, using cellular topology than the average most short transmission using mesh topology saving Distance (relative to unit distance) number be:
It can be drawn by expression above, the unit distance number of reduction is an increasing letter increased as n increases Number, work as n=11, i.e., when node number is 121, the d of the non-directed graph of this topological structureaverageWill be than mesh topological structure DaverageReduce by more than 1 unit distance, also imply that beeline ratio between each two node under this framework without Beeline under line mesh frameworks between each two node reduces a unit distance, and this is considerable.And work as When live-vertex number is less, the node for needing data transfer can be mapped on the path by z-axis by we as far as possible, be entered One step improves router efficiency.
Embodiment 2:Present invention simultaneously provides a kind of network-on-chip frame applied as described above based on butterfly network coding The method that shortest path between arbitrary two nodes is obtained during structure, using one in any two node as source node, separately One is used as destination node.
Any node in framework is set as origin node, is (0,0,0) by the setting coordinate of the origin node;Origin node is appointed One is set as the first line with the lines of other nodes, is x-axis positive direction by the direction setting that the first line extends, by origin node With the first line rotate 60 degree of obtained lines be set as the second line, the bearing of trend for setting second line is set as z Axle positive direction, origin node is rotated into 120 degree of obtained lines with the first line and is named as the 3rd line, sets the 3rd line Bearing of trend be set as y-axis positive direction;In the present embodiment, exemplified by the topology comprising 19 nodes as shown in us by Fig. 2 Node coordinate explanation is carried out, the node that center is located in 19 nodes shown in Fig. 2 is set to origin node by us, and its coordinate is (0,0,0), Fig. 3 gives to be set with this for the coordinate direction of origin, i.e. by the origin node horizontal direction 180 and neighbors Line bearing of trend be set as y-axis positive direction, will be z along the line direction setting after 60 degree of y-axis positive direction rotate counterclockwise Axle positive direction, will be x-axis positive direction along the line direction setting after 120 degree of y-axis positive direction rotate counterclockwise;Natural, It is x-axis negative sense in the opposite direction with x-axis pros;Y-axis pros are y-axis negative sense round about;Z-axis positive direction opposite direction is z Axle negative sense.
Using the shortest path between any two node of following workflow management:
Obtain coordinate (x of the source node relative to origin node1,y1,z1), obtain coordinate of the destination node relative to origin node (x2,y2,z2);
(1) the first relative numbering (x', y', z') is calculated, wherein, x'=x2-x1;Y'=y2-y1;Z'=z2-z1
(2) judge whether p=x' × y' is more than 0 in the first relative numbering;In this way, then such as otherwise enter into step (3) Step (5).
(3) formula d is passed throughz=min | x'|, | y'|, | z'| } calculate source node and distance d of the destination node in z-axisZ, Min { } is to take minimum value function;If z ' > 0, in z-axis positive direction displacement dZIf z ' < 0, in z-axis negative direction Displacement dZIf z '=0, displacement is 0 in z-axis.
(4) formula x "=sgn (x') × (x'-d is passed throughz);Y "=sgn (y') × (y'-dz);Z "=sgn (z') × (z'- dz) the second relative numbering (x ", y ", z ") is drawn, wherein sgn () is sign function.
(5) this step such as is gone to from step (2), then third phase is to numbering (x " ', y " ', z " ')=(x', y', z');
This step such as is gone to from step (4), then third phase is to numbering (x " ', y " ', z " ')=(x ", y ", z ");
The distance d that source node moves in the direction of the x axis to destination nodex=| x " ' |;Source node is to destination node in y-axis The distance d just moved upy=| y " ' |;If x " ' > 0, in x-axis positive direction displacement dx" ' the < 0, in x if x Axle negative direction displacement dxIf x " '=0, displacement is 0 in x-axis;If y " ' > 0, moved in y-axis positive direction Dynamic distance dyIf y " ' < 0, in y-axis negative direction displacement dyIf y " '=0, displacement is 0 on the y axis.
Specifically, the present embodiment is further described using examples with following two:
Example one:Take coordinate in specification Fig. 2 to be used as source node for the node of (- 1,1,0), coordinate for (2,0,0) section Point is used as destination node;Using the shortest path between any two node of following workflow management:
Obtain coordinate (x of the source node relative to origin node1,y1,z1)=(- 1,1,0), destination node is obtained relative to original Coordinate (the x of node2,y2,z2)=(2,0,0).
(1) the first relative numbering (x', y', z'), wherein x'=x are calculated2-x1=2- (- 1)=3;Y'=y2-y1=0-1 =-1;Z'=z2-z1=0-0=0.
(2) judge whether p=x' × y'=-3 is more than 0 in the first relative numbering;In this way, then into step (3), as otherwise Into step (5).
(3) formula d is passed throughz=min | x'|, | y'|, | z'| } calculate source node and distance d of the destination node in z-axisZ, Min { } is to take minimum value function;If z ' > 0, in z-axis positive direction displacement dZIf z ' < 0, in z-axis negative direction Displacement dZIf z '=0, displacement is 0 in z-axis.
(4) formula x "=sgn (x') × (x'-d is passed throughz);Y "=sgn (y') × (y'-dz);Z "=sgn (z') × (z'- dz) the second relative numbering (x ", y ", z ") is drawn, wherein sgn () is sign function.
(5) such as go to this step from step (2), then third phase to numbering (x " ', y " ', z " ')=(x', y', z')= (3,-1,0);
This step such as is gone to from step (4), then third phase is to numbering (x " ', y " ', z " ')=(x ", y ", z ").
The distance d that source node moves in the direction of the x axis to destination nodex=| x " ' |=3;Source node is to destination node in y The distance d moved on direction of principal axisy=| y " ' |=1;Due to x " ' > 0, so in x-axis positive direction displacement dx=3;Due to y " ' < 0, then in y-axis negative direction displacement dy=1.So routed path be (- 1,1,0)->(0,1,0)->(1,1,1)->(2, 1,1)->(2,0,0)。
Example two:Coordinate in specification Fig. 2 is taken to be used as source node for the node of (- 1, -2, -1), coordinate is (1,2,1) Node is as destination node.
Obtain coordinate (x of the source node relative to origin node1,y1,z1)=(- 1, -2, -1), obtain destination node relative to Coordinate (the x of origin node2,y2,z2)=(1,2,1).
(1) the first relative numbering (x', y', z') is calculated, wherein, x'=x2-x1=1- (- 1)=2;Y'=y2-y1=2- (- 2)=4;Z'=z2-z1=1- (- 1)=2.
(2) judge whether p=x' × y'=8 is more than 0 in the first relative numbering;In this way, then into step (3), as otherwise Into step (5).
(3) formula d is passed throughz=min | x'|, | y'|, | z'| }=min { 2,4,2 }=2 calculates source node and destination node Distance d in z-axisZ, min { } is to take minimum value function;Due to z ' > 0, then in z-axis positive direction displacement dZ=2.
(4) formula x "=sgn (x') × (x'-d is passed throughz)=1 × (2-2)=0;Y "=sgn (y') × (y'-dz)=1 × (4-2)=2;Z "=sgn (z') × (z'-dz)=1 × (2-2)=0 draws the second relative numbering (x ", y ", z "), wherein sgn () is sign function.
(5) this step such as is gone to from step (2), then third phase is to numbering (x " ', y " ', z " ')=(x', y', z');
Such as go to this step from step (4), then third phase to numbering (x " ', y " ', z " ')=(x ", y ", z ")=(0,2, 0);
Due to x " '=0, so displacement is 0 in x-axis;If y " ' > 0, in y-axis positive direction displacement dy =2.So routed path be (- 1, -2, -1) ->(0,-1,0)->(1,0,0)->(1,1,1)->(1,2,1).

Claims (6)

1. a kind of on-chip network structure based on butterfly network coding, it is characterised in that each node is in cellular distribution, each The equilateral triangle that honeycomb is formed for the line of adjacent three nodes.
2. framework as claimed in claim 1, it is characterised in that in the framework, using wired mode transmission of control signals;Together When, using wireless way for transmitting data.
3. framework as claimed in claim 1, it is characterised in that the state of the node includes idle condition, sends state, be straight Connect forwarding state, coding forwarding state and secondary status;Wherein,
The node of idle condition does not do the processing of any packet;
The node of transmission state is sent out packet as sending node;
The node of direct forwarding state is receiving the packet come of sending node transmission, and direct without network code The packet is forwarded;
The node of coding forwarding state just receives the packet transmitted at least two directions at the same time, and all packets are entered Surroundings nodes are broadcast to after row network code;
The packet that the node of secondary status is receiving sending node is prepared for network decoding, it is also possible to is forwarded receiving The packet and then progress network decoding of node are prepared.
4. framework as claimed in claim 3, it is characterised in that encode the node pair of forwarding state while receive at least two sides When being encoded to the packet transmitted, handled by the way of by data packet signal XOR.
5. framework as claimed in claim 3, it is characterised in that node turns in the state of transmission, direct forwarding state, coding When hair-like state and secondary status, idle condition is returned to after completing the task of current state.
6. the shortest path acquisition methods of framework as claimed in claim 1, it is characterised in that
Any node in framework is set as origin node, is (0,0,0) by the setting coordinate of the origin node;By origin node it is any with The line of other nodes is set as the first line, is x-axis positive direction by the direction setting that the first line extends, by origin node and the One line rotates 60 degree of obtained lines and is set as the second line, sets the bearing of trend of second line as z-axis positive direction, will Origin node and the first line rotate 120 degree of obtained lines and are named as the 3rd line, set the bearing of trend of the 3rd line as y Axle positive direction;
Using the shortest path between any two node of following workflow management:
Obtain coordinate (x of the source node relative to origin node1,y1,z1), obtain coordinate (x of the destination node relative to origin node2, y2,z2);
(1) the first relative numbering (x', y', z') is calculated, wherein, x'=x2-x1;Y'=y2-y1;Z'=z2-z1
(2) judge whether p=x' × y' is more than 0 in the first relative numbering;In this way, then such as step is otherwise entered into step (3) (5);
(3) formula d is passed throughz=min | x'|, | y'|, | z'| } calculate source node and distance d of the destination node in z-axisZ, min { } is to take minimum value function;If z ' > 0, in z-axis positive direction displacement dZIf z ' < 0, moved in z-axis negative direction Dynamic distance dZIf z '=0, displacement is 0 in z-axis;
(4) formula x "=sgn (x') × (x'-d is passed throughz);Y "=sgn (y') × (y'-dz);Z "=sgn (z') × (z'-dz) The second relative numbering (x ", y ", z ") is drawn, wherein sgn () is sign function;
(5) this step such as is gone to from step (2), then third phase is to numbering (x " ', y " ', z " ')=(x', y', z');
This step such as is gone to from step (4), then third phase is to numbering (x " ', y " ', z " ')=(x ", y ", z ");
The distance d that source node moves in the direction of the x axis to destination nodex=| x " ' |;Source node to destination node in the y-axis direction Mobile distance dy=| y " ' |;If x " ' > 0, in x-axis positive direction displacement dx" ' the < 0, in x-axis losing side if x To displacement dxIf x " '=0, displacement is 0 in x-axis;If y " ' > 0, in y-axis positive direction displacement dyIf y " ' < 0, in y-axis negative direction displacement dyIf y " '=0, displacement is 0 on the y axis.
CN201710786146.7A 2017-09-04 2017-09-04 Network-on-chip architecture based on butterfly network coding and shortest path acquisition method thereof Active CN107517159B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710786146.7A CN107517159B (en) 2017-09-04 2017-09-04 Network-on-chip architecture based on butterfly network coding and shortest path acquisition method thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710786146.7A CN107517159B (en) 2017-09-04 2017-09-04 Network-on-chip architecture based on butterfly network coding and shortest path acquisition method thereof

Publications (2)

Publication Number Publication Date
CN107517159A true CN107517159A (en) 2017-12-26
CN107517159B CN107517159B (en) 2021-05-04

Family

ID=60723735

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710786146.7A Active CN107517159B (en) 2017-09-04 2017-09-04 Network-on-chip architecture based on butterfly network coding and shortest path acquisition method thereof

Country Status (1)

Country Link
CN (1) CN107517159B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112822127A (en) * 2020-12-29 2021-05-18 北京灵汐科技有限公司 Data broadcasting method, device, chip and medium of network on chip

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101388834A (en) * 2008-10-20 2009-03-18 电子科技大学 Method for constructing network on three-dimensional chip
CN104780114A (en) * 2015-05-08 2015-07-15 电子科技大学 Wireless multi-core array hot spot eliminating method based on butterfly network codes and framework

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101388834A (en) * 2008-10-20 2009-03-18 电子科技大学 Method for constructing network on three-dimensional chip
CN104780114A (en) * 2015-05-08 2015-07-15 电子科技大学 Wireless multi-core array hot spot eliminating method based on butterfly network codes and framework

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
GYEONGHOON KIM: "A Task-level Pipelined Many-SIMD Augmented Reality Processor", 《2014 IEEE COOL CHIPS XVII》 *
杨鹏飞: "高可靠片上网络关键技术研究", 《中国博士学位论文全文数据库信息科技辑》 *
闫帅帅: "基于蝶形网络的量子网络编码研究", 《中国博士学位论文全文数据库信息科技辑》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112822127A (en) * 2020-12-29 2021-05-18 北京灵汐科技有限公司 Data broadcasting method, device, chip and medium of network on chip
CN112822127B (en) * 2020-12-29 2023-07-04 北京灵汐科技有限公司 Data broadcasting method, device, chip and medium of network-on-chip

Also Published As

Publication number Publication date
CN107517159B (en) 2021-05-04

Similar Documents

Publication Publication Date Title
CN104284387B (en) A kind of cluster routing method towards mobile sensor network
US7602738B2 (en) Process for generating and updating a hierarchical tree in a MANET multicast routing protocol ad hoc network
CN105007226B (en) A kind of multicast router and its working method based on bag circuit-switched technology
CN104602302B (en) It is a kind of based on cluster structured ZigBee-network balancing energy method for routing
CN103414644B (en) Method that list item issues and controller
CN113315569B (en) Satellite reliability routing method and system with weighted link survival time
CN105119833B (en) It is a kind of for the mixing interconnection structure of network-on-chip, its network node coding method and its mixed logic dynamic algorithm
CN107404745A (en) A kind of fire detector remote detecting system based on MANET
CN105933947A (en) Routing method for greedy geographical routing protocol tangent switching hole processing
Xiong et al. Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state
CN109586966A (en) A kind of unmanned systems network topology connectivity recovery method and system
CN102437953A (en) Low-power-consumption adaptive routing method in network on chip
CN104052663A (en) Large-scale on-chip chip interconnecting method and routing algorithm for realizing interconnecting structure
WO2023280039A1 (en) Low-energy routing method based on inter-satellite communication
CN105530206B (en) A kind of Torus network system and its working method with double access infrastructures
CN106358256B (en) A kind of multirobot control coordinator&#39;s production method
CN101534538A (en) Radio mobile self-organizing network route control system based on quantum searching idea
CN105764084A (en) Wireless sensor network multipath routing protocol realization method
CN107517159A (en) On-chip network structure and its shortest path acquisition methods based on butterfly network coding
CN102983948B (en) A kind of radio sensing network self-adaption cluster transmission method and device thereof
CN107690170A (en) Dynamic routing computational methods based on position and mission planning
CN107040884A (en) A kind of mobile ad hoc network data transmission method based on neighborhood strong connectedness
CN103747498A (en) Direction angle-based wireless sensor network routing void optimization method
CN103442382B (en) Reduce the topology control method disturbing between link
CN102420730B (en) Safety topology construction method of high-speed mobile node

Legal Events

Date Code Title Description
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant