CN100555977C - Efficient middle long-range method for routing based on the MPU network topology architecture - Google Patents

Abstract

The present invention relates to a kind of efficient middle long-range method for routing based on the MPU network topology architecture, comprise the steps: to set up the geometric coordinate system based on the MPU topological structure, each node of described MPU topological structure is uniquely corresponding to a geometric coordinate point; All nodes are unified the physics numbering, promptly,, cross over each dimension then successively according to coordinate growing direction serial number from first dimension of geometric coordinate; Based on above-mentioned geometric coordinate system and physical coordinates system, setting up a cover is guiding, dynamic relative coordinate system with the information exchange; Utilize the Virtual Channel technology, obtain the set of a Virtual Channel in the route network, above-mentioned set is divided into adaptability virtual network and certainty virtual network; In described adaptability virtual network, carry out the information route; In described certainty virtual network, carry out the information route.Above-mentioned routing algorithm has high scalability and adaptivity, and fault-tolerant ability is strong.

Description

Efficient middle long-range method for routing based on the MPU network topology architecture

Technical field

The present invention relates to the method for routing of multicomputer system interference networks, in particular, relate to efficient middle long-range method for routing based on the MPU network topology architecture.

Background technology

The interconnected network system of supercomputer inside, route network system especially for information exchange between node, be the especially key factor of scalability of the ultra-large concurrent computational system performance of decision, and the performance of route network system depend mainly on topological structure, the network bandwidth and delay and the routing algorithm of the interference networks that adopted.The low interference networks that postpone of high bandwidth are necessary conditions that super computer system can obtain enhanced scalability, high availability.But above-mentioned network performance is to a great extent by the method for routing decision of being adopted.That is to say that can the network topology characteristic performance be brought into play and utilize also to need to obtain effective routing algorithm and realize fully.Thus, method for routing and topological structure need cooperation mutually to guarantee the high-performance of whole super concurrent computational system.

Before this, the inventor has applied for that application number is 200610029753.0, denomination of invention is that " the inside and outside connecting network topology framework reaches from being in harmony the concurrent computational system of expanding this framework " and application number are 200610030472.7, denomination of invention is the invention of " be in harmony certainly multistage tensor expanding method and many MPU concurrent computational system ", a kind of superelevation expansion parallel computation inside and outside connecting network and multistage tensor extended network system thereof based on MPU interference networks topological structure proposed, the super concurrent computational system of promptly many MPU.Described MPU framework is a kind of K dimension interconnected network system, and each node wherein all is positioned at 2 ^KThe K that individual adjacent node is formed ties up cubical body-centered, and simultaneously can be with above-mentioned 2 ^KIndividual adjacent node interconnection, the node at described network system boundary is positioned at 2 ^KThe virtual K that individual adjacent node and topological circulation mapping node are formed ties up cubical body-centered, and simultaneously with above-mentioned 2 ^KIndividual node interconnection.The present invention will be with regard to a kind of new-type network topological structure, and promptly the MPU system provides its corresponding routing algorithm and information exchange system, in the hope of network performance, fault-tolerant ability and the autgmentability of excavating the MPU system to greatest extent.Below, we provide the major scheme and the implementation thereof of routing algorithm System Design in conjunction with the concrete feature of MPU interconnected network system.

Summary of the invention

The technical problem to be solved in the present invention is to provide a kind of efficient middle long-range method for routing based on the primary processor network topology architecture, to bring into play the MPU network performance to greatest extent.

In order to achieve the above object, technical scheme of the present invention is as follows:

A kind of efficient middle long-range method for routing based on the MPU network topology architecture comprises the steps: to set up the geometric coordinate system based on the MPU topological structure, and each node of described MPU topological structure is uniquely corresponding to a geometric coordinate point; All nodes are unified the physics numbering, promptly,, cross over each dimension then successively according to coordinate growing direction serial number from first dimension of geometric coordinate; Based on above-mentioned geometric coordinate system and physical coordinates system, setting up a cover is guiding, dynamic relative coordinate system with the information exchange; Utilize the Virtual Channel technology, obtain the set of a Virtual Channel in the route network, above-mentioned set is divided into adaptability virtual network and certainty virtual network; In described adaptability virtual network, carry out the information route; In described certainty virtual network, carry out the information route.

Above-mentioned method for routing has high scalability and adaptivity, and fault-tolerant ability is strong.Specific performance is described as follows:

Connective: the ability that information is routed to any destination node from any source node.In the method for routing that proposes, though whole route network has been divided into two virtual networks,, each virtual network can not isolated the connectedness on the topological structure.

Adaptivity: when competing and be congested, by the ability of candidate's passage routing iinformation in system.In the MPU system, exist a large amount of optional passages between node so that more communication bandwidth to be provided.So in the adaptability route stage in routing algorithm, we not only allow to select for use optimal path to come transmission information, but also under some condition, allow to select for use the path of detouring to come transmission information.So just relax the feasible path scope that is used for the information route greatly, correspondingly increased the available bandwidth that routing algorithm can provide for the information transmission.

The property avoided of deadlock and livelock: guarantee the ability that information can not be blocked or for good and all go around in network.The information of suitably forcing in the routing algorithm route conditions that detours can be avoided the livelock phenomenon effectively.In addition, the deadlock-free certainty route stage, flee from passage as the deadlock in adaptability route stage, can avoid the deadlock of whole route system to take place effectively.

Fault-tolerance: under system scale and the rapid situation about increasing of complexity, system's necessary energy continuous service, the unlikely serviceability of losing whole system because of the temporary transient inefficacy of minority node or local parts.In conjunction with the alternative link that the MPU system can provide, the self adaptation route stage can offer whole route system greater flexibility, to guarantee the fault-tolerant ability of failure node or link.

High scalability: the MPU interconnected network system itself has higher autgmentability, so the routing algorithm that adopts must also should have corresponding extended capability, with the expansion of adaptive system scale.One of method that reaches this purpose be exactly the routing algorithm that proposed fully based on distributed route thought, can not increase with the complexity that guarantees routing algorithm with the expansion of network size.

Description of drawings

Fig. 1 is the geometric coordinate system diagram of one 2 dimension MPU (4 * 4) system.

Fig. 2 is one to be the relative coordinate system of MPU (4 * 4) system of PU0 based on the information destination address.

Fig. 3 is in one 2 dimension MPU system, to the definition schematic diagram of 4 channel direction of each node.

Fig. 4 ties up in the MPU system at one 2, utilizes the geometric coordinate system, judges the schematic diagram of the geometric coordinate of the adjacent contact on 4 channel direction.

Fig. 5 ties up in the MPU system at one 2, the enforcement illustration of the adaptability virtual network of each node, and wherein every uni-directional physical link is corresponding to two Virtual Channels.

