CN105471749B - The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing - Google Patents
The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing Download PDFInfo
- Publication number
- CN105471749B CN105471749B CN201610040721.4A CN201610040721A CN105471749B CN 105471749 B CN105471749 B CN 105471749B CN 201610040721 A CN201610040721 A CN 201610040721A CN 105471749 B CN105471749 B CN 105471749B
- Authority
- CN
- China
- Prior art keywords
- routing node
- node
- super
- routing
- cluster
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of exponent number flexibly extensive interconnection network topological structure of low diameter and its method for routing, solve the problems, such as to have the shortcomings that interconnection network topological structure can not overcome existing route device technique with it is insufficient.Technical solution is：Entire topology is formed by connecting by nq super routing nodes according to q in n cluster, each cluster super routing nodes, in a manner of Galaxy figures.A totally interconnected routing nodes are included in each super routing node, each super routing node draws the other super routing nodes of ah link connection, the super routing node of other clusters in 1 link connection Galaxy figure of n, other super routing nodes of (q δ)/2 same cluster of link connection.Each routing node connects p terminal, draws 1 routing node of other a in the same super routing node of 1 link connection of a, the other super routing nodes of h link connection.The present invention has the advantages that low network diameter and flexible configuration, effectively supports E grades of HPC systems compared to current interconnection network topological structure.
Description
Technical field
The present invention relates to the interference networks in the communications field, and in particular to a kind of exponent number spirit for extensive interference networks
Low diameter topological structure living and its method for routing.
Background technology
Instantly, the scale of large-scale computing systems alreadys exceed tens of thousands of a nodes, such as No. 2 supercomputers of the Milky Way in China
System and the Blue Gene of IBM (Blue Gene/Q) system.Overall performance, construction of these large-scale computing systems to system
Cost and power consumption have strict requirements and demand.Interference networks are the important components of large-scale computing systems, and
It is occupied an important position in the design object for completing whole system.Network delay, network bandwidth and cost and work(end to end
Consumption expense is all the important indicator for assessing interference networks.Planned network topological structure is mutual to construction large-scale computing systems
The network that networks is extremely important.
To meet the large-scale computing systems of more different applications and scale, design of network topology structure needs to consider following
Three indexs：
1. cost overhead and energy consumption expense cost performance.For E (Exascale=1018=trillion (102×108×108)
Flops) grade high-performance calculation (High Performance Computing, HPC) system, system platform cost requirement is in 200M
Below dollar and power dissipation overhead will be in below 20MW.In entire E grades of HPC system construction, the cost overhead of interference networks is constructed
The 33% and 50% of whole system can be accounted for power dissipation overhead.So a cost overhead and energy consumption expense is cost-effective opens up
It is essential to E grades of HPC systems to flutter structure.
2. end-to-end delay.Delay end to end depends mainly on the physics deployment of network diameter and real system.One
Good topological structure does not require nothing more than the low also requirement of network diameter convenient for deployment, and therefore, lower end-to-end delay is also optimization net
The important indicator of network performance.
3. the flexibility of topological structure.High performance computing system is because application demand is different, from hundreds of to tens of thousands of a nodes
Scale demand it is also different.So the flexibility of topological structure is also the important indicator in topology design, topological structure is needed
Flexibility can support different network sizes under limited router technique.
But limited power consumption, it is area-constrained under, meet ever-increasing interconnection bandwidth and performance requirement, realize big rule
Mould, high density, high performance Systems Interconnection Network, completing above-mentioned target, there are some challenges.Delay end to end is main to be determined
It is disposed in the physics of network diameter and real system.So some topological structures, which have been suggested, solves low network diameter
Topological structure, such as：Dragonfly, HyperX, Skywalk and Slim Fly etc., but these topological structures are in existing routing
E grades of computing systems are difficult to realize under device process conditions.At present, construct low diameter topological structure is all based on high-order router,
But the growth of the physical resource and power dissipation overhead constraint route chip exponent number due to chip, these low diameter topological structures are difficult
With arbitrary extension scale.In the router chip of electric signal interconnection, the area of SerDes, the complexity of Crossbar and chip
It is difficult that the limitation of boundary bandwidth so that chip exponent number while each port bandwidth is ensured increases.Moreover, the growth meeting of exponent number
The power consumption of router chip bigger is caused to be born.For example, the data of unidirectional one data bit (bit) of SerDes link transmissions need
Consume 20pJ, then the newest Omni-path frameworks needs put forward of Intel consume 160W on SerDes.Therefore, at present
It researchs and proposes using silicon photonics come the problems such as solving chip bandwidth, electric energy consumption.Altera and Avago has produced a
Apply the fpga chip of embedded parallel optical module MicroPOD.Although relative light signal technology is increasingly ripe, because
The limitation of optical module polymerization causes each router chip still cannot draw more ports.The arrival for calculating the epoch with E grades,
The problem of router exponent number, is more and more important.Another challenge be then how tradeoff design interference networks.For control system
Complexity, data center propose using cabinet scale computing system replace traditional modular system, the calculating of cabinet scale
System can provide high bandwidth, and the application for cabinet-level proposes flexibly and effectively routing mechanism and congestion control.Such system
System is equally applicable to some stationary applications of high performance computing system.But the bandwidth of how to compromise rack room and interior of equipment cabinet
Optimal performance to realize whole system is still an open subject.
Since the proposition of Flattened Butterfly structures, it is main to build interconnected network system using high-order router
Want means.Many higher order topologies also propose in succession, such as Fat tree structures, Dragonfly structures, HyperX structures, Skywalk
Structure, Slim Fly structures etc..Higher order topology structure can obtain smaller network diameter compared to low order topological structure, such as
Torus and Mesh.However, these higher order topology structures can not support E grades of HPC systems using the router of current process at present
System.Fat tree structures are one of most classical higher order topology structures, can increase scale by adding the number of plies and not use
The router of higher order, but Fat tree topological structures are difficult to extend, and in physics realization, and wiring density and wiring are irregular
It is its significant drawback.Not only network diameter is low but also combines the excellent of Power Line Communication and fiber optic cable communications for Dragonfly structures
Gesture reduces cost overhead, and still, once router exponent number determines, the maximum-norm that can be built is certain.HyperX structures are
One can be with the topological structure of flexible configuration, but per being all totally interconnected autgmentability to be caused to be limited on one-dimentional structure.Skywalk is tied
It is all uncontrollable that although structure, which can support random scale and limit the factors such as the length of link, routing policy,.
Slim Fly, which are that a diameter of 2 energy is approximate, supports the structure of maximum-norm, but be constrained to fixed path and network size.
Invention content
It is an object of the present invention to be directed to that based on existing interconnection network topological structure existing route device work can not be overcome
The shortcomings that skill and deficiency, can not support E grades of HPC systems, provide a kind of exponent number flexibly extensive interference networks topology of low diameter
Structure.
Another object of the present invention is that a kind of method for routing is provided on designed topological structure.
In order to reach first purpose, the present invention is realized using following technical scheme：Flexibly low diameter is extensive for exponent number
Interconnection network topological structure, entire topology are divided into double-layer structure, and a big super routing is formed by a routing node is totally interconnected
For node as first layer structure, a routing node in super routing node is denoted as the 0th routing node, the 1st routing section respectively
Point ..., t routing nodes ..., a-1 routing nodes, 0≤t≤a-1, a, t are integer.Second layer structure is then with first
Based on layer structure, each super routing node is connected into other super routing nodes in the way of Galaxy figures, wherein described
Connection be that the h link respectively drawn by a routing node in first layer structure provides, h is integer.Galaxy figures be one can
With the figure of flexible configuration, according to the configuration needs of real system, the parameter configuration of Galaxy figures is adjusted, so as to build whole network
Topology.
Galaxy figures of the present invention are determined that n, q are integer by parameter n, q.
There is n cluster (cluster) in Galaxy figures, be denoted as the 0th cluster, the 1st cluster ..., kth cluster ..., the (n-1)th cluster, 0≤k≤
N-1, k are integer.There are q node and satisfaction in each clusterWherein δ ∈ { -1,0,1 },For integer, q node
Be denoted as respectively the 0th node, first node ..., the i-th node ..., q-1 nodes.0≤i≤q-1, i are integer.Each node draws
Go out other (q- δs)/2 nodes of (q- δ)/2 link connections with cluster, and draw n-1 link and connect other n-1 respectively
Node in cluster.
Each node represents that the two-dimensional coordinate of the i-th node in kth cluster is denoted as (a with two-dimensional coordinatei0ai1…ais…
ai(n-1), k), the n tuples a of the first dimensioni0ai1…ais…ai(n-1)What is represented is that current super routing node is a with other n-1 respectively
Cluster has the number of the super routing node of connection relation, and i represents the node for the i-th node in kth cluster, wherein aisRepresent kth
I-th node (a of clusteri0ai1…ais…ai(n-1), k) connection s clusters node (aj0aj1…ajk…aj(n-1), s), wherein ajk=
ais, 0≤ais≤ q-1,0≤j≤q-1, aik=i, 0≤s≤n-1, s, j are integer.The k of second dimension represents that the node is located at
In kth cluster.
Kth cluster is as follows with the condition being connected between two nodes of s clusters in Galaxy figures：
(1) if k<S, then：
And if only if ais-ajs∈ X, (ai0ai1…ais…ai(n-1), k) and (aj0aj1…ajs…aj(n-1), k) it is connected.
And if only if aik-ajk∈ X ', (ai0ai1…aik…ai(n-1), s) and (aj0aj1…ajk…aj(n-1), s) it is connected.
And if only if ais=ajk, (ai0ai1…ais…ai(n-1), k) and (aj0aj1…ajk…aj(n-1), s) it is connected.
(2) if k=s, then：
And if only if ais-ajs∈ X, (ai0ai1…ais…ai(n-1), k) and (aj0aj1…ajs…aj(n-1), k) it is connected.
(3) if k>S, then：
And if only if ais-ajs∈ X ', (ai0ai1…ais…ai(n-1), k) and (aj0aj1…ajs…aj(n-1), k) it is connected.
And if only if aik-ajk∈ X, (ai0ai1…aik…ai(n-1), s) and (aj0aj1…ajk…aj(n-1), s) it is connected.
And if only if ais=ajk, (ai0ai1…ais…ai(n-1), k) and (aj0aj1…ajk…aj(n-1), s) it is connected.
Wherein, X and X ' is defined as follows, and ξ is finite field FqGeneration member：
(1) ifThen X={ 1, ξ2,…,ξq-3, X '={ ξ, ξ3,…,ξq-2}；
(2) ifThen
(3) ifThen
It should be noted that when seeking set X and X ', it is required for making the element in set the value that mould q operations obtain
It is only the content of set；In Galaxy figures kth cluster between two nodes of s clusters be connected condition judgment when, expression formula ais-ajs
Deng whether belonging to set X or X ' and to ais-ajsMake mould q operations to judge whether to belong to set X or X ', but for expression again
Terseness is not particularly illustrated mould q operations [Maciej Besta etc., Slim Fly to be made in related Mathematical Papers：A Cost
A kind of Effective Low-Diameter Network Topology " (cost-effective low diameter network topology Slim
Fly),International Conference for High Performance Computing,Networking,
Storage and Analysis2014 (SC2014), second chapter second part].Therefore, the present invention in ask set X with
X ' and when judging in Galaxy figures kth cluster with whether being connected between two nodes of s clusters, is not particularly illustrated mould q behaviour to be made
Make.
In practical structures, each routing node is by three-dimensional coordinate (ai0ai1...aik...ai(n-1), k, t) and it represents, ai0ai1…
aik…ai(n-1)The super routing node where the routing node is represented with k in the position of Galaxy figures, t then represents the routing section
Point is super routing node (ai0ai1...aik...ai(n-1), k) t routing nodes, and meet each routing node and provide
Meet ah >=n-1+ (q- δ)/2 to h link of second layer structure.Each terminal is then by four-dimensional coordinate
(ai0ai1...aik...ai(n-1), k, t, c) and it represents, c represents that the terminal is routing node (ai0ai1...aik...ai(n-1),k,t)
C terminals, the number of terminals that p is connected by each routing node, 0≤c≤p-1, p, c are integer.
Therefore, topological structure of the present invention be nq super routing nodes are divided into n cluster, a super roads of q in each cluster
It is formed by connecting in the way of Galaxy figures by node and by nq super routing nodes, a is included in each super routing node
A routing node, each routing node connect p terminal.Each routing node draws the same super road of a-1 link connection
By other a-1 routing nodes in node, the other super routing nodes of h link connection are drawn.So, a super routing
Node draws the other super routing nodes of ah link connection, meets ah >=n-1+ (q- δ)/2, wherein n-1 link connection
The super routing node of other clusters in Galaxy figures, other super routing nodes of (q- δ)/2 same cluster of link connection.
In order to reach second purpose, the present invention uses following technical scheme：One kind is flexible low straight based on the exponent number
The method for routing of the extensive interconnection network topological structure of diameter searches message from routing node (ai0ai1…aik…ai(n-1),k,t1)
To purpose terminal (aj0aj1…ajk…aj(n-1),s,t2, c) routing comprise the steps of, wherein t1And t2Respectively routing node
Number in super routing node, 0≤t1≤ a-1,0≤t2≤ a-1, t1、t2It is integer：
(1) routing node (a where current message is detectedi0ai1…aik…ai(n-1),k,t1) and purpose terminal (aj0aj1…
ajk…aj(n-1),s,t2, c) where routing node (aj0aj1…ajk…aj(n-1),s,t2) whether be same routing node, i.e.,
It detects whether to meet aik=ajk, k=s and t1=t2；
If aik=ajk, k=s and t1=t2, show the routing node where message and the routing node where purpose terminal
For same routing node, then by purpose terminal (aj0aj1…ajk…aj(n-1),s,t2, c) and as next-hop node, path finding
Terminate；
Otherwise, aik≠ajkOr k ≠ s or t1≠t2, show the routing node where message and the routing where purpose terminal
Node is not same routing node, is entered step (2)；
(2) routing node (a where detection messagesi0ai1…aik…ai(n-1),k,t1) and purpose terminal where routing
Node (aj0aj1…ajk…aj(n-1),s,t2) whether in same super routing node, that is, it detects whether to meet aik=ajkAnd k
=s；
If aik=ajkAnd k=s, show the routing node where message and the routing node where purpose terminal same
In a super routing node, then by the routing node (a where purpose terminalj0aj1…ajk…aj(n-1),s,t2) as next-hop
Node is gone to step (1)；
Otherwise, aik≠ajkOr k ≠ s, show that the routing node where message and the routing node where purpose terminal do not exist
In same super routing node, then enter step (3)；
(3) the super routing node (a where detection messagesi0ai1…aik…ai(n-1), k) and purpose terminal where it is super
Routing node (aj0aj1…ajk…aj(n-1), s) whether it is connected, method is：If k<S and ais=ajk, enter step (3.1)；If k
=s and ajs-ais∈ X are entered step (3.2)；If k>S and ais=ajk, enter step (3.3)；Otherwise, step (3.1),
(3.2), the condition of (3.3) is unsatisfactory for, and shows the super routing node where message and the super routing where purpose terminal
Node is not attached to, and is gone to step (4)；
(3.1)k<S and ais=ajk, show the super routing node where message and the super routing where purpose terminal
Node is connected.If routing node (a where messagei0ai1…aik…ai(n-1),k,t1) and the super routing node (a of purposej0aj1…
ajk…aj(n-1), s) and connected routing nodeBe same routing node i.e.WhereinFor lower floor operation, then routing node
As next-hop, enter step (1)；IfThen by the super routing node where message
(ai0ai1...aik...ai(n-1), k) and the super routing node (a of purposej0aj1...ajk...aj(n-1), s) and connected routing nodeAs next-hop, enter step (1)；
(3.2) k=s and ajs-ais∈ X show the super routing node where message and the super road where purpose terminal
It is connected by node.If routing node (a where messagei0ai1…aik…ai(n-1),k,t1) and the super routing node of purpose
(aj0aj1...ajk...aj(n-1), s) and connected routing nodeBe same routing node i.e.Wherein Δ is ajs-aisThe serial number that the value of mould q sorts from small to large in set X, then routing nodeAs next-hop, wherein λ is ais-ajsWhat the value of mould q sorted from small to large in set X
Serial number enters step (1)；IfThen by the super routing node (a where messagei0ai1...aik...ai(n-1),k)
With the super routing node (a of purposej0aj1...ajk...aj(n-1), s) and connected routing nodeMake
For next-hop, enter step (1)；
(3.3)k>S and ais=ajk, show the super routing node where message and the super routing where purpose terminal
Node is connected.If routing node (a where messagei0ai1…aik…ai(n-1),k,t1) and the super routing node of purpose
(aj0aj1...ajk...aj(n-1), s) and connected routing nodeIt is same road
It is by nodeThen routing nodeAs under
One jumps, and enters step (1)；IfThen by the super routing node where message
(ai0ai1...aik...ai(n-1), k) and the super routing node (a of purposej0aj1...ajk...aj(n-1), s) and connected routing nodeAs next-hop, enter step (1)；
(4) it finds and the super routing node (a where messagei0ai1...ais...ai(n-1), k) and the super routing section of purpose
Point (aj0aj1...ajk...aj(n-1), s) public super routing node, finding method is as follows：If k<S is entered step (4.1)；
If k=s, enter step (4.2)；If k>S is entered step (4.3)；
(4.1) if ais-ajk∈ X are entered step (4.1.1)；If ais-ajk∈ X ' are entered step (4.1.2)；
(4.1.1)ais-ajk∈ X show the super routing node where message and the super routing section where purpose terminal
The public super routing node of point then meets a in kth clusterls=ajkSuper routing node (al0al1...als...al(n-1),
K) it is public super routing node, wherein 0≤l≤q-1, l are integer；
If routing node (a where messagei0ai1…aik…ai(n-1),k,t1) and public super routing node
(al0al1...alk...al(n-1), k) and connected routing nodeBe same routing node i.e.Wherein Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X, then routing nodeAs next-hop, wherein λ is aik-alkThe sequence that the value of mould q sorts from small to large in set X
Number, it enters step (1)；
IfThen by the super routing node (a where messagei0ai1...ais...ai(n-1), k) and it is public super
Routing node (al0al1...als...al(n-1), k) and connected routing nodeAs next-hop,
Middle Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X enters step (1)；
(4.1.2)ais-ajk∈ X ' show the super routing node where message and the super routing where purpose terminal
The public super routing node of node then meets a in s clustersis=alkSuper routing node
(al0al1...alk...al(n-1), s) and it is public super routing node, wherein 0≤l≤q-1, l are integer；
If routing node (a where messagei0ai1…ais…ai(n-1),k,t1) and public super routing node
(al0al1...alk...al(n-1), s) and connected routing nodeIt is same
Routing node isThen routing nodeAs under
One jumps, and enters step (1)；
IfThen by the super routing node (a where messagei0ai1...aik...ai(n-1),
And public super routing node (a k)l0al1...alk...al(n-1), s) and connected routing nodeAs next-hop, enter step (1)；
(4.2) by all super routing node (a of order traversal kth cluster from big to smalll0al1...alk...al(n-1),k)
Meet alk-aik∈ X and ajk-alkThe minimum value of ∈ X, then super routing node (al0al1...als...al(n-1), k) and it is public super
Grade routing node, wherein 0≤l≤q-1, l are integer；
If routing node (a where messagei0ai1…ais…ai(n-1),k,t1) and public super routing node
(al0al1...als...al(n-1), k) and connected routing nodeBe same routing node i.e.Wherein Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X, then routing nodeAs next-hop, wherein λ is aik-alkThe sequence that the value of mould q sorts from small to large in set X
Number, it enters step (1)；
IfThen by the super routing node (a where messagei0ai1...aik...ai(n-1), k) and it is public super
Routing node (al0al1...alk...al(n-1), k) and connected routing nodeAs next-hop,
Middle Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X enters step (1)；
(4.3) if ais-ajk∈ X are entered step (4.3.1)；If ais-ajk∈ X ' are entered step (4.3.2)；
(4.3.1)ais-ajk∈ X show the super routing node where message and the super routing section where purpose terminal
The public super routing node of point then meets a in s clusterslk=aisSuper routing node (al0al1...alk...al(n-1),
S) it is public super routing node, wherein 0≤l≤q-1, l are integer；
If routing node (a where messagei0ai1…ais…ai(n-1),k,t1) and public super routing node
(al0al1...alk...al(n-1), s) and connected routing nodeIt is same road
It is by nodeThen routing nodeAs next
It jumps, enters step (1)；
IfThen by the super routing node (a where messagei0ai1...ais...ai(n-1),k)
With public super routing node (al0al1...alk...al(n-1), s) and connected routing nodeAs next-hop, enter step (1)；
(4.3.2)ais-ajk∈ X ' show the super routing node where message and the super routing where purpose terminal
The public super routing node of node then meets a in kth clusterls=ajkSuper routing node
(al0al1...alk...al(n-1), k) and it is public super routing node, wherein 0≤l≤q-1, l are integer；
If routing node (a where messagei0ai1…aik…ai(n-1),k,t1) and public super routing node
(al0al1...alk...al(n-1), k) and connected routing nodeBe same routing node i.e.Wherein Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X, then routing nodeAs next-hop, wherein λ is aik-alkThe sequence that the value of mould q sorts from small to large in set X
Number, λ sorts for integer and since 0, enters step (1)；
IfThen by the super routing node (a where messagei0ai1...ais...ai(n-1), k) and it is public super
Routing node (al0al1...alk...al(n-1), k) and connected routing nodeAs next-hop,
Middle Δ is alk-aikThe serial number that the value of mould q sorts from small to large in set X, Δ sort for integer and since 0, enter step
(1)。
The present invention is had the following advantages relative to the prior art and effect：
(1) for the extensive interconnection network topological structure of the present invention when not limited by router exponent number, growth scale is continuous
Property.If in the case where router chip technique is limited, which can be built same with the different router chip of exponent number
The network of scale can also build the network of different scales with the router chip of same exponent number, i.e. network size is nqap, is route
The exponent number of node is a+h+p-1, and the network struction of different demands can be realized by adjusting parameter n, a, p, q, h.Therefore, originally
Invention topological structure can overcome the shortcomings that existing route device technique with insufficient, E grades of HPC systems of support；
(2) the extensive interconnection network topological structure of the present invention is the hierarchical structure being configured by multi-parameter, therefore can root
According to the demand of real system, adjusting parameter n, a, p, q, h meet the needs of performances such as system two points of bandwidth, network diameters；
(3) the Galaxy figures that the extensive interconnection network topological structure of the present invention uses can according to requirement in practical systems according to
The big wisp structure of cluster or super node is divided into several modules convenient for physical layout, and combine optical cable and cable cost with
Apart from upper difference, the expense of physics cost is effectively reduced；And Galaxy figures be one can be with the figure of flexible configuration, according to reality
The configuration needs of system adjust the parameter configuration of Galaxy figures, so as to flexibly structure whole network topology, and support different scales
The network struction of HPC systems；
(4) in the extensive interconnection network topological structure of the present invention, there are q link and super routing between any two cluster
Intra-node is totally interconnected structure so that possess a plurality of redundant link between super routing node and between routing node, because
The method for routing of this present invention can find mulitpath, effectively promote the communication efficiency and fault-tolerance of topological structure.
Description of the drawings
Fig. 1 is the i.e. super road of first layer structure of the flexible extensive interconnection network topological structure of low diameter of exponent number of the present invention
By node structure figure, wherein the router quantity in super routing node is a=3；
Fig. 2 is the macrograph of the flexible second layer structure of the extensive interconnection network topological structure of low diameter of exponent number of the present invention
That is Galaxy schemes, and wherein the quantity of cluster is n=2, and the number of nodes of each cluster is q=5；
Fig. 3 is the exponent number of the present invention flexibly extensive interconnection network topological structure of low diameter, wherein the configuration n of Galaxy figures
=2 and q=5, the routing node quantity a=3 of each super routing node, and mark in detail super routing node (00,0) and
(13,1) and the connection between (11,0)；
Fig. 4 is the method for routing flow chart of the flexible extensive interconnection network topological structure of low diameter of exponent number of the present invention.
Specific embodiment
With reference to embodiment and attached drawing, the present invention is described in further detail, but embodiment of the present invention is unlimited
In this.
This example discloses each layer structure of extensive interconnection network topological structure, as shown in Figure 1, a super routing section
Totally interconnected form of 3 routing nodes in point is used as first layer structure；Each routing node connects 2 with two ports respectively at this time
A terminal, another two port connect other two routing nodes in same super routing node respectively.Topology as shown in Figure 2
The second layer structure macrograph of structure, each super routing node draw other two the super road of 2 link connections with cluster
By node, and draw 1 super routing node of 1 another cluster of link connection, wherein n=2 and q=5, then set X=1,
4 }, X '={ 2,3 }.The single super routing node being made of the Galaxy figures and every 3 routing nodes that are configured to n=2, q=5
To form topological structure of the present invention as shown in Figure 3, which includes double-layer structure.In second layer structure, super road
By the link between node respectively from each routing node in first layer structure, i.e., 3 roads in each super routing node
Draw 1 link connection other 3 super routing nodes respectively by node.
This example topological structure is made of 5 super routing nodes of 2 clusters and each cluster, wherein each super routing node
Containing 3 routing nodes and 6 terminals, n=2, q=5, a=3 and p=2 in this example.
According to super routing node and routing node and terminal institute in the extensive interconnection network topological structure of this example
Place's position coordinates are numbered for it.
Each super routing node uses two-dimensional coordinate (ai0ai1…ais…ai(n-1), k) and it represents, the n tuples of the first dimension
ai0ai1…ais…ai(n-1)What is represented is the super routing that current super routing node has connection relation with other n-1 cluster respectively
The number of node, wherein aisRepresent the i-th node (a of kth clusteri0ai1…ais…ai(n-1), k) connection s clusters node
(aj0aj1…ajk…aj(n-1), s), wherein, ajk=ais, aik=i.The k of second dimension then represents that current super routing node is located at the
In k clusters.The macrograph of topological structure second layer structure of the present invention as shown in Figure 2 gives each super routing according to above-mentioned coordinate
Node serial number, n=2, q=5, therefore the coordinate of each super routing node is (a in structurei0ai1, k), wherein being for number
The super routing node of (11,0), k 0 represent that the super routing node is located at No. 0 cluster, a10It is 1, represents the super routing
Node is located at No. 1 super routing node structure of No. 0 cluster, a11Be 1, represent the super routing node with positioned at the 1st cluster and its
ai0The super routing node that coordinate is 1 has connection relation.Therefore number be super routing node and the number of (13,1) be (11,
0) super routing node has connection.For the super routing node that coordinate value is (13,1), due to a30It is 1, represents that this is super
Routing node is with being located at the 0th cluster and its ai1The super routing node that coordinate is 1 has connection relation, and then further verification number is
(13,1) super routing node is that the super routing node of (11,0) is connect with number.Because of q=5, then set X=1,
4 }, because of a20-a10=1, so a20-a10∈ X, therefore number that be (11,0) have company between the super routing node of (22,0)
Connect relationship.Similarly, number is (21,1) has connection relation, wherein a between the super routing node of (42,1)21-a11∈X。
For each routing node, 3 dimension coordinate (a are usedi0ai1…aik…ai(n-1), k, t), the first peacekeeping second is tieed up
What is represented is all the coordinate of super routing node where the routing node, and the t of the 3rd dimension then represents routing node (ai0ai1…aik…
ai(n-1), k, t) and it is the super routing node (a in placei0ai1…aik…ai(n-1), k) t routing nodes.As shown in Figure 3 is entire
Topological structure, number are that the routing node of (00,0,0), (00,0,1) and (00,0,2) is located at super routing node (00,0)
In structure, each routing node draws a super routing node of link connection (11,0), (44,0) and (00,1) respectively.
For each terminal, 4 dimension coordinate (a are usedi0ai1…aik…ai(n-1), k, t, c), first the second dimension table of peacekeeping
Super routing node (a where being the terminal showni0ai1…aik…ai(n-1), k) number, the third dimension represent be the terminal institute
In routing node (ai0ai1…aik…ai(n-1), k, t) number, what fourth dimension represented is the terminal in routing node (ai0ai1…
aik…ai(n-1), k, t) and the number of terminal is connected, wherein 0≤c≤p-1.
Topological structure as shown in Figure 3 utilizes the flexible extensive interconnection network topological structure of low diameter of exponent number of the present invention
Method for routing find terminal (00,0,2,0) to the path of terminal (13,1,2,0), step is as follows：
(1) whether detection terminal (00,0,2,0) and terminal (13,1,2,0) are connected on same routing node, after testing,
They are not attached on same routing node；
(2) whether detection terminal (00,0,2,0) and the routing node where terminal (13,1,2,0) connect same super
On routing node, after testing, they are not attached on same super routing node；
(3) whether detection terminal (00,0,2,0) and the super routing node where terminal (13,1,2,0) are connected, through inspection
It surveys, without being connected between the super routing node where two terminals；
(4) searching is connected super jointly with super routing node where terminal (00,0,2,0) and terminal (13,1,2,0)
Routing node.It is super routing node (00,0) and (13,1) that number, which is the super routing node of (11,0), as seen from Figure 3
Public super routing node, the routing node (00,0,0) in super routing node (00,0) connect super routing node (11,
0) routing node (11,0,1), therefore, then by routing node (00,0,0) as next-hop.
Next it regard routing node (00,0,0) as current routing node, detection routing node (00,0,0) and purpose road
Whether be connected on same routing node by node (13,1,2), as shown in figure 3, two routing nodes be not be connected to it is same
On routing node, meanwhile, also not in same super routing node, and the super routing node where two routing nodes
Between be not attached to.Continually look for the public super routing node of the super routing node where two routing nodes and by current road
As the super routing node where node and the routing node that public super routing node is connected as next-hop, i.e., saved with routing
The connected routing node (11,0,1) of point (00,0,0) is as next-hop.
Next it regard routing node (11,0,1) as current routing node, detection routing node (11,0,1) and purpose road
Whether be connected on same routing node by node (13,1,2), as shown in figure 3, two routing nodes be not be connected to it is same
On routing node, meanwhile, also not in same super routing node, but the super routing node where two routing nodes
Between be connected.The routing node being connected between the super routing node where two routing nodes is continually looked for as next-hop,
The routing node (11,0,2) being connected with routing node (11,0,1) is as next-hop.
Next it regard routing node (11,0,2) as current routing node, detection routing node (11,0,2) and purpose road
Whether be connected on same routing node by node (13,1,2), as shown in figure 3, two routing nodes be not be connected to it is same
On routing node, meanwhile, also not in same super routing node, but the super routing node where two routing nodes
Between be connected.The routing node being connected between the super routing node where two routing nodes is continually looked for as next-hop,
The routing node (13,1,2) being connected with routing node (11,0,2) is as next-hop.
Routing node (13,1,2) is exactly the routing node that purpose terminal (13,1,2,0) is connected, and path finding terminates.
Above-described embodiment is shortest-path rout ing algorithms embodiment of the present invention, but embodiments of the present invention are not by upper
State the limitation of embodiment, the change made under other any Spirit Essences and principle without departing from the present invention, modification, replacement,
Combination simplifies, and should be equivalent substitute mode, is included within protection scope of the present invention.
Claims (6)
1. the flexible extensive interconnection network topological structure of low diameter of a kind of exponent number, which is characterized in that entire topology is divided into two layers
Structure forms a big super routing node as first layer structure, in super routing node by a routing node is totally interconnected
A routing node be denoted as respectively the 0th routing node, the 1st routing node ..., t routing nodes ..., a-1 routing nodes,
0≤t≤a-1, a, t are integer；Second layer structure is then based on first layer structure, and each super routing node is pressed
The mode of Galaxy figures connects other super routing nodes, wherein the connection is by a routing node in first layer structure
The h link respectively drawn provides, and h is integer；
There is n cluster (cluster) in Galaxy figures, be denoted as the 0th cluster, the 1st cluster ..., kth cluster ..., the (n-1)th cluster, 0≤k≤n-1,
N, k is integer；There is q node in each cluster, a super routing node of each node, that is, topological structure first layer structure, and
Meet q=4l+ δ, wherein δ ∈ { -1,0,1 }, l are integer, q node be denoted as respectively the 0th node, first node ..., the i-th section
Point ..., q-1 nodes；0≤i≤q-1, i, q are integer；Each node draws (q- δ)/2 link connections with the other of cluster
(q- δ)/2 nodes, and draw n-1 link and connect node in other n-1 clusters respectively；
Each node represents that the two-dimensional coordinate of the i-th node in kth cluster is denoted as (a with two-dimensional coordinatei0ai1...ais...ai(n-1),
K), the n tuples a of the first dimensioni0ai1...ais...ai(n-1)What is represented is that current super routing node has respectively with other n-1 cluster
The number of the super routing node of connection relation, i represent the node for the i-th node in kth cluster, wherein aisRepresent kth cluster
I-th node (ai0ai1...ais...ai(n-1), k) connection s clusters node (aj0aj1...ajk...aj(n-1), s), wherein ajk=
ais, 0≤ais≤ q-1,0≤j≤q-1, aik=i, 0≤s≤n-1, s, j are integer；The k of second dimension represents that the node is located at
In kth cluster；Each super routing node draws the other super routing nodes of ah link connection, meets ah >=n-1+ (q- δ)/2,
The super routing node of other clusters in wherein n-1 link connection Galaxy figure, (q- δ)/2 same cluster of link connection its
Its super routing node；
Comprising a routing node in each super routing node, each routing node is by three-dimensional coordinate
(ai0ai1...aik...ai(n-1), k, t) and it represents, ai0ai1...aik...ai(n-1)The super road where the routing node is represented with k
By node in the position of Galaxy figures, t then represents that the routing node is super routing node (ai0ai1...aik...ai(n-1),k)
T routing nodes, each routing node draws other a-1 roads in the same super routing node of a-1 link connection
By node, the other super routing nodes of h link connection are drawn；
Each routing node connects p terminal, and each terminal is then by four-dimensional coordinate (ai0ai1...aik...ai(n-1), k, t, c) and table
Show, c represents that the terminal is routing node (ai0ai1...aik...ai(n-1), k, t) c terminals, 0≤c≤p-1, p, c are whole
Number.
2. the flexible extensive interconnection network topological structure of low diameter of exponent number as described in claim 1, which is characterized in that described
Kth cluster is as follows with the condition being connected between two nodes of s clusters in Galaxy figures：
(1) if k<S, then：
And if only if ais-ajs∈ X, (ai0ai1...ais...ai(n-1), k) and (aj0aj1...ajs...aj(n-1), k) it is connected；
And if only if aik-ajk∈ X ', (ai0ai1...aik...ai(n-1), s) and (aj0aj1...ajk...aj(n-1), s) it is connected；
And if only if ais=ajk, (ai0ai1...ais...ai(n-1), k) and (aj0aj1...ajk...aj(n-1), s) it is connected；
(2) if k=s, then：
And if only if ais-ajs∈ X, (ai0ai1...ais...ai(n-1), k) and (aj0aj1...ajs...aj(n-1), k) it is connected；
(3) if k>S, then：
And if only if ais-ajs∈ X ', (ai0ai1...ais...ai(n-1), k) and (aj0aj1...ajs...aj(n-1), k) it is connected；
And if only if aik-ajk∈ X, (ai0ai1...aik...ai(n-1), s) and (aj0aj1...ajk...aj(n-1), s) it is connected；
And if only if ais=ajk, (ai0ai1...ais...ai(n-1), k) and (aj0aj1...ajk...aj(n-1), s) it is connected；
Wherein, X and X ' is defined as follows, and ξ is finite field FqGeneration member：
(1) if q=4l+1, X={ 1, ξ2,…,ξq-3, X '={ ξ, ξ3,...,ξq-2}；
(2) if q=4l-1, X={ 1, ξ2,...,ξ2l-2,ξ2l-1,ξ2l+1,...,ξ4l-3,
X '={ ξ, ξ3,...,ξ2l-1,ξ2l,...,ξ4l-4,ξ4l-2}；
(3) if q=4l, X={ 1, ξ2,...,ξ4l-2, X '={ ξ, ξ3,...,ξ4l-1}。
3. the flexible extensive interconnection network topological structure of low diameter of exponent number as claimed in claim 2, which is characterized in that asking
When set X and X ', it is required for making the element in set the content that the value that mould q operations obtain is only set；In Galaxy figures
Kth cluster between two nodes of s clusters be connected condition judgment when and to ais-ajsMake mould q operations to judge whether to belong to collection again
Close X or X '.
4. the road based on the flexible extensive interconnection network topological structure of low diameter of the exponent number described in claim 1-3 any one
By method, which is characterized in that search message from routing node (ai0ai1...aik...ai(n-1),k,t1) to purpose terminal
(aj0aj1...ajk...aj(n-1),s,t2, c) routing comprise the steps of, wherein t1And t2Respectively routing node is on super road
By the number in node, 0≤t1≤ a-1,0≤t2≤ a-1, t1、t2It is integer：
(1) whether the routing node where detecting current routing node and purpose terminal is same routing node：
If so, using purpose terminal as next-hop node, path finding terminates；
If it is not, then enter step (2)；
(2) routing node where current routing node and purpose terminal is detected whether in same super routing node：
If so, using purpose routing node as next-hop node；It enters step (1)；
If it is not, then enter step (3)；
(3) detect the place of the super routing node and purpose terminal where current routing node super routing node whether phase
Even：
If so, the routing node that current super routing node is connected with the super routing node of purpose is as next-hop；Into
Step (1)；
If it is not, then enter step (4)；
(4) the public super routing node with current super routing node and the super routing node of purpose is found, it then will be current
Super routing node, as next-hop, enters step (1) with the routing node that public super routing node is connected.
5. the method for routing of the flexible extensive interconnection network topological structure of low diameter of exponent number as claimed in claim 4, special
Sign is, in the step (1), whether the routing node where detecting current routing node and purpose terminal is same routing
Node, method are as follows：
Detect the routing node (a where current messagei0ai1...aik...ai(n-1),k,t1) and purpose terminal
(aj0aj1...ajk...aj(n-1),s,t2, c) where routing node (aj0aj1...ajk...aj(n-1),s,t2) whether it is same
Routing node detects whether to meet aik=ajk, k=s and t1=t2；
If aik=ajk, k=s and t1=t2, show that the routing node where message and the routing node where purpose terminal are same
One routing node, then by purpose terminal (aj0aj1...ajk...aj(n-1),s,t2, c) and as next-hop node, path finding knot
Beam；
Otherwise, aik≠ajkOr k ≠ s or t1≠t2, show the routing node where message and the routing node where purpose terminal
It is not same routing node, enters step (2).
6. the method for routing of the flexible extensive interconnection network topological structure of low diameter of exponent number as claimed in claim 4, special
Sign is, in the step (2), whether detects the routing node where current routing node and purpose terminal same super
In routing node, method is as follows：
Routing node (a where detection messagesi0ai1...aik...ai(n-1),k,t1) and purpose terminal where routing node
(aj0aj1...ajk...aj(n-1),s,t2) whether in same super routing node, that is, it detects whether to meet aik=ajkAnd k=
s；
If aik=ajkAnd k=s, show the routing node where message and the routing node where purpose terminal same super
In routing node, then by the routing node (a where purpose terminalj0aj1...ajk...aj(n-1),s,t2) as next-hop node,
It goes to step (1)；
Otherwise, aik≠ajkOr k ≠ s, show the routing node where message and the routing node where purpose terminal not same
In a super routing node, then enter step (3).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610040721.4A CN105471749B (en) | 2016-01-21 | 2016-01-21 | The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610040721.4A CN105471749B (en) | 2016-01-21 | 2016-01-21 | The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105471749A CN105471749A (en) | 2016-04-06 |
| CN105471749B true CN105471749B (en) | 2018-06-26 |
Family
ID=55609042
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610040721.4A Active CN105471749B (en) | 2016-01-21 | 2016-01-21 | The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105471749B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108462632B (en) * | 2016-12-09 | 2020-07-14 | 湖南工程学院 | Backbone path extraction method for directed complex network |
| CN109189720B (en) * | 2018-08-22 | 2022-11-25 | 曙光信息产业(北京)有限公司 | Hierarchical network-on-chip topology structure and routing method thereof |
| CN109327255B (en) * | 2018-09-26 | 2023-01-24 | 中国民航管理干部学院 | Routing method and system for unmanned aerial vehicle ad hoc network |
| CN110062301B (en) * | 2019-01-23 | 2021-12-14 | 中通服咨询设计研究院有限公司 | Routing method, device, equipment and storage medium |
| CN111030927B (en) * | 2019-11-20 | 2021-07-23 | 中国人民解放军国防科技大学 | Network-on-chip routing method and network router with sequential perception |
| CN112988651B (en) * | 2021-05-12 | 2021-10-15 | 北京壁仞科技开发有限公司 | Computing system, computing processor, and data processing method |
| CN113271267B (en) * | 2021-05-18 | 2022-04-22 | 清华大学 | Interconnection network, adaptive routing method, apparatus, electronic device, and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103907322A (en) * | 2011-11-09 | 2014-07-02 | 甲骨文国际公司 | System and method for providing deadlock free routing between switches in a fat-tree topology |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9130858B2 (en) * | 2012-08-29 | 2015-09-08 | Oracle International Corporation | System and method for supporting discovery and routing degraded fat-trees in a middleware machine environment |
-
2016
- 2016-01-21 CN CN201610040721.4A patent/CN105471749B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103907322A (en) * | 2011-11-09 | 2014-07-02 | 甲骨文国际公司 | System and method for providing deadlock free routing between switches in a fat-tree topology |
Non-Patent Citations (2)
| Title |
|---|
| "Slim fly: A cost effective";Maciej Besta and Torsten Hoefler;《International Conference for High Performance Computing, Networking, Storage and Analysis》;20141231;第348-359页 * |
| "SuperStar：一种可扩展高阶互连拓扑结构";雷斐，董德尊，廖湘科;《计算机工程与科学》;20140630;第1034-1041页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105471749A (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105471749B (en) | The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing | |
| Chen et al. | The features, hardware, and architectures of data center networks: A survey | |
| Besta et al. | Slim fly: A cost effective low-diameter network topology | |
| CN105138493B (en) | Non-exchanger network construction system and method suitable for parallel operation | |
| CN104185999A (en) | Packet-flow interconnect fabric | |
| CN102780628B (en) | On-chip interconnection network routing method oriented to multi-core microprocessor | |
| CN107612746A (en) | A kind of method, Torus networks and the routing algorithm of structure Torus networks | |
| Wang et al. | Designing efficient high performance server-centric data center network architecture | |
| CN105119833A (en) | Hybrid interconnection structure for network-on-chip, network node encoding method and hybrid routing algorithm thereof | |
| CN101267394A (en) | No dead lock plane self-adapted routing method in 3-D mesh | |
| Furhad et al. | A shortly connected mesh topology for high performance and energy efficient network-on-chip architectures | |
| CN108768864B (en) | Data center network topology system easy to expand and high in fault tolerance | |
| Cai et al. | Design and OPNET implementation of routing algorithm in 3D optical network on chip | |
| Seyednezhad et al. | Routing design in optical networks-on-chip based on gray code for optical loss reduction | |
| Jiang et al. | A test method of interconnection online detection of NoC based on 2D Torus topology | |
| Bishnoi | Hybrid fault tolerant routing algorithm in NoC | |
| Ingle et al. | Mesh topology of NoC architecture using source routing algorithm | |
| Li et al. | VBNet: A VLC Enabled Hybrid Data Center Network | |
| CN107104909B (en) | Fault-tolerant special network-on-chip topology generation method | |
| Jahanshahi et al. | Interconnection Networks | |
| Guo | Research on Network Architecture Design Based on Artificial Intelligence Application Technology | |
| Huang et al. | SCautz: a high performance and fault-tolerant datacenter network for modular datacenters | |
| Zhu et al. | A low latency and high efficient three-dimension Network-on-Chip based on hierarchical structure | |
| Kumar et al. | A Survey on Efficient Interconnects for Neuromorphic Systems | |
| Bose et al. | A scalable noc topology targeting network performance |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |