CN100399771C - Method for non deadlock self adaptive routing in multi-dimensional exchanging structure - Google Patents
Method for non deadlock self adaptive routing in multi-dimensional exchanging structure Download PDFInfo
- Publication number
- CN100399771C CN100399771C CNB200410081428XA CN200410081428A CN100399771C CN 100399771 C CN100399771 C CN 100399771C CN B200410081428X A CNB200410081428X A CN B200410081428XA CN 200410081428 A CN200410081428 A CN 200410081428A CN 100399771 C CN100399771 C CN 100399771C
- Authority
- CN
- China
- Prior art keywords
- dimension
- route
- node
- quadrant
- class
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Multi Processors (AREA)
Abstract
The present invention discloses a deadlock-free self-adaptive routing method in a multi-dimensional exchanging structure. The present invention adopts a method to divide buffer resources and a router and bind various buffer resources and the router together to realize the deadlock-free router. Compared with the existing deadlock avoidance routing algorithm, the present invention has a little limit to the flexibility of the router, is favorable to reducing the delay of grouping transmission, enhances the throughput of the exchanging structure, and has better fault tolerance capability. Compared with the existing deadlock recovery routing algorithm, the present invention has the characteristics of no need of a deadlock detecting mechanism, simple algorithm, easy realization, etc. In addition, the sorting mode of the buffer resource on each node is related with the dimension of the exchanging structure, the sorting mode of the buffer resource on the node does not need changing when the node number of each dimension is increased, so the present invention has good expandability.
Description
Technical field
The invention belongs to the switching fabric technical field in communication system, the concurrent computational system, particularly the route technology in the switching fabric of the router/packet switch of employing multidimensional switching fabric, multicomputer system.
Background technology
Switching fabric is the core component of routing (router, switch) and multicomputer system (multi-processor system).For the former, switching fabric couples together each port of router/packet switch, and the transmitted in packets that will come from source port is to destination interface, thereby exchange or the storage of finishing grouping are transmitted.For the latter, switching fabric couples together a plurality of processors, thereby realizes the communication between each processor.
Switching fabric mainly is made of link and node, wherein can have buffer memory, crosspoint and port etc. on the node.According to its topological structure, common switching fabric can be divided into two classes: the port of a class separates on topology with crosspoint, belongs to different nodes respectively; Another kind of then all simultaneously integrated port and crosspoint on each node.The multidimensional switching fabric belongs to the latter.Fig. 1 is the topology and the node structure of typical multidimensional switching fabric.A multidimensional switching fabric generally can be described with the characteristic of 4 aspects: topology, routing algorithm, current control, switching technology.The multidimensional switching fabric all adopts the flow control technology of Virtual Channel (virtual channel) (to see document W.J.Dally usually at present, " Virtual-Channel Flow Control ", IEEE Trans.Parallel and Distributed Systems, Vol.3, No.2, pp.194-205, Mar.1992), grouping is with worm channel route (wormhole routing, see document L.M.Ni and P.K.McKinley, " a survey of wormholerouting techniques in direct networks ", Computer, Vol.26, No.2, pp.62-76, Feb.1993) or the switching technology of empty break-through (virtual cut-through) between node, transmit, the difference between the different multidimensional switching fabrics is mainly on the topological sum routing algorithm.
In recent years, the user is to the requirement of the capacity of router/packet switch, to the requirement of the computing capability of multicomputer system in continuous growth, thereby the performance of switching fabric is proposed very high requirement.Multidimensional switching fabric (comprising n dimension mesh/torus network, hypercube, k unit n side's body) has characteristics such as capacity is big, favorable expandability, reliability height.In the multicomputer system field, the further investigation in existing more than 10 year of multidimensional switching fabric, and being used widely: Touchstone Delta for example, Cray T3D, the iPSC of Intel Company, the J-Machine of the Massachusetts Institute of Technology, the DASH of Stanford University etc.In bit-level router/packet switch field too, existing route device/packet switch the multilevel interchange frame that generally adopts have system extension cost height, reliability low, safeguard shortcoming such as complexity, thereby industry studying new switching fabric technology always, with seeking breakthrough.Because the multidimensional switching fabric has above-mentioned intrinsic advantage, satisfy the too requirement of bit-level router/packet switch, technology is ripe relatively simultaneously, therefore becoming one of hot spot technology of the prospect of having much (sees document W.J.Dally, " Scalable Switching Fabrics for Internet Routers ", Whitepaper, Avici Systems, Inc.).
The multidimensional switching fabric is not the switching fabric from route, promptly on each switching node, next jumping of grouping is determined by configured in advance, but must calculate by certain route according to the target node position, network state etc. of grouping, thereby routing issue is one of its key problem.Similar to other networks (as IP network or optical-fiber network), routing issue in the multidimensional switching fabric also can abstractly be a mathematical problem of seeking the path on connected graph, but because the characteristics of himself, routing issue in the multidimensional switching fabric has and is different from other network particularity: the cache resources on the switching node of multidimensional switching fabric is limited, the cache resources of request next-hop node when each is grouped in the cache resources that takies a certain node, a plurality of like this groupings may form the one-tenth ring request (as shown in Figure 2) to the cache resources of some nodes, the precondition that the grouping that is involved in into the ring request can successfully ask next to jump cache resources is at first to discharge own current shared cache resources, therefore in fact this grouping can't ask required cache resources, thereby can't transmit.Route deadlock (deadlock) problem that Here it is.The emphasis of routing algorithm just is to solve the deadlock problem in the multidimensional switching fabric, promptly calculates no deadlock route (deadlock-free routing), needs to consider to improve the throughput of switching fabric simultaneously, strengthens fault-tolerance etc.Solve the deadlock problem and have multiple thinking, but all be that route is carried out certain limitation in essence, yet the raising throughput and the fault-tolerance that strengthens need to reduce the restriction to route, strengthen the flexibility of route, so have intrinsic contradiction between these two requirements, must carry out compromise.Consider the easy autgmentability of multidimensional switching fabric, routing algorithm also must have good extended capability.Simultaneously, no matter be to be applied to too bit-level router/packet switch field, or the multiprocessor field, all very high to the requirement of switching fabric transmission rate, so routing algorithm must be simple efficient, is convenient to hardware and realizes.So route technology is not only one of emphasis of multidimensional switching fabric technology, also be its difficult point place.
From the origin cause of formation of route deadlock as can be seen: solve the deadlock problem and just must abolish one-tenth ring request to cache resources.According to the difference of the strategy of abolishing into the ring resource request, at present industry adopted and document in the solution that proposed to the deadlock problem can be divided into following two classes:
● deadlock is avoided (deadlock-avoidance): route is carried out stronger restriction, and regulation part route is out of use, thereby guarantees can not occur all the time in switching fabric the one-tenth ring request to cache resources.As C.J.Glass and L.M.Ni model (turn model in turning has been proposed, see document C.J.Glass and L.M.Ni, " The Turn Model for Adaptive Routing; " J.ACM, pp.874-902 Sept.1994), analyzes the ring that turning that the route of all groupings may comprise and these turnings may form, forbid that then some turning to break all rings, is exactly deadlock-free thereby only comprise the route of being left those turnings.XY routing algorithm on the 2 for example famous dimension mesh switching fabrics (belongs to dimension preface routing algorithm, dimension-order routing, DOR), grouping is transmitted along the X dimension earlier according to shortest path, again along the transmission of Y dimension, it is resulting just to can be regarded as 4 of having forbidden in 8 possible turnings, as shown in Figure 3.
● deadlock recovery (deadlock-recovery, see document T.M.Pinkston, " Flexible andEfficient Routing Based on Progressive Deadlock Recovery ", IEEE Trans.Computers, Vol.48, No.7, pp.649-669, July 1999): all cache resources of each node are divided into common buffer memory and escape buffer memory, and the division of this buffer memory also can be considered as network is divided into two-layer: common layer and escape layer.All groupings at first enter common layer, adopt the routing algorithm transmission that deadlock may take place in this one deck.Move certain Deadlock Detection mechanism simultaneously, take place, then selectively the grouping that deadlock takes place is linked into escape layer, be transferred to destination node with certain absolute deadlock-free routing algorithm at this one deck in case detected deadlock.As long as meet the following conditions, just definitely can solve all deadlocks:
A) all deadlocks all can be detected;
B) if several groupings, P
1, P
2, P
3... P
nConstitute a deadlock, then this n the grouping in, have at least one can be linked into escape layer;
C) routing algorithm of escape layer does not definitely have deadlock.
Come more above-mentioned two kinds of strategies from the angle to the restriction of route: the flexibility that the deadlock avoidance strategy can be considered as route on all cache resources all is restricted; The deadlock recovery strategy then is that all cache resources are divided into two parts: common buffer memory and escape buffer memory, route is unrestricted on common buffer memory, and only on the escape buffer memory flexibility of route just be restricted.Because it is very little that the escape buffer memory accounts for the ratio of all cache resources, so on the whole, the deadlock recovery strategy is much smaller to the restriction of route flexibility, adopt the routing algorithm of deadlock recovery strategy can have better adaptivity, route dispersing characteristic and fault-tolerance, this is its advantage place of being avoided with respect to deadlock just.Yet on the other hand, the performance of deadlock recovery routing algorithm is subjected to the Effect on Performance of its Deadlock Detection mechanism to a considerable extent.If testing mechanism is sensitive inadequately, may cause the grouping of some deadlock can not in time be linked into escape layer; If testing mechanism is too sensitive, may congestedly think deadlock common, thereby the grouping that does not have deadlock in a large number is linked into escape layer, make that the escape cache resources is taken in a large number, also can cause the grouping of real deadlock can not in time be linked into escape layer.Both of these case all can make the routing algorithm decreased performance.In addition, when business load was light, the probability that deadlock takes place was less, and when business load is heavier, the probability that deadlock takes place will increase greatly, and this just requires Deadlock Detection mechanism all adaptive capacity preferably will be arranged to the different loads amount.Simultaneously, some design parameters (as the quantity of escape buffer memory) is definite also just relatively more difficult.These all make routing algorithm become complicated, are unfavorable for the hardware realization.Avoid with the deadlock recovery strategy pluses and minuses being arranged respectively just because of existing deadlock, all lack perfection, seeking the new way that solves route deadlock problem also just becomes one of the research focus in present multidimensional switching fabric field.
Summary of the invention
The purpose of this invention is to provide the adaptive routing method without dead in a kind of multidimensional switching fabric, definitely do not have deadlock according to the route that method for routing of the present invention obtains, and have stronger flexibility, and method for routing of the present invention is simple and easy to realize.Method for routing of the present invention is applicable to the multidimensional switching fabric that adopts n dimension mesh/torus network topology, and the algorithm details is carried out also can be used for adopting other topological multidimensional switching fabrics after the little modification.
Be that convenience is described, provide earlier to be defined as follows:
For a n dimension switching fabric, each node x can use n-dimensional vector (x
1, x
2... x
n) represent x wherein
iRepresent the coordinate of this node on the i dimension.The set that makes all nodes is V.Every link a can be expressed as two tuple (n
1, n
2), n
1, n
2∈ V, node n
1, n
2Be two end points of link a.The set that makes all links is E.
Rib: claim to satisfy the node of following condition, the sequence (x that link is alternately formed
0, a
1, x
1, a
2... x
K-1, a
k, x
k), x
i∈ V, a
i∈ E is a rib of n dimension switching fabric:
1.a
i=(x
I-1, x
i), i.e. a
iWith x
I-1With x
iBe end points;
2. for n dimension mesh network topology, k=n-1, and node do not repeat, and promptly right
x
i≠x
j；
For n dimension torus network topology, k=n, and except x
0=x
kOutside, node does not repeat;
3. all nodes have only a coordinate difference on the dimension i, and the coordinate on other all dimensions is all identical.Claim that this rib is a rib along dimension i this moment.
Positive direction: to certain one dimension, claim direction that node increases progressively at the coordinate of this dimension positive direction, abbreviate the forward of this dimension as for this dimension.
Negative direction: corresponding, claim direction that node successively decreases at the coordinate of this dimension negative direction for this dimension, abbreviate the negative sense of this dimension as.
Loopback link (wraparound link): for a rib in the torus network topology, be convenient and describe that the link that we define the node of the node that connects i dimension coordinate maximum and i dimension coordinate minimum is the loopback link along dimension i.In fact, because the torus network topology has the whole network symmetry, thereby any link can be regarded as the loopback link on certain one dimension, and Fig. 4 has provided an example of above-mentioned definition.
Layer: the buffer memory on each node of multidimensional switching fabric is divided into some classes according to identical sorting technique, a layer of this multidimensional switching fabric of all formations of each class buffer memory.Because the sorting technique of the buffer memory on each node is all identical, so each layer all has and the identical virtual topology of this multidimensional switching fabric physical topology.
No deadlock routing algorithm provided by the present invention has fine distinction when being applied to the torus network topology when being applied to the mesh network topology.
Adaptive routing method without dead in a kind of multidimensional switching fabric provided by the invention is characterized in that its employing following steps realizes:
Step 1: initialization step.
Initialization step carried out before grouping enters the multidimensional switching fabric, and the multidimensional switching fabric is configured, and comprised following three sub-steps:
At first, divide quadrant.
Right to any source, destination node, be initial point with the source node, be reference axis with the rib at source node place, entire n dimension switching fabric is divided into 2
nIndividual quadrant.
For n dimension mesh network topology, each quadrant extends to the border of mesh, and has only the inner complete route that exists from the source node to the destination node of a unique quadrant (being designated as quadrant A).
For the torus network topology, each quadrant extends to the rib (rib that is the destination node place is the line of demarcation of two adjacent quadrants) at destination node place, and all there is the complete route from the source node to the destination node in any one quadrant inside.
For a quadrant, use D
iRepresent the direction of this quadrant, D in the i dimension
i∈+,-, if in this quadrant inside, the shortest path from the source node to the destination node is by being the forward of tieing up along i, then D
iFor just; Otherwise D
iFor negative.So a quadrant can be expressed as (D
1, D
2... D
n) form.Fig. 5 is that example has provided the schematic diagram of dividing quadrant with 2 dimension torus network topologies.
Then, the legitimacy of regulation route.
Legal route must meet the following conditions: can only advance along a direction on the whole piece route dimension in office.Any legal route all is positioned on the inside or border of certain quadrant all the time, the route of quadrant promptly can not occur striding, and the direction on the route dimension in office is consistent with its affiliated quadrant direction on this dimension.Fig. 6 has provided a legal route on the 2 dimension torus network topologies.
At last, determine the classification of route and cache resources.
For the torus network topology, to arbitrary dimension, arbitrary legal route must belong to the class in following four classes:
● the 0th class:, and, be designated as W+ through the loopback link along this dimension forward;
● the 1st class:, and, be designated as W-through the loopback link along this dimension negative sense;
● the 2nd class:, and, be designated as NW+ without the loopback link along this dimension forward;
● the 3rd class:, and, be designated as NW-without the loopback link along this dimension negative sense.
For the mesh network topology, to arbitrary dimension, arbitrary legal route must belong to the class in following two classes:
● the 0th class: along this dimension forward, be designated as+;
● the 1st class: along this dimension negative sense, be designated as-.
For n dimension torus network topology, use C
iThe type of expression route on the i dimension, C
i∈ 0,1,2, and 3}, all legal routes can be divided into 4
nClass, each class can be expressed as (C
1, C
2... C
n).Accordingly, the cache resources on each node is equally divided into 4
nClass promptly is divided into 4 to whole multidimensional switching fabric
nLayer.
For n dimension mesh network topology, all legal routes can be divided into 2
nClass, each class can be expressed as (C
1, C
2... C
n), C
i∈ 0,1}.Accordingly, the cache resources on each node is equally divided into 2
nClass, whole multidimensional switching fabric is divided into 2
nLayer.
Each layer carrying one class route; Each bar route can only be transmitted on one deck, promptly can only use the cache resources of that class under own.Right to any source, destination node, all routes in the same quadrant all belong to same type.
After initialization step finished, grouping entered the multidimensional switching fabric.
Step 2:, select a quadrant of in initialization division quadrant step, being divided at random for grouping at the source node place for the torus network topology; For the mesh network topology, then use in initialization and divide well-determined quadrant A in the quadrant step.
Step 3: to the sorting technique in route and the cache resources classification step, determine the classification of the route in the selected quadrant in step 2 according to initialization, and the level number of such route cache resources that should use.
Step 4: on the layer of determined cache resources, grouping is selected a legal route that meets the regulation in the initialization regulation route legitimation step in the mode of self adaptation route, transfers to destination node in step 3.
Through after the above step, just can obtain the no deadlock self adaptation route (Fig. 7 is a flow chart of the present invention) in the multidimensional switching fabric.
Provide the deadlock-free proof summary of routing algorithm provided by the present invention below:
If the one-tenth ring request of cache resources promptly appears in route generation deadlock, this at first will seek survival at several by P
1, P
2... P
k, they or they part can end to end formation route ring.For the torus network topology, this means that these routes must satisfy in following two conditions at least:
● on a dimension, there are two route P at least
i, P
j, their direction is opposite;
● on a dimension, there are two route P at least
i, P
j, the loopback link of this dimension of process wherein,
Another without.
For the mesh network topology, then first condition is necessarily set up.According to the classification of algorithm to route and cache resources, above-mentioned P
i, P
jMust belong to dissimilar, by different layer carryings, promptly their shared separately cache resources are fully independently, thereby the one-tenth ring request to cache resources can not occur respectively.
As can be seen from the above description, routing algorithm provided by the present invention is avoided with existing employing deadlock, the routing algorithm of deadlock recovery strategy is different fully on mentality of designing.The mentality of designing of routing algorithm provided by the present invention is as follows:
● the cache resources on the node is divided into some types (thereby switching fabric is divided into several layers);
● correspondingly, all available routes also are divided into some types;
● each class cache resources (be switching fabric each layer) only carries the route of certain type, guarantees that by good design route do not have deadlock;
● each is grouped in the classification of selecting own employed route when entering switching fabric at random, just selects to use which kind of cache resources (being which layer) at random, transmits in selected cache resources according to the mode of self adaptation route then.
According to the mentality of designing of routing algorithm provided by the present invention, design focal point is cache resources and route are carried out suitable division, and reasonably binds between all kinds of cache resources and route.Good division should be satisfied following several principles with binding:
A) cache resources on each node is carried out identical division, all of a sort cache resources constitute one deck, and each layer has identical topology with whole multidimensional switching fabric.
B) every route can only be used the cache resources of own place layer, does not promptly allow to occur striding the route of layer;
In each layer, route does not have deadlock.
C) belong between any many routes of different layers and can not form deadlock.
Wherein, principle a) has guaranteed the connectedness and the symmetry of multidimensional switch fabric topology; Principle b) with principle c) guaranteed that route do not have deadlock.
Essence of the present invention is: the route deadlock is because route causes the one-tenth ring request of cache resources, and traditional deadlock avoidance strategy is by restriction route itself, avoids one-tenth ring request to cache resources in the mode of avoiding occurring the route ring; And routing algorithm provided by the present invention allows to occur the route ring, but by ingenious division to cache resources, make the several that constitutes ring by using different cache resources, so also just avoided one-tenth ring request, thereby avoided the generation of deadlock cache resources.Owing to allow to occur the route ring, routing algorithm provided by the present invention is less to the restriction of route, and grouping can be selected any legal route, though be not (the fully adaptive) of fully adaptive, route still has very strong flexibility.
Owing to need classify to cache resources, routing algorithm provided by the present invention need be on the switching fabric node buffer memory of integrated a greater number.With the technical merit of current industry, accomplish that this point does not all include too big difficulty from technical standpoint and cost angle, so routing algorithm provided by the present invention is fully feasible.
Avoid with existing employing deadlock, the routing algorithm of deadlock recovery strategy compares, routing algorithm provided by the present invention has the following advantages:
● the restriction for the route flexibility is less: though with regard to certain one deck of switching fabric, in order to guarantee not have deadlock in this layer route, need carry out strict restriction to route, but owing to be grouped in the cache resources of selecting to use which layer when entering switching fabric at random, identical sources, destination node between a plurality of groupings can select many different routes, therefore with regard to whole switching fabric, less to the restriction of route flexibility.
● do not need Deadlock Detection, simple, the easily realization of algorithm: only need when grouping enters switching fabric, select the classification of employed route and cache resources at random, just in the mode of self adaptation route, in selected cache resources, transmit then.Compare with the deadlock recovery strategy, less to the increase of route algorithm complex, there is not the difficulty on the Deadlock Detection Mechanism Design parameter yet, performance is to the growth of traffic carrying capacity also relative insensitivity.
As seen routing algorithm provided by the present invention has the advantage that deadlock is avoided routing algorithm and deadlock recovery routing algorithm to a great extent concurrently, and has avoided the deficiency of the two.
In sum, the invention provides the no deadlock adaptive routing algorithm in a kind of multidimensional switching fabric, employing is carried out suitable division to cache resources and route, and the method for rationally binding between all kinds of cache resources and route, has realized no deadlock route.Avoid routing algorithm to compare with existing deadlock, less to the restriction of route flexibility, help reducing the time delay of transmitted in packets, improve the throughput of switching fabric, better fault-tolerant ability is arranged; Compare with existing deadlock recovery routing algorithm, do not need Deadlock Detection mechanism, algorithm is simple, is easy to realize.In addition, because the cache resources mode classification on each node is only relevant with the dimension of switching fabric, irrelevant with the node number of every dimension, therefore when every dimension node number increases, do not need to change the mode classification of cache resources on the node, so algorithm is with good expansibility.
Accompanying drawing and description of drawings
Fig. 1 is typical multidimensional switch fabric topology and node structure schematic diagram
Fig. 2 is the forming process schematic diagram of deadlock
Fig. 3 is a turning model schematic diagram of analyzing deadlock
Fig. 4 is positive direction, negative direction, the loopback link schematic diagram of a certain dimension of multidimensional switching fabric
Fig. 5 is that the quadrant on the 2 dimension torus network topologies is divided schematic diagram
Fig. 6 is the legal route schematic diagram on the 2 dimension torus network topologies
Fig. 7 is the routing algorithm flow chart that is applied to n dimension torus network topology
Embodiment
Routing algorithm provided by the present invention can directly apply to the multidimensional switching fabric of n dimension mesh/torus network topology, keeps algorithm frame, and the algorithm details is carried out also can be applicable to other topologys that derived by above-mentioned two kinds of topologys after the necessary modification.The 2 multidimensional switching fabrics of tieing up the torus network topologies with an employing 8 * 8 are example below, provide an embodiment of the present invention.
Step 1: initialization step.
At first, divide quadrant.For 2 dimension torus network topologies, whole switching fabric is divided into 4 quadrants, is respectively:
Quadrant (+,+), promptly be forward in the X dimension, be forward in the Y dimension;
Quadrant (+,-), promptly be forward in the X dimension, be negative sense in the Y dimension;
Quadrant (,+), promptly be negative sense in the X dimension, be forward in the Y dimension;
Quadrant (,-), promptly be negative sense in the X dimension, be negative sense in the Y dimension.
Then, the legitimacy of regulation route.Legal route must be positioned on certain quadrant inside or the border all the time, and:
In quadrant (+,+), in the X dimension only along just marching forward, in the Y dimension only along just marching forward;
In quadrant (+,-), only along just marching forward, only advance along negative sense in the Y dimension in the X dimension;
In quadrant (,+), only advance in the X dimension along negative sense, in the Y dimension only along just marching forward;
In quadrant (,-), only advance in the X dimension along negative sense, only advance in the Y dimension along negative sense.
At last, route and cache resources are classified.All legal routes are divided into 16 classes, and the cache resources on each node is equally divided into 16 classes, thereby whole switching fabric is divided into 16 layers, and each layer is supported a class route.Type with layer number consecutively is:
The 0th class/layer: (0,0), the X dimension is W+, the Y dimension is W+;
The 1st class/layer: (0,1), the X dimension is W+, the Y dimension is W-;
The 2nd class/layer: (0,2), the X dimension is W+, the Y dimension is NW+;
The 3rd class/layer: (0,3), the X dimension is W+, the Y dimension is NW-;
The 4th class/layer: (1,0), the X dimension is W-, the Y dimension is W+;
The 5th class/layer: (1,1), the X dimension is W-, the Y dimension is W-;
The 6th class/layer: (1,2), the X dimension is W-, the Y dimension is NW+;
The 7th class/layer: (1,3), the X dimension is W-, the Y dimension is NW-;
The 8th class/layer: (2,0), the X dimension is NW+, the Y dimension is W+;
The 9th class/layer: (2,1), the X dimension is NW+, the Y dimension is W-;
The 10th class/layer: (2,2), the X dimension is NW+, the Y dimension is NW+;
The 11st class/layer: (2,3), the X dimension is NW+, the Y dimension is NW-;
The 12nd class/layer: (3,0), the X dimension is NW-, the Y dimension is W+;
The 13rd class/layer: (3,1), the X dimension is NW-, the Y dimension is W-;
The 14th class/layer: (3,2), the X dimension is NW-, the Y dimension is NW+;
The 15th class/layer: (3,3), the X dimension is NW-, the Y dimension is NW-.
Step 2: when a grouping enters switching fabric, be without loss of generality, establish its source node and be (4,5), destination node is (8,2).Select a quadrant at random for this grouping, be without loss of generality, be made as quadrant (+,-), promptly along the forward of X dimension, the negative sense of Y dimension.
Step 3: according to the coordinate of source, destination node, the legal route in quadrant (+,-) can not passed through the loopback link in X dimension and Y dimension, promptly be NW+ in the X dimension, be NW-in the Y dimension,, take the cache resources of 11th layer so determine that this operable legal route of dividing into groups belongs to the 11st class.
Step 4: be grouped in 11th layer and be transferred to destination node in the mode of legal self adaptation route.Promptly at every turn select a direction of advance as next jumping at random from the negative sense of the forward of X dimension and Y dimension, if the X dimension coordinate of current place node has equaled 8, perhaps the Y dimension coordinate has equaled 2, then along one dimension transmission in addition, up to arrival destination node (8,2).
As mentioned above, arbitrarily source, grouping that destination node is right can successfully be transmitted, and generally, source, destination node between exist many different routes for dividing group selections.
Claims (1)
1. the adaptive routing method without dead in the multidimensional switching fabric is characterized in that its adopts following steps to realize;
Be that convenience is described, provide earlier to be defined as follows:
For a n dimension switching fabric, each node x can use n-dimensional vector (x
1, x
2... x
n) represent x wherein
iRepresent the coordinate of this node on the i dimension; The set that makes all nodes is V; Every link α can be expressed as two tuple (n
1, n
2), n
1, n
2∈ V, node n
1, n
2Be two end points of link α; The set that makes all links is E;
Rib: claim to satisfy the node of following condition, the sequence (x that link is alternately formed
0, α
1, x
1, α
2... x
K-1, α
k, x
k), x
i∈ V, α
i∈ E is a rib of n dimension switching fabric:
1. α
i=(x
I-1, x
i), i.e. α
iWith x
I-1With x
iBe end points;
2. for n dimension mesh network topology, k=n-1, and node do not repeat, and promptly right
x
i≠x
j；
For n dimension torus network topology, k=n, and except x
n=x
kOutside, node does not repeat;
3. all nodes have only a coordinate difference on the dimension i, and the coordinate on other all dimensions is all identical; Claim that this rib is a rib along dimension i this moment;
Positive direction: to certain one dimension, claim direction that node increases progressively at the coordinate of this dimension positive direction, abbreviate the forward of this dimension as for this dimension;
Negative direction: corresponding, claim direction that node successively decreases at the coordinate of this dimension negative direction for this dimension, abbreviate the negative sense of this dimension as;
Loopback link: for a rib in the torus network topology, be convenient and describe that the link that we define the node of the node that connects i dimension coordinate maximum and i dimension coordinate minimum is the loopback link along dimension i; In fact, because the torus network topology has the whole network symmetry, thereby any link can be regarded as the loopback link on certain one dimension;
Layer: the buffer memory on each node of multidimensional switching fabric is divided into some classes according to identical sorting technique, a layer of this multidimensional switching fabric of all formations of each class buffer memory; Because the sorting technique of the buffer memory on each node is all identical, so each layer all has and the identical virtual topology of this multidimensional switching fabric physical topology;
Step 1: initialization step
Initialization step carried out before grouping enters the multidimensional switching fabric, and the multidimensional switching fabric is configured, and comprised following three sub-steps:
At first, divide quadrant;
Right to any source, destination node, be initial point with the source node, be reference axis with the rib at source node place, entire n dimension switching fabric is divided into 2
nIndividual quadrant;
For n dimension mesh network topology, each quadrant extends to the border of mesh, and has only the inner complete route that exists from the source node to the destination node of a unique quadrant A;
For the torus network topology, each quadrant extends to the rib at destination node place, and promptly the rib at destination node place is the line of demarcation of two adjacent quadrants, and all there is the complete route from the source node to the destination node in any one quadrant inside;
For a quadrant, use D
iRepresent the direction of this quadrant, D in the i dimension
i∈+,-, if in this quadrant inside, the shortest path from the source node to the destination node is by being the forward of tieing up along i, then D
iFor just; Otherwise D
iFor negative; So a quadrant can be expressed as (D
1, D
2... D
n) form;
Then, the legitimacy of regulation route;
Legal route must meet the following conditions: can only advance along a direction on the whole piece route dimension in office; Any legal route all is positioned on the inside or border of certain quadrant all the time, the route of quadrant promptly can not occur striding, and the direction on the route dimension in office is consistent with its affiliated quadrant direction on this dimension;
At last, determine the classification of route and cache resources;
For the torus network topology, to arbitrary dimension, arbitrary legal route must belong to the class in following four classes:
● the 0th class:, and, be designated as W+ through the loopback link along this dimension forward;
● the 1st class:, and, be designated as W-through the loopback link along this dimension negative sense;
● the 2nd class:, and, be designated as NW+ without the loopback link along this dimension forward;
● the 3rd class:, and, be designated as NW-without the loopback link along this dimension negative sense;
For the mesh network topology, to arbitrary dimension, arbitrary legal route must belong to the class in following two classes:
● the 0th class: along this dimension forward, be designated as+;
● the 1st class: along this dimension negative sense, be designated as-;
For n dimension torus network topology, use C
iThe type of expression route on the i dimension, C
i∈ 0,1,2, and 3}, all legal routes can be divided into 4
nClass, each class can be expressed as (C
1, C
2... C
n); Accordingly, the cache resources on each node is equally divided into 4
nClass promptly is divided into 4 to whole multidimensional switching fabric
nLayer;
For n dimension mesh network topology, all legal routes can be divided into 2
nClass, each class can be expressed as (C
1, C
2... C
n), C
i∈ 0,1}; Accordingly, the cache resources on each node is equally divided into 2
nClass, whole multidimensional switching fabric is divided into 2
nLayer;
Each layer carrying one class route; Each bar route can only be transmitted on one deck, promptly can only use the cache resources of that class under own; Right to any source, destination node, all routes in the same quadrant all belong to same type;
After initialization step finished, grouping entered the multidimensional switching fabric;
Step 2:, select a quadrant of in initialization division quadrant step, being divided at random for grouping at the source node place for the torus network topology; For the mesh network topology, then use in initialization and divide well-determined quadrant A in the quadrant step;
Step 3: to the sorting technique in route and the cache resources classification step, determine the classification of the route in the selected quadrant in step 2 according to initialization, and the level number of such route cache resources that should use;
Step 4: on the layer of determined cache resources, grouping is selected a legal route that meets the regulation in the initialization regulation route legitimation step in the mode of self adaptation route, transfers to destination node in step 3;
Through after the above step, just can obtain the no deadlock self adaptation route in the multidimensional switching fabric.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410081428XA CN100399771C (en) | 2004-12-09 | 2004-12-09 | Method for non deadlock self adaptive routing in multi-dimensional exchanging structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410081428XA CN100399771C (en) | 2004-12-09 | 2004-12-09 | Method for non deadlock self adaptive routing in multi-dimensional exchanging structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1787478A CN1787478A (en) | 2006-06-14 |
| CN100399771C true CN100399771C (en) | 2008-07-02 |
Family
ID=36784794
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200410081428XA Expired - Fee Related CN100399771C (en) | 2004-12-09 | 2004-12-09 | Method for non deadlock self adaptive routing in multi-dimensional exchanging structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100399771C (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267398B (en) * | 2008-04-18 | 2010-09-01 | 清华大学 | Non deal lock self-adapted routing method in 2-D torus network |
| CN101335704B (en) * | 2008-04-18 | 2011-05-11 | 清华大学 | Adaptive routing method without dead lock in three-dimensional torus network |
| CN101369975B (en) * | 2008-09-17 | 2011-02-09 | 上海华为技术有限公司 | Detection method and system for time-delay package loss |
| KR101250666B1 (en) * | 2009-01-30 | 2013-04-03 | 후지쯔 가부시끼가이샤 | Information processing system, information processing device, control method for information processing device, and computer-readable recording medium |
| CN102170402B (en) * | 2011-05-31 | 2013-07-10 | 清华大学 | A deadlock-free adaptive routing algorithm in a Torus network |
| CN102904806B (en) * | 2012-09-28 | 2015-04-15 | 清华大学 | Deadlock free fault-tolerant self-adaptation routing method of computer system |
| US9007962B2 (en) | 2013-01-24 | 2015-04-14 | International Business Machines Corporation | Deadlock-free routing using edge-disjoint sub-networks |
| CN105530206B (en) * | 2015-12-22 | 2019-01-29 | 合肥工业大学 | A kind of Torus network system and its working method with double access infrastructures |
| US10057334B2 (en) * | 2016-11-14 | 2018-08-21 | Futurewei Technologies, Inc. | Quad full mesh and dimension driven network architecture |
| CN107094116B (en) * | 2017-05-26 | 2020-02-28 | 中国科学院计算技术研究所 | Direct network routing method and system containing cross-dimension link |
| CN107612746B (en) * | 2017-10-12 | 2020-12-22 | 曙光信息产业股份有限公司 | Torus network construction method, Torus network and routing algorithm |
| CN108337196B (en) * | 2017-12-29 | 2021-04-23 | 曙光信息产业(北京)有限公司 | Switching system constructed by switching chip and routing algorithm thereof |
| CN108259387B (en) * | 2017-12-29 | 2020-12-22 | 曙光信息产业(北京)有限公司 | Switching system constructed by switch and routing method thereof |
| CN111245741A (en) * | 2019-12-31 | 2020-06-05 | 厦门美域中央信息科技有限公司 | Network traffic distribution method based on software deadlock and high-load jump technology |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5513322A (en) * | 1994-05-02 | 1996-04-30 | Unisys Corporation | Multi-path message routing without deadlocks |
| US5533198A (en) * | 1992-11-30 | 1996-07-02 | Cray Research, Inc. | Direction order priority routing of packets between nodes in a networked system |
| CN1157512A (en) * | 1995-11-09 | 1997-08-20 | 国际商业机器公司 | Adaptive and dynamic message routing system for multinode wormhole networks |
| US20030142627A1 (en) * | 2002-01-31 | 2003-07-31 | Sun Microsystems, Inc. | Method of optimizing network capacity and fault tolerance in deadlock-free routing |
-
2004
- 2004-12-09 CN CNB200410081428XA patent/CN100399771C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5533198A (en) * | 1992-11-30 | 1996-07-02 | Cray Research, Inc. | Direction order priority routing of packets between nodes in a networked system |
| US5513322A (en) * | 1994-05-02 | 1996-04-30 | Unisys Corporation | Multi-path message routing without deadlocks |
| CN1157512A (en) * | 1995-11-09 | 1997-08-20 | 国际商业机器公司 | Adaptive and dynamic message routing system for multinode wormhole networks |
| US20030142627A1 (en) * | 2002-01-31 | 2003-07-31 | Sun Microsystems, Inc. | Method of optimizing network capacity and fault tolerance in deadlock-free routing |
Non-Patent Citations (6)
| Title |
|---|
| 基于3维网格的最小理由算法. 方铖.培训与研究－湖北教育学院学报，第19卷第5期. 2002 |
| 基于3维网格的最小理由算法. 方铖.培训与研究－湖北教育学院学报，第19卷第5期. 2002 * |
| 大容量交换路由器的设计. 迟玲，邱智亮，刘增基.网络与系统，第33卷第5期. 2003 |
| 大容量交换路由器的设计. 迟玲，邱智亮，刘增基.网络与系统，第33卷第5期. 2003 * |
| 直接互连结构在数据交换中的应用分析. 朱旭东，李乐民.电子科技大学学报，第32卷第3期. 2003 |
| 直接互连结构在数据交换中的应用分析. 朱旭东，李乐民.电子科技大学学报，第32卷第3期. 2003 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1787478A (en) | 2006-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100399771C (en) | Method for non deadlock self adaptive routing in multi-dimensional exchanging structure | |
| Gaughan et al. | Adaptive routing protocols for hypercube interconnection networks | |
| Flocchini et al. | Computing without communicating: Ring exploration by asynchronous oblivious robots | |
| Gomez et al. | A routing methodology for achieving fault tolerance in direct networks | |
| Felperin et al. | Routing techniques for massively parallel communication | |
| Sivaram et al. | Efficient broadcast and multicast on multistage interconnection networks using multiport encoding | |
| KR20140139032A (en) | A packet-flow interconnect fabric | |
| Dehyadegari et al. | An adaptive fuzzy logic-based routing algorithm for networks-on-chip | |
| Liu | Intelligent routing based on deep reinforcement learning in software-defined data-center networks | |
| Shim et al. | Static virtual channel allocation in oblivious routing | |
| Kim et al. | An Evalutation of Planar-Adaptive Routing (PAR). | |
| Jouraku et al. | An effective design of deadlock-free routing algorithms based on 2d turn model for irregular networks | |
| CN117135059B (en) | Network topology structure, construction method, routing algorithm, equipment and medium | |
| CN116016384B (en) | Scalable network-on-chip topology structure based on ring layout and routing method thereof | |
| Pifarre et al. | Adaptive deadlock-and livelock-free routing in the hypercube network | |
| Di Ianni | Efficient delay routing | |
| Shih | Fault-tolerant wormhole routing in torus networks with overlapped block faults | |
| Seydim | Wormhole routing in parallel computers | |
| Aggarwal | Design and performance evaluation of a new irregular fault-tolerant multistage interconnection network | |
| Cole et al. | On the benefit of supporting virtual channels in wormhole routers | |
| Takabatake et al. | HCC: generalized hierarchical completely-connected networks | |
| Ramany | Routing in wormhole networks | |
| Choi et al. | Crossbar analysis for optimal deadlock recovery router architecture | |
| Sengupta | Interconnection networks for parallel processing | |
| Al-Dubai et al. | A performance study of path based multicast communication algorithms |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080702 Termination date: 20101209 |