Fig. 6 is on relative coordinate system basis shown in Figure 2, the sign picture of the optimal direction of all PU, suboptimum direction and negative direction.

Fig. 7 is on relative coordinate system basis shown in Figure 2, the sign picture of the optimal direction of all SU, suboptimum direction and negative direction.

Fig. 8 is based on the 2 dimension Bubble router schematic diagrames that scheme one is proposed.

Fig. 9 is based on the 2 dimension height Virtual Channel router schematic diagrames that scheme two is proposed.

Figure 10 is in 2 dimension MPU systems, a schematic diagram of VDOR algorithm thought in the certainty virtual network.

Embodiment

According to Fig. 1 to Figure 10, provide preferred embodiment of the present invention, and described in detail below, enable to understand better function of the present invention, characteristics.

At known K dimension MPU (N ₁* N ₂* ... * N _K) in the topological structure, from the viewpoint of route network, processing node and communication node all can be considered switching node, abbreviate node as.So the MPU system that the still indirect network that the routing algorithm that the present invention proposes connects for straight-forward network connects all is suitable for.

MPU system Cartesian coordinate system: the geometric coordinate system is the most direct a kind of addressing method.Relative link position according to MPU topological structure and node self is embedded into whole network system in the cartesian coordinate system, and like this, each node will be uniquely corresponding to a geometric coordinate point, promptly is called the geometric coordinate of this node.Fig. 1 is the geometric coordinate system of MPU (4 * 4) system.To arbitrary node, we might as well establish its geometric coordinate is x=(x ₁, x ₂..., x _i∈ [0,2N _i-1] and x _i Mod 2=x _j Mod 2 $\∀i,j\∈[1,K].$ Since then, mod represents the modulo operation symbol.

Simultaneously, in order to indicate each node uniquely, we introduce the physics numbering system of a cover based on the nonnegative integer addressing again.Based on the geometric coordinate position of each node,,, cross over each dimension then successively according to the direction serial number that coordinate increases from first dimension of geometric coordinate.To arbitrary node x, establish its physics and be numbered $D\left(x\right)\∈[\mathrm{0,2}\underset{j=1}{\overset{K}{\mathrm{\Π}}}{N}_j-1].$ Physics numbering D (x) and geometric coordinate x=(x ₁, x ₂..., x _k) conversion relational expression of system is as follows:

In the following formula, Expression is the rounding operation symbol down, down together.Particularly, at two-dimentional MPU (N ₁* N ₂) in the system, we have

At three-dimensional MPU (N ₁* N ₂* N ₃) in the system, we have

Utilize the geometric coordinate system, we judge two adjacent character of node at an easy rate.There are these two nodes of physical link direct interconnection in two adjacent being meant of node.To K dimension MPU system, establish node x=(x ₁, x ₂..., x _k) and y=(y ₁, y ₂..., y _k), if satisfy:

|x _i-y _i|＝1 $\∀i\∈[1,K]---\left(3\right)$

We just claim node x adjacent with y, otherwise node is non-conterminous.

Though physics numbering and geometric coordinate system can unique easily each nodes of sign, and the topology location that reflects them, but information communication does not but have direct correlation between both and node, also with the source address of a customizing messages and destination address without any related.Therefore, we introduce a cover with the information exchange be guiding, dynamic coordinate system system, i.e. relative coordinate system.Overlap coordinate system with this and consider routing decision, not only can simplify route computational process, but also can be in when decision-making, needn't consider route network itself around connection and topological cycle specificity, alleviated the complexity of routing algorithm.The foundation of relative coordinate system both according to the geometric coordinate system, is considered the source address and the destination address of a customizing messages again, and the ring characteristics and the network diameter of MPU topological structure itself.The relative coordinate system makes up rule:

For an information specific, with the geometric coordinate translation of its destination node is the initial point of relative coordinate system, the geometric coordinate of source node according to the topological recursive nature of MPU framework, and the distance of observing the solstics of whole relative coordinate system and initial point be not more than the constraints of network diameter, being evenly distributed in the initial point is that the center of circle, network diameter are in the scope of radius.Coordinate system by after such conversion is called the relative coordinate system based on this information, abbreviates the relative coordinate system as.

Euclidean distance between node pair unit is hop, and hop is meant the jumping from a node to its neighbor node.The conversion relational expression of geometric coordinate system and relative coordinate system is as follows.At K dimension MPU (N ₁* N ₂* ... * N _K) in the system, the geometric coordinate of establishing residing present node of an information and destination node is respectively $s=({\mathrm{<figure-callout\; id="1"\; label="x\; s"\; filenames="C20061011770400242.png,C20061011770400261.png"\; state="\{\{state\}\}">x</figure-callout>}}_s^{},{\mathrm{<figure-callout\; id="2"\; label="x\; s"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">x</figure-callout>}}_s^{},\&CenterDot;\&CenterDot;\&CenterDot;,x_s^K)$ With $d=(x_{\mathrm{<figure-callout\; id="1"\; label="d"\; filenames="C20061011770400242.png,C20061011770400261.png"\; state="\{\{state\}\}">d</figure-callout>}}^1,x_{\mathrm{<figure-callout\; id="2"\; label="d"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">d</figure-callout>}}^2,\&CenterDot;\&CenterDot;\&CenterDot;,x_d^K),$ The relative coordinate of the residing present node of this information then $r=({\mathrm{<figure-callout\; id="1"\; label="r\; s"\; filenames="C20061011770400242.png,C20061011770400261.png"\; state="\{\{state\}\}">r</figure-callout>}}_s^{},{\mathrm{<figure-callout\; id="2"\; label="r\; s"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">r</figure-callout>}}_s^{},\&CenterDot;\&CenterDot;\&CenterDot;,r_s^K)$ Be

$r_s^i=\left\{\begin{array}{ccc}{x}_s^i-x_d^i& \mathrm{if}|x_s^i-x_d^i|<N& \\ \&PlusMinus;N& \mathrm{if}|x_s^i-x_d^i|=N& \&ForAll;i=[1,N]\\ x_s^i-x_d^i-\mathrm{sign}(x_s^i-x_d^i)\&times;2N& \mathrm{if}|x_s^i-x_d^i|>N& \end{array}\right.---\left(4\right)$

Sign function sign (x) in the following formula is defined as follows:

The relative coordinate of its destination node is an initial point.Since the relative coordinate of the destination node of any information all be (0,0 ..., 0), so we claim the coordinate of the relative coordinate of a residing present node of information for this information later on.In the process that information is transmitted, its coordinate is always in conversion, when destination node, the coordinate of information become (0,0 ..., 0).To coordinate system, we can calculate wherein arbitrary node x=(x based on a specific phase ₁, x ₂..., x _k) to the optimal path length of initial point:

$\mathrm{dist}\left(x\right)=\underset{\&ForAll;j\&Element;[1,K]}{\max }\left\{\right|x_j\left|\right\}---\left(6\right)$

Based on the relative coordinate system, next we introduce two-stage distributed routing algorithm.

In theory, we can separately discuss route network information exchange mechanism and routing algorithm.Yet in order more effectively Internet resources to be used, we produce following some basic assumption for the message switching equipment of route network:

Suppose that 1 arrives the information of destination node, in the limited time, be absorbed, do not have node to own forwarding information.

Suppose 2 before the transmission beginning, the information of each independent route is broken down into some information microplates, and all microplates pass through route network in order.Microplate (essential information that includes route) is routed when arriving an intermediate node, and keeps the channel resource that is distributed.The data microplate is following closely by these passages that is retained.The tail microplate is responsible for discharging the channel resource that is occupied.Each information flow ability of swimming transmits by route network.

Suppose that 3 utilize the Virtual Channel technology, allow some Virtual Channels, share a physical link in time-multiplexed mode.In each moment, a Virtual Channel only allows to receive the microplate that comes from same information.

Suppose 4 when node injects fresh information in route network, have only the available output channel that has a free time, information just can be injected into network, otherwise information will be blocked in source node.

Suppose the routing decision of 5 information, depend on states such as present node, destination node and output channel be idle or busy, and do not depend on source node.Information is that to mail to the situation of destination node from present node similar.This distributed method for routing has guaranteed that whole route system is the same with whole interference networks and can expand neatly.

Based on the time-division multiplex technology of physical channel, we obtain the set of a Virtual Channel in the route network, and then we are divided into two virtual networks with this set: adaptability virtual network and certainty virtual network.A virtual network is one group of set that is used for the Virtual Channel of special-purpose, and each virtual network all keeps the connectedness of original route network.Not shared Virtual Channel between two virtual networks, every Virtual Channel in the route network all belongs to one of them virtual network.In different virtual networks, we use different routing algorithms, different information exchange mechanism and Flow Control modes come route information.

In the adaptability virtual network, we adopt non-optimum road, adaptivity routing algorithm.This algorithm is intended to maximally utilise the link channel that route network can provide, for the information route provides maximum available bandwidth.This algorithm not only allows to utilize all optimal paths, and under certain constraints, can utilize some passages that detour to come route information, with flexibility and the adaptability that increases route system greatly.

Though the adaptability routing algorithm can utilize alternative link to come route information fully, can not avoid deadlock fully.If for the more restriction of adaptability route increase or with further increase Virtual Channel is that cost is avoided deadlock, that will sacrifice the part adaptivity of adaptability route, and the route that increases information postpones.So we introduce a kind of deadlock based on timeout mechanism and survey and prevention system, and auxiliary certainty virtual network, flee from passage as the deadlock in adaptability route stage.When an information is stopped up in the adaptability virtual network for a long time, it will be surveyed with prevention system by deadlock and be considered as the potential information that may cause deadlock, this information will be ejected from Adaptive Networking so, continues route among transferring to deadlock-free deterministic network.

The adaptability routing algorithm is mainly used in the routing decision of information in the adaptability virtual network.Except the above-mentioned essential information exchanging mechanism hypothesis of mentioning, we propose 2 additional message switching equipment false makings and establish again at the characteristics of routing algorithm in the adaptability virtual network:

Suppose on 1 each node that every uni-directional physical passage has two Virtual Channels, self adaptation Virtual Channel 1 (AVC1) and self adaptation Virtual Channel 2 (AVC2) are corresponding to the adaptability virtual network.Every Virtual Channel is to there being the automatic adaptation cushion formation of oneself.

Suppose the exchanges data in the 2 adaptability virtual networks, adopt virtual cut-through (VirtualCut-through, VCT) exchanging mechanism, and every pairing buffer of Virtual Channel information unit of available buffer at least.Like this, when offered load was low, the VCT exchange was similar to worm channel exchange (wormhole-switching) mechanism, can reduce the delay of information communication effectively, increases bandwidth utilization.When offered load was high, the VCT exchange was similar to packet switch (packet-switching) mechanism again.When the information header microplate is blocked in a certain intermediate node,, be buffered in this intermediate node until full detail because the whole information of buffer available buffer can move on to guarantee data microplate thereafter.Thereby reduced the correlation of the non-conterminous passage in the passage correlation diagram, reduced the probability that deadlock takes place greatly.

What need explanation a bit is that the information exchange mechanism necessary condition of described adaptability routing algorithm is: have a Virtual Channel on every uni-directional physical passage at least to guarantee the connectedness of adaptability virtual network; Data exchange ways can adopt the worm channel exchanging mechanism.Here utilize the VCT exchanging mechanism of two Virtual Channels and band buffering, is in order more effectively to utilize bandwidth and to reduce the probability that deadlock takes place.In fact, based on the time-division multiplex technology of link, we can utilize many Virtual Channel arbitrarily, but the increase of Virtual Channel quantity also can correspondingly increase the delay of data communication, so will remain in the reasonable range.In addition, if physical resource allows, we also can increase the buffer size in the VCT exchange, reduce the probability of happening of deadlock further.Such as, every pairing buffer queue of Virtual Channel, a plurality of information units of available buffer.So when implementing exchanging mechanism, we can be according to technical conditions, improved neatly and expand, and routing algorithm all meets the demands.

In the adaptability virtual network, method for routing:

Step 1 packets of information during route, according to the operating position of automatic adaptation cushion formation at that time, is selected in two Virtual Channels (AVC1 and AVC2) for use in Adaptive Networking.

Step 2 is when packets of information during in certain intermediate node route, and the route function is responsible for from 2 ^KIn the individual channel direction, choose some qualified candidate's channel direction.On qualified candidate's channel direction, if there is idle available output channel, then information is gone to downstream node.The selection algorithm of qualified candidate's channel direction will be described in detail below.

If step 3 information in determined qualified candidate's channel direction by step 2, can not obtain idle available output channel, deadlock detection and the prevention system based on timeout mechanism will start so.If the information duration of congestion has surpassed the setting threshold values, then be regarded as the factor of a potential initiation deadlock, continue route and be transferred in the deadlock-free deterministic network.

At K dimension MPU (N ₁* N ₂* ... * N _K) in the system, each node has 2 ^KIndividual channel direction, qualified candidate's channel direction will from this 2 ^KChoose in the individual channel direction.In order to identify these channel direction, we define above-mentioned 2 respectively ^KIndividual channel direction corresponding 2 ^KIndividual direction vector

For:

Wherein i ∈ [0,2 ^K-1],

J component general formula be expressed as: $\&ForAll;j\&Element;[1,K].$

Thus, we see that there is a direction vector in the arbitrary neighbor node y for node x

Satisfy: $\stackrel{\&RightArrow;}{e}=y-x.$ Otherwise, for the either direction vector of node x

All there is a neighbor node y, satisfies: $y=x+\stackrel{\&RightArrow;}{e}.$ So the neighbor node set is one to one with being gathered by the direction vector of (7) definition.

The selection algorithm of qualified candidate's channel direction is based on the coordinate of a certain customizing messages, gives a preferred value with each channel direction of present node, chooses the channel direction that satisfies condition according to different preferred values as qualified candidate's channel direction.If the coordinate of customizing messages is x=(x ₁, x ₂..., x _k).

Optimal direction is meant information along this channel direction route, can find an optimal path between present node and destination node.Certainly, because symmetry, the passage that has optimal direction is not unique.For the passage that has optimal direction, preferred value is set at 1, i.e. limit priority.Its criterion is, Be optimal direction, and if only if, and it satisfies:

$\mathrm{dist}(x+\stackrel{\&RightArrow;}{e})=\mathrm{dist}\left(x\right)-1---\left(8\right)$

Our false coordinate Still within the prescribed limit of relative coordinate system.If coordinate

The prescribed limit that exceeds relative coordinate system then utilizes formula (4) to adjust coordinate

Making it translation is legal relative coordinate.

Suboptimum direction, the information that is meant be along this channel direction route, between present node and destination node, can only set up one under the best situation and Duo 2 sub-optimal paths of jumping than optimal path.The passage that has the suboptimum direction is more not unique.For the passage that has the suboptimum direction, preferred value is set at 2.Its criterion is,

Be the suboptimum direction, and if only if, and it satisfies:

$\mathrm{dist}(x+\stackrel{\&RightArrow;}{e})=\mathrm{dist}\left(x\right)+1---\left(9\right)$

And $\&Exists;j\&Element;[1,K),$ Make sign (e ^(j)) x _jSign (e ^(j+1)) x _J+1(10)

Note coordinate in the formula (9)

Processing and formula (8) in consistent.

Negative direction is meant except above-mentioned two kinds channel direction, and remaining channel direction is referred to as negative direction.At each node, for an information specific, negative direction is unique or does not exist.For the passage that has negative direction, preferred value is set at 3, i.e. lowest priority.Its criterion is,

Be negative direction, and if only if, and it satisfies:

$\mathrm{dist}(x+\stackrel{\&RightArrow;}{e})=\mathrm{dist}\left(x\right)+1---\left(11\right)$

And $\&ForAll;j\&Element;[1,K),$ Sign (e is all arranged ^(j)) x _j=sign (e ^(j+1)) x _J+1(12)

Note coordinate in the formula (11)

Processing and formula (8) in consistent.

Based on channel direction priority algorithm recited above, we provide the selection algorithm of qualified candidate's channel direction:

Algorithm 1 is 3 channel direction for priority.In the routing procedure of each information from the source node to the destination node, allowing at most by M priority is 3 channel direction.Wherein, M is limited nonnegative integer.

Algorithm 2 is 2 channel direction for priority.If it is 2 channel direction that information has been passed through priority, during twice channel direction is selected subsequently, must all be that priority is 1 channel direction then at it.That is to say, priority sequence 2 → 1 → 1 → ... allow, but priority sequence 2 → 1 → 2 → ... or 2 → 2 → ... be unallowed.

Algorithm 3 retraction restrictive conditions.When information adopted a priority greater than 1 channel direction routing forwarding, retraction was forbidden.

Notice that if rule 2 changes into: it is 2 channel direction that regulation allows at most by N priority, and N is limited nonnegative integer, and the adaptability routing algorithm also is suitable for so, and does not have livelock.That is to say, rule 1 and 2 common guarantee in the adaptability route stage, the routing times that detours is limited.

In sum, in the adaptability virtual network, for arbitrary information, all optimal paths, promptly the channel direction of limit priority is optionally at any time, simultaneously, and the path of detouring of part, promptly suboptimum direction and negative direction also are that condition is optional.Next, based on above-mentioned qualified candidate's channel direction selection algorithm, the no livelock that we provide the adaptability routing algorithm proves.

The above-mentioned adaptability routing algorithm of theorem is no livelock.

Proof: at K dimension MPU (N ₁* N ₂* ... * N _K) in the system, establishing the optimal path of an information specific from the source node to the destination node is that m jumps, then

$0<m=\mathrm{dist}\left(x_s\right)\&le;\underset{\&ForAll;j\&Element;[1,K]}{\max }\left\{N_j\right\}---\left(13\right)$

Wherein, x _sBe meant the coordinate of information at source node.If L is the optimal path length from the present node to the destination node.At source node place, L=m.If it is 3 channel direction that information has been passed through a priority, then L becomes L+3.If it is 2 channel direction that information has been passed through a priority, then L becomes L+1.If it is 1 channel direction that information has been passed through a priority, then L becomes L-1.

By the selection algorithm of qualified candidate's channel direction, we know: priority is that 3 channel direction can only be chosen M time at most, so L → L+3 only has the possibility that takes place M time.And choose priority is after 2 the channel direction, choose 2 priority continuously and be 1 channel direction, so total effect is L → L+1-1-1=L-1.Thus, there is the upper limit in the L value, and is $0<m+4M\&le;\underset{\&ForAll;j\&Element;[1,K]}{\max }\left\{N_j\right\}+4M.$ And L is absolute decreasing function.So L=0 always can reach in fintie number of steps, promptly destination node is always at fintie number of steps Nei Keda.So adaptive routing algorithm is that no livelock takes place.Card is finished.

Before formal narration certainty routing algorithm, we at first introduce some symbols and definition.At known K dimension MPU (N ₁* N ₂* ... * N _K) in the system, each node has 2 ^KIndividual channel direction: J ∈ [0,2 ^K-1] corresponding to 2 ^K_1Individual direction that is to say, on each direction all just to two rightabout passages should be arranged, that is: for any channel direction

Exist ${\stackrel{\&RightArrow;}{e}}_j+{\stackrel{\&RightArrow;}{e}}_{2^K-j-1}=0\&ForAll;j\&Element;[0,2^{K-1}-1].$ We choose this 2 ^K_1The direction of K specific linear independence is formed one group of base in the K dimension space in the individual direction: $d=\{{\stackrel{\&RightArrow;}{D}}_j:j\&Element;[0,K-1\left]\right\},$ Wherein

${\stackrel{\&RightArrow;}{D}}_j=\left\{\begin{array}{cc}{\stackrel{\&RightArrow;}{e}}_0& j=0\\ {\stackrel{\&RightArrow;}{e}}_{2^{j-1}}& j\&Element;[1,K-1]\end{array}\right.---\left(14\right)$

$-{\stackrel{\&RightArrow;}{D}}_j=\left\{\begin{array}{cc}{\stackrel{\&RightArrow;}{e}}_{2^K-1}& j=0\\ {\stackrel{\&RightArrow;}{e}}_{2^K-2^{j-1}-1}& j\&Element;[1,K-1]\end{array}\right.---\left(15\right)$

If a given information coordinate is x=(x ₁, x ₂..., x _k), define " step " function thus

$\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_j\right)=\left\{\begin{array}{cc}\frac{1}{2}(\underset{i=2}{\overset{K}{\mathrm{\&Sigma;}}}{x}_i-(K-3)x_1)& j=0\\ \frac{x_1-x_{K+1-\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">j</figure-callout>}}}{2}& \&ForAll;j\&Element;[1,K-1]\end{array}\right.---\left(16\right)$

So, but a linear combination of base in the total described K dimension space of telogenesis of vector x, that is:

$x=\underset{j=0}{\overset{K-1}{\mathrm{\&Sigma;}}}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_j\right)\&CenterDot;{\stackrel{\&RightArrow;}{D}}_j)---\left(17\right)$

In fact, the direction that we can choose K linear independence is arbitrarily formed one group of substrate in the K dimension space, but a linear combination of the total such substrate of telogenesis of the coordinate of information.Below, we introduce concrete routing algorithm, (2) information exchange and (3) flow-control mechanism in (1) certainty route stage.

The certainty virtual network is to be used for providing the deadlock-free passage of fleeing from for the adaptability virtual network.For this reason, we at first choose one group of base in K dimension MPU system, utilize this group base to set up out a virtual K dimension around net in K dimension MPU topological structure.Like this, this virtual K dimension had both guaranteed the connectedness of whole certainty virtual network around net, make again existing deadlock avoidance mechanism for k-ary n-cube successfully expanded application in the MPU topological structure.Based on this, we mainly provide two kinds of solutions that make up no deadlock certainty virtual network.Scheme one: avoid technology by the deadlock that the restriction message injects; Scheme two: the deadlock by height Virtual Channel restriction route function is avoided technology.Scheme one is to adopt the Bubble condition deadlock that [1,2] proposed to avoid the expanded application of technology in the MPU framework, and method for routing then is to adopt this scheme in the 3-D Torus network of Blue Gene.Scheme two is that a famous certainty adopting [3] proposition does not have deadlock route function, the expanded application in the MPU framework.

Scheme one: the certainty routing algorithm (Bubble condition) that injects restriction based on message.Except the above-mentioned essential information exchanging mechanism hypothesis of mentioning, we propose following 2 additional message switching equipments false makings and establish at the characteristics of routing algorithm in the certainty virtual network of scheme one proposition:

Suppose that 1 adopts virtual cut-through (Virtual Cut-through) exchanging mechanism.Every pairing buffer queue of Virtual Channel can cushion two packets of information units at least.

Suppose that 2 utilize the Virtual Channel technology, the certainty virtual network has 2K available channel direction on each node, promptly

J ∈ [0, K-1].

The deadlock that scheme one is proposed is avoided technology, is inapplicable for worm channel (wormhole) exchanging mechanism.By the narration of front as can be known: the coordinate x=(x of each information ₁, x ₂..., x _k) all can go out by one group of base d linear list of (14) (15) definition, then the coordinate of information is at base $d=\{{\stackrel{\&RightArrow;}{D}}_0,{\stackrel{\&RightArrow;}{D}}_1,\&CenterDot;\&CenterDot;\&CenterDot;,{\stackrel{\&RightArrow;}{D}}_{K-2},{\stackrel{\&RightArrow;}{D}}_{K-1}\}$ Under new coordinate be: $\stackrel{\&OverBar;}{x}=(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right),\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right),\&CenterDot;\&CenterDot;\&CenterDot;,\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_{K-1}\right)).$ Be similar to dimension preface route (DOR) algorithm, information does not have the deadlock route network in certainty, passes through each dimension successively along the optimal path ascending order, that is:

J=0,1 ..., K-1 arrives destination node.When crossing over the j dimension, if $\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_j\right)>0,$ Then choose

Channel direction; If $\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_j\right)<0,$ Then choose Channel direction; If $\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_j\right)=0,$ Illustrate that then present node and destination node do not have side-play amount in the j dimension.We deserve to be called the routing plan of stating and are virtual dimension preface route (VDOR) algorithm under the MPU topological structure.The packets of information of route in the deterministic network, satisfy following message and inject restriction-Bubble condition: for the packets of information of injecting from the adaptability virtual network: this bag has only when it requires the packet-buffering unit of unidirectional ring two free time of existence of injecting, just allows it to be injected into route in the deterministic network; For (the S ∈ [0 when S dimension forwards S+1 dimension route to of the packets of information in the deterministic network, K-2]), this packets of information is regarded as a new packets of information of injecting, that is: have only when its S+1 that requires to inject ties up unidirectional ring and has the packet-buffering unit of two free time, just allow its S+1 that is injected into deterministic network to move in tieing up.Under other situations, when needing only the packet-buffering unit of a route downstream node free time of existence, packets of information can move on.

Theorem: the certainty routing algorithm that scheme one is proposed does not have deadlock.

Proof: as can be known: in each unidirectional ring, always can guarantee to exist the buffer queue of a free time to use, promptly have a bubble, so formation always can be advanced by preceding described Bubble flow-control mechanism.Like this, the Bubble flow-control mechanism has avoided taking place the possibility [1,2] of deadlock in one dimension.In addition, that we adopt in the certainty virtual network is virtual dimension preface route VDOR, and packets of information will so just prevent the generation of deadlock situation on a plurality of dimensions by ascending order successively by each dimension direction.So, just guaranteed that whole certainty virtual network is deadlock-free.And the certainty virtual network is communicated with, and does not share Virtual Channel with the adaptability virtual network, and then the method for routing of whole proposition is that no deadlock takes place.Card is finished.

Scheme two: based on the certainty routing algorithm of height Virtual Channel restriction.Except the above-mentioned essential information exchanging mechanism hypothesis of mentioning, we propose following additional message switching equipment false making and establish at the characteristics of routing algorithm in the certainty virtual network of scheme two propositions:

Suppose that 1 adopts worm channel (wormhole) exchanging mechanism.Every pairing buffer queue of Virtual Channel as long as can cushion some microplates, provides enough routing iinformations to get final product.

Suppose that 2 utilize the Virtual Channel technology, the certainty virtual network has 2K available channel direction on each node, that is:

J ∈ [0, K-1] wherein.

Suppose 3 in the certainty virtual network, the physical link on every available channel direction is all to there being two types of Virtual Channels: high channel (HighVC) and low passage (LowVC).

Because being used for the routing algorithm of worm channel exchange also is effectively for other switching technologies, therefore, unless specifically stated otherwise, routing plan two all is suitable for for all switching technologies.Routing plan two adopts the VDOR mode route that proposes in the routing plan one, and packets of information will deadlock can not take place on multi-dimensional direction.In the unidirectional ring of one dimension, we will avoid deadlock by height Virtual Channel restriction route function.Before the certainty routing algorithm that description scheme two is proposed, we at first introduce some notions and symbol.

Coordinate x=(the x of arbitrary information ₁, x ₂..., x _k) in substrate $d=\{{\stackrel{\&RightArrow;}{D}}_0,{\stackrel{\&RightArrow;}{D}}_1,\&CenterDot;\&CenterDot;\&CenterDot;,{\stackrel{\&RightArrow;}{D}}_{K-2},{\stackrel{\&RightArrow;}{D}}_{K-1}\}$ Under new coordinate be designated as $\stackrel{\&OverBar;}{x}=(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right),\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right),\&CenterDot;\&CenterDot;\&CenterDot;,\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_{K-1}\right)).$ Information will be from source node S, and ascending order is crossed over K direction successively: Along the certainty optimal path, arrive destination node D.Direction

The step-length of last leap is That is to say that information is from S=I ₀Edge at first

The direction route arrives flex point I ₁, forward to then

The direction route arrives flex point I ₂..., and the like, arrive flex point I _K-1, forward at last

Be routed to destination node D on the direction.At each flex point I _jThe place, we note flex point I _jPhysics numbering, be designated as D (I _j).Next information crossing over

On the direction, if the physics of route downstream node numbering is less than D (I _j), then adopt high Virtual Channel HighVC; Otherwise, then adopt low Virtual Channel LowVC, up to next flex point I _J+1Flex point is defined as follows:

I _jIt is a flex point $\&ForAll;j\&Element;[0,K-1]\&DoubleLeftRightArrow;\left\{\begin{array}{c}{I}_O=S\\ I_j=S-{\mathrm{\&Sigma;}}_{k=0}^{j-1}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_k\right)\&CenterDot;{\stackrel{\&RightArrow;}{D}}_k)\&ForAll;j\&Element;[1,K-1]\end{array}\right.---\left(19\right)$

Wherein, S is the coordinate of information decanting point.The arbitrary information of route is up to K such flex point.

What scheme two was proposed limits routing algorithm based on the height Virtual Channel, also is deadlock-free.

Theorem: the certainty routing algorithm that scheme two is proposed does not have deadlock.

Proof: in the unidirectional ring of each dimension, because the restriction of height Virtual Channel has guaranteed that route is a deadlock free ^[3]Be similar to aforesaid scheme one, VDOR mode route has prevented the generation of deadlock situation on a plurality of dimensions again.So the certainty routing algorithm that scheme two is proposed is deadlock-free.And the certainty virtual network is communicated with, and does not share Virtual Channel with the adaptability virtual network, and then the method for routing of whole proposition is that no deadlock takes place.Card is finished.

In sum, we provide the whole method for routing based on the MPU topological structure:

Step 1 is for the information of new injection route network, according to its source node and destination node, and the coordinate of computing information.

Step 2 is for the information of new injection route network, at first is injected into according to its coordinate and carries out route in the adaptability virtual network.

If step 3 does not get clogged in certain intermediate node information, then continue in selected virtual network, to carry out route.Surpass a certain threshold values if information is blocked in the adaptability virtual network, then will be injected into the continuous route of the virtual networking of certainty relaying.

For more thorough, understand design of the present invention and characteristics more intuitively, we will be mainly around 2 dimensions, MPU (4 * 4) systems that utilize indirect network to connect, be described in detail and illustrate in conjunction with the accompanying drawing of being correlated with.In the MPU that is discussed (4 * 4) route network, there are 16 processors and 16 assistants that communicate by letter, have 32 routing nodes altogether, information exchange between responsible node.For MPU (4 * 4) system that utilizes straight-forward network to connect, the viewpoint from route network does not have essential distinction, all is considered as 32 routing nodes.So, no specified otherwise, below alleged MPU (4 * 4) system, all refer to 2 dimensions, MPU (4 * 4) systems that utilize indirect network to connect.Wherein, processing node is called PU, and communication node is called SU.In addition, in conjunction with the route rule of general K dimension MPU system, we provide and are used for two-dimentional MPU (N ₁* N ₂) the concrete computing formula of route system.

Fig. 1 is the physics numbering and the geometric coordinate system diagram of MPU (4 * 4) system.On the border, the node that each empty frame table shows has been represented a topology circulation reflection of node on the physical location among the figure.Below, we are called for short physics numbering is 0 PU, is PU0, the rest may be inferred for other situation.At general MPU (N ₁* N ₂) in the system, the physics of node numbering D (x) and geometric coordinate x=(x, y) conversion relational expression between:

Make up rule according to geometric coordinate system that provides among Fig. 1 and relative coordinate system, in Fig. 2, we have provided one is the figure of relative coordinate system PU0, MPU (4 * 4) system based on the information destination node.In the drawings, the destination node of arbitrary information all is the PU0 that are positioned at coordinate system origin.According to topological recursive nature, all PU and SU, being distributed in 4 is in the scope of radius.Whole relative coordinate system is divided into 4 quadrants, from quadrant I to quadrant IV.For example, one mails to the information of PU0 from PU11, and at source node PU11 place, its coordinate is (2,2), and when it was forwarded to SU7, its coordinate became (1,1).So in the process that packet is transmitted, its coordinate is always in conversion, when destination node, coordinate becomes (0,0).At general MPU (N ₁* N ₂) in the system, the conversion relational expression between geometric coordinate and relative coordinate:

$r=\left\{\begin{array}{cc}{x}_s-x_d& \mathrm{if}|x_s-x_d|<N\\ \&PlusMinus;N& \mathrm{if}|x_s-x_d|=N\\ x_s-x_d-2N& \mathrm{if}(x_s-x_d)>N\\ x_s-x_d+2N& \mathrm{if}(x_s-x_d)<-N\end{array}\right.$ $c=\left\{\begin{array}{cc}{y}_s-y_d& \mathrm{if}|y_s-y_d|<N\\ \&PlusMinus;N& \mathrm{if}|y_s-y_d|=N\\ y_s-y_d-2N& \mathrm{if}(y_s-y_d)>N\\ y_s-y_d+2N& \mathrm{if}(y_s-y_d)<-N\end{array}\right.---\left(21\right)$

Here, (r c) is the coordinate of given information.The geometric coordinate of residing present node of information and destination node is respectively (x _s, y _s) and (x _d, y _d).

Indicated 4 channel direction of a node in MPU (4 * 4) system among Fig. 3:

Direction (Northeast direction),

Direction (Southeast direction),

Direction (Northwest direction) and

Direction (Southwest direction).

According to the geometric coordinate system, we are easy to just can determine the geometric coordinate of the neighbor node of a node.In Fig. 4, (geometric coordinate of the neighbor node on its 4 directions as shown in Figure 4 for x, the y) geometric coordinate of node in one 2 dimension of the expression MPU system.And then according to the conversion relation formula of geometric coordinate and physics numbering, we obtain the physics numbering of neighbor node.

In the adaptability virtual network, establish according to the message switching equipment false making, be connected by a physical link between every pair of neighbor node, there are two Virtual Channel: AVC1 and AVC2 on every uni-directional physical link channel, belong to the adaptability virtual network.Fig. 5 is one 2 and ties up in the MPU system enforcement illustration of adaptability virtual network.

In Fig. 6 and Fig. 7, be the relative coordinate system of PU0, MPU (4 * 4) system based on destination node shown in Figure 2, we indicate the priority level of 4 channel direction of all PU and SU respectively.Wherein, red arrow has indicated optimal direction, and blue arrow has indicated the suboptimum direction, and black arrow has indicated negative direction.

Based on the channel direction priority algorithms in the above-mentioned 2 dimension MPU systems, in conjunction with selection algorithm and the adaptability method for routing of qualified candidate's channel direction, information can be tieed up route in the adaptability virtual network of MPU systems general 2.

For the certainty virtual network of 2 dimension MPU systems, Fig. 8 has provided the 2 dimension Bubble router schematic diagrames that proposed based on scheme one, and Fig. 9 has provided the 2 dimension height Virtual Channel router schematic diagrames that proposed based on scheme two.

For the certainty virtual network that is proposed based on scheme one, (x when y) being injected in the certainty virtual network, selectes substrate as packets of information x= $d=\{{\stackrel{\&RightArrow;}{D}}_0=\left(\mathrm{1,1}\right),{\stackrel{\&RightArrow;}{D}}_1=(1,-1)\},$ Then have

$\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)=\frac{x+\mathrm{<figure-callout\; id="2"\; label="y"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">y</figure-callout>}}{2}$ $\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)=\frac{x-y}{2}---\left(22\right)$

New packets is injected the certainty virtual network step based on scheme one:

1. the direction (VDOR) of selected downstream routing node;

$\mathrm{if}\left((\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)=0)\mathrm{AND}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)=0)\right)\mathrm{then}$

{Destination?is?reached.}

$\mathrm{elseif}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)\&NotEqual;0)\mathrm{then}$

$\{\mathrm{if}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)<0)\mathrm{thentake}{\stackrel{\&RightArrow;}{e}}_0\mathrm{direction}.$

$\mathrm{elsetake}{\stackrel{\&RightArrow;}{e}}_3\mathrm{direction}.\}$

else

$\{\mathrm{if}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)<0)\mathrm{thentake}{\stackrel{\&RightArrow;}{e}}_1\mathrm{direction}.$

$\mathrm{elsetake}{\stackrel{\&RightArrow;}{e}}_2\mathrm{direction}.\}$

2. check fleeing from passage and whether satisfying Bubble and inject restrictive condition of downstream node;

3., then continue to go to downstream node if downstream node satisfies injection condition; Otherwise wait for.

Packets of information is the route step in based on the certainty virtual network of scheme one:

1. if packets of information arrives destination node, then eject network, otherwise through step 2.

2. packets of information checks whether Adaptive Networking exists idle candidate's channel direction, if exist, packets of information then is injected into the adaptability virtual network, otherwise through step 3.

3. in the certainty virtual network, packets of information if be injected into a new unidirectional loop by the time, check that Bubble injects restrictive condition; If still route in the unidirectional ring at place then needs only downstream node and exists the packet-buffering unit of a free time can continue route.

For the certainty virtual network that is proposed based on scheme two, (x when y) being injected into the certainty virtual network, selectes substrate as packets of information x= $d=\{{\stackrel{\&RightArrow;}{D}}_0=\left(\mathrm{1,1}\right),{\stackrel{\&RightArrow;}{D}}_1=(1,-1)\},$ Then have

$\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)=\frac{x+\mathrm{<figure-callout\; id="2"\; label="y"\; filenames="C20061011770400261.png,C20061011770400271.png"\; state="\{\{state\}\}">y</figure-callout>}}{2}$ $\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)=\frac{x-y}{2}---\left(22\right)$

New packets is injected the certainty virtual network step based on scheme two:

1. the direction (VDOR) of selected downstream routing node;

$\mathrm{if}\left((\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)=0)\mathrm{AND}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)=0)\right)\mathrm{then}$

{Destination?is?reached.}

$\mathrm{elseif}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)\&NotEqual;0)\mathrm{then}$

$\{\mathrm{if}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_0\right)<0)\mathrm{thentake}{\stackrel{\&RightArrow;}{e}}_0\mathrm{direction}.$

$\mathrm{elsetake}{\stackrel{\&RightArrow;}{e}}_3\mathrm{direction}.\}$

else

$\{\mathrm{if}(\mathrm{Step}\left({\stackrel{\&RightArrow;}{D}}_1\right)<0)\mathrm{thentake}{\stackrel{\&RightArrow;}{e}}_1\mathrm{direction}.$

$\mathrm{elsetake}{\stackrel{\&RightArrow;}{e}}_2\mathrm{direction}.\}$

2. the physics numbering D (S) of record decanting point S if the physics of downstream node is numbered less than D (S), then chooses high Virtual Channel (HighVC); If the physics of downstream node numbering is then chosen low Virtual Channel (LowVC) greater than D (S).

3., then continue to go to downstream node if downstream node satisfies injection condition; Otherwise wait for.

Packets of information is the route step in based on the certainty virtual network of scheme two:

1., then eject network, otherwise go to step 2 if packets of information arrives destination node.

2. if packets of information arrives a flex point I, the D of this flex point of new record (I) more then, otherwise go to step 3.

3. if the physics of route downstream node numbering is then chosen high Virtual Channel (HighVC) less than D (I); If the physics of route downstream node numbering is then chosen low Virtual Channel (LowVC) greater than D (I).

Figure 10 is in 2 dimension MPU systems, a schematic diagram of VDOR algorithm thought in the certainty virtual network.Wherein, S represents source node, coordinate (x _s, y _s); D represents destination node, i.e. the origin of coordinates; I represents flex point, coordinate ((x _s-y _s)/2, (y _s-x _s)/2).Packets of information from source node S along straight line x-y=x _s-y _sDirection adopts

Channel direction process-(x _s+ y _s)/2 are jumped to and are reached flex point I, turn to the direction along straight line x+y=0 then, adopt

Channel direction is through (x _s-y _s)/2 are jumped to and are reached destination node D.On each direction that need cross over, all take optimum path method.

At certain intermediate node,, then survey and the prevention system startup based on the deadlock of timeout mechanism if information gets clogged in the adaptability virtual network.If surpass specified threshold its blocking time, information will be transferred in the deterministic network, carry out route.Otherwise, information will continue to wait for idle channel.

The front provides the description to preferred embodiment, so that any technical staff in this area can use or utilize the present invention.To this preferred embodiment, those skilled in the art can make various modifications or conversion on the basis that does not break away from the principle of the invention.Be that every simple, equivalence of doing according to the claims and the description of the present patent application changes and modification, all fall into claim protection range of the present invention.

Claims (12)

1, a kind of efficient middle long-range method for routing based on the MPU network topology architecture comprises the steps:

Foundation is based on the geometric coordinate system of MPU topological structure, and each node of described MPU topological structure is uniquely corresponding to a geometric coordinate point;

All nodes are unified the physics numbering, promptly,, cross over each dimension then successively according to coordinate growing direction serial number from first dimension of geometric coordinate;

Based on above-mentioned geometric coordinate system and physical coordinates system, setting up a cover is guiding, dynamic relative coordinate system with the information exchange;

Set up the step of relative coordinate system, promptly for an information specific, with the geometric coordinate translation of its destination node is the initial point of relative coordinate system, the geometric coordinate of source node according to the topological recursive nature of MPU framework, and the distance of observing the solstics of whole relative coordinate system and initial point be not more than the constraints of network diameter, being evenly distributed in the initial point is that the center of circle, network diameter are in the scope of radius;

Utilize the Virtual Channel technology, obtain the set of a Virtual Channel in the route network, above-mentioned set is divided into adaptability virtual network and certainty virtual network; Wherein the certainty virtual network provides the deadlock-free passage of fleeing from for the adaptability virtual network;

In described adaptability virtual network according to described relative coordinate system the coordinate of given information carry out the information route;

In described certainty virtual network according to described relative coordinate system the coordinate of given information carry out the information route.

2, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 1 is characterized in that adaptability virtual network and certainty virtual network are not shared Virtual Channel.

3, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 2, it is characterized in that, in K dimension MPU system, each node is a channel direction to a uni-directional physical link of its neighbor node, and the channel direction number of a node equals neighbours' number of this node.

4, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 3, it is characterized in that, exchanges data in the adaptability virtual network adopts the virtual cut-through exchanging mechanism, and every pairing buffer of Virtual Channel information unit of available buffer at least.

5, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 4 is characterized in that, carries out the information route and comprise the steps: in described adaptability virtual network

On each node, be provided with a Virtual Channel on every uni-directional physical passage at least;

When packets of information during in certain intermediate node route, the route function is responsible for choosing some qualified candidate's channel direction from 2K channel direction; On qualified candidate's channel direction, if there is idle available output channel, then information is gone to downstream node;

If information in determined qualified candidate's channel direction, can not obtain idle available output channel, start so based on the deadlock of timeout mechanism and survey and prevention; If the information duration of congestion has surpassed the setting threshold values, then be regarded as the factor of a potential initiation deadlock, continue route and be transferred in the deadlock-free deterministic network.

6, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 5 is characterized in that described choosing as if the step in qualified candidate's channel direction specifically comprises:

Can find the channel direction of optimal path between present node and destination node, preferred value is set at 1;

Can find to have than optimal path and Duo the channel direction of 2 sub-optimal paths of jumping, preferred value is set at 2;

The preferred value of rest channels direction is set at 3;

For priority is 3 channel direction, and in the routing procedure of each information from the source node to the destination node, allowing at most by M priority is 3 channel direction, and wherein, M is limited nonnegative integer;

For priority is 2 channel direction, is 2 channel direction if information has been passed through priority, during twice channel direction is selected subsequently, must all be that priority is 1 channel direction at it then;

When information adopts a priority greater than 1 channel direction routing forwarding, forbid retraction.

7, as the described efficient middle long-range method for routing of arbitrary claim in the claim 1 to 6 based on the MPU network topology architecture, it is characterized in that, carry out the information route and be included in the known K dimension MPU system in described certainty virtual network, the direction of selecting K linear independence is formed one group of base d of K dimension space; Organize basic d by this and form a virtual K dimension in the K dimension MPU system around net.

8, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 7 is characterized in that, adopts the virtual cut-through exchanging mechanism, utilizes the Virtual Channel technology, and the certainty virtual network has 2K available channel direction on each node, then,

The direction of selected downstream routing node;

Check fleeing from passage and whether satisfying message and inject restrictive condition of downstream node.

9, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 8 is characterized in that, if downstream node satisfies injection condition, then continues to go to downstream node; Otherwise wait for.

10, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 9 is characterized in that packets of information route step in the certainty virtual network is:

Step 1: if packets of information arrives destination node, then eject network, otherwise through step 2;

Step 2: packets of information checks whether Adaptive Networking exists idle candidate's channel direction, if exist, packets of information then is injected into the adaptability virtual network, otherwise through step 3;

Step 3: in the certainty virtual network, packets of information if be injected into a new unidirectional loop by the time, check that message injects restrictive condition; If still route in the unidirectional ring at place then needs only downstream node and exists the packet-buffering unit of a free time can continue route.

11, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 7, it is characterized in that, adopt the worm channel exchanging mechanism, utilize the Virtual Channel technology, the certainty virtual network has 2K available channel direction on each node, in the certainty virtual network, the physical link on every available channel direction is all to having high Virtual Channel and low Virtual Channel; Then,

The direction of selected downstream routing node;

The physics numbering D (S) of record decanting point S is if the physics of downstream node numbering is then chosen high Virtual Channel less than D (S); If the physics of downstream node numbering is then chosen low Virtual Channel greater than D (S);

If downstream node satisfies injection condition, then continue to go to downstream node; Otherwise wait for.

12, the efficient middle long-range method for routing based on the MPU network topology architecture as claimed in claim 11 is characterized in that packets of information route step in the certainty virtual network is:

Step 1:, then eject network, otherwise go to step 2 if packets of information arrives destination node;

Step 2: if packets of information arrives a flex point I, the D of this flex point of new record (I) more then, otherwise go to step 3;

Step 3: if the physics of route downstream node numbering is then chosen high Virtual Channel less than D (I); If the physics of route downstream node numbering is then chosen low Virtual Channel greater than D (I).

Images