CN101262444A - Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping - Google Patents
Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping Download PDFInfo
- Publication number
- CN101262444A CN101262444A CNA2008101016016A CN200810101601A CN101262444A CN 101262444 A CN101262444 A CN 101262444A CN A2008101016016 A CNA2008101016016 A CN A2008101016016A CN 200810101601 A CN200810101601 A CN 200810101601A CN 101262444 A CN101262444 A CN 101262444A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- destination node
- distance
- message
- 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.)
- Pending
Links
Images
Abstract
The invention provides a routing method for preventing a mesh network from deadlock based on channel overlapping, which pertains to routing error-tolerance technology of a distributed high performance system and is characterized in that: every physical channel is divided into two virtual channels and certain virtual channels are allowed to be shared by different virtual subnets; in a two-dimensional mesh network, c1- channels are applied along the direction of x and c1 channels are applied along the direction of y; in a three-dimensional mesh network, virtual subnets x+y+z* and x+y-z* share the c1 channels along the direction of z and virtual subnets x-y*z+ and x-y*z- share c2 channels along the direction of y, wherein, '+' and '-' represent positive direction and negative direction of information transmission, '*' represents either positive direction or negative direction, therefore, a non deadlock plane adaptive routing is finished; meanwhile, minimum networking part fault models are respectively built in all three-dimensional planes and safety information at all diagonal lines therein is utilized to fulfill the fault-tolerant routing method free from deadlock. Compared with the existing PAR and GOMEZ methods, the method of the invention improves transmission performance of the whole network when standard input load is increased.
Description
Technical field
Fault tolerance mesh deadlock avoiding method based on channel overlapping belongs to distributed high-performance fault-tolerant calculation technical field.
Background technology
In the multicomputer system of current experiment usefulness and commercialization, the mesh net is a kind of topological structure that is widely used.The k n of unit dimension mesh is meant the network of a n dimension, on each dimension k node is arranged.Wherein the mesh net of two and three dimensions is a multiprocessor network topological structure the most commonly used.The performance of multicomputer system depends on the performance of the means of communication of point-to-point in the system to the full extent.Therefore, necessary proposition some be applied to the high performance fault-tolerant method for routing of mesh net.
For adaptive fault-tolerant method for routing, the tunnel that needs usually every physical channel to be divided into some is realized the deadlock avoiding method, and the physical resource on the passage (as buffer memory, bandwidth) can be assigned on each tunnel.Therefore, the realization deadlock avoids required tunnel number to become the key factor that influences the method for routing level of resources utilization, uses tunnel still less, can make every tunnel be assigned to more resources, raising method efficient especially compares under the condition of limited at physical resource; But tunnel still less also can make the difficulty of design deadlock avoiding method increase.
Linder and Harden are virtual subnet with the conceptual expansion of tunnel, and use it for and realize that self adaptive, fault-tolerance and deadlock avoid.Distribute different tunnels in the different virtual subnets, just become quite big for the required tunnel number of mesh net of higher-dimension.Wu has improved the virtual subnet method in the mesh net, and the number of tunnel equals the dimension of mesh net.Compare the method for front, the tunnel number greatly reduces.
Bappana and Chalasani have proposed a kind of fault-tolerant method for routing based on e-cube method and block fault model.This method only needs four tunnels just can realize the complete self-adapted tolerance route of mesh in netting.Yet all the needing when setting up trouble block of this several method lost efficacy some non-fault points, can cause the loss of very serious computing capability like this in network three-dimensional and more higher-dimension.
Puente etc. have proposed a kind of fault-tolerant method for routing of bubble Flow Control by name, the fault point that can handle any amount in the connected network, and under situation about breaking down, the method is carried out available resources and is reconfigured automatically.Xiao Canwen etc. have proposed a kind of this flow control method to be improved to dimension flow of bubble control method, and value and routing iinformation are realized Flow Control between the some point approximately by the analysis port letter.Gomez etc. have proposed a kind of two-stage fault-tolerance method for routing by selecting intermediate node to realize, from the source node to the intermediate node with from the intermediate node to the destination node, use different virtual subnets respectively, at the inner complete self-adapted protocol that uses Duato of each subnet, two subnets use identical self adaptation tunnel, but use different escape routes, use dimension preface route or bubble Flow Control in escape route, this method needs three tunnels altogether.Recently, Mejia etc. have proposed a kind of fault-tolerant method for routing of certainty of the mesh/torus of being used for net, and this method has adopted the up that is similar in the scramble network
*/ down
*The method of route.
The method of pre-set path is applied in the Circuit Switching Network the earliest, and message physical channel on the reserved path at first for it before sending is done the generation that can avoid deadlock like this, but can be caused the waste of bandwidth and the increase of time-delay.Wu Jie has proposed a kind of no deadlock self-adapted tolerance method based on the expansion level of security, and the method needed to set up the zone of a shortest path before sending message, and this is first fault-tolerant method for routing of estimating based on limited global safety.
Block fault model is the same fault model the most commonly used, but this model can make some non-malfunctioning nodes lose efficacy.The malfunctioning node of minority may make a lot of even whole non-malfunctioning nodes lose efficacy, and this phenomenon is more obvious in the network of higher-dimension.Wang has proposed the notion of minimum networking unit failure model, and for the minimum networking unit failure model on plane, each node is two parts of safety informations in each plane, its place.Minimum networking unit failure model lost efficacy non-malfunctioning node still less than block model, can more effectively instruct the shortest path route.Three-dimensional minimum networking unit failure model lost efficacy non-malfunctioning node still less than plane minimum networking unit failure model, but for plane self-adapted route used herein, plane minimum networking unit failure model is more suitable.Wait in each plane eastwards and set up trouble block, and use the local reliability information of expansion, improved the fault freedom of method for routing greatly.
Fail safe classification for non-malfunctioning node in the out of order mesh net, many methods have all adopted following method: if a node has fault or unsafe neighbor node are arranged on two or more different dimensions, then this node is marked as dangerous node; Otherwise this node is a security node.In a single day node is marked as dangerous, then can will cause the reduction of system-computed ability so to a great extent as malfunctioning node complete failure.The trouble block of being set up by above method is a series of rectangular area that is made of the dangerous node of fault point and inefficacy, but in fact the dangerous node of trouble block inside remains in some plane and has routing capabilities, can be used as the source node of message or the intermediate node on destination node or other message routed path.In this article, if source node equals distance between 2 to the routed path length of destination node, and the node on the path is non-fault point, and we claim this path to be the shortest available path so.
Node in the Mesh net can be divided into malfunctioning node, dangerous node and security node three classes according to its fail safe.If all nodes are dangerous point or fault point in the network system, claim that so this network system is unsafe.The trouble block that fault point and dangerous some set F constitute in the two dimension mesh net has following characteristics: (1) does not have the fault point at the boundary in square type zone; (2) inside in square type zone comprises fault point and the dangerous point among all set F; (3) inside in square type zone does not comprise the node outside any set F.Trouble block in the mesh net three-dimensional and more higher-dimension can be set up with similar method.
It is emphasized that existing most methods all is inefficacy with dangerous vertex ticks, failed node can not be as the source node or the destination node of message.And in this article, dangerous node still can be used as source node or destination node uses, and this also makes the performance of method for routing be greatly improved.
The foundation that is used for the minimum networking unit failure model of two-dimentional mesh net need not to allow node know the fault distributed intelligence of the overall situation.Each node only needs the two parts of safety informations of situation storage according to adjacent node, and portion is marked at the safety information on x+y+ (x-y-) direction, and another part is marked at the safety information on x+y-(x-y+) direction.
We are the labeling process of example explanation safety information with x+y+ (x-y-) direction.During initial condition, all non-fault points all are marked as security node; If the neighbor node of a point of safes on x+ direction and y+ direction all is fault point or dangerous point, perhaps the neighbor node on x-direction and y-direction all is fault point or dangerous point, and this node just is marked as dangerous node so; Carry out above labeling process repeatedly, reach stable state up to the fail safe of all nodes and no longer change.
Minimum networking unit failure model is extended to 3-D mesh.We are that example illustrates its labeling process with x+y+z+ (x-y-z-) direction.During initial condition, all non-fault points all are marked as safety; If a point of safes is at x+, y+, three directions of z+ (or x-, y-, equal fault point of neighbor node z-) or dangerous node, so, this node just is marked as dangerous node; It is stable until a have safe condition to carry out above process repeatedly.Three-dimensional minimum networking unit failure model can be labeled as dangerous node with point still less, the safety information that each node need be preserved is a four-tuple (a, b, c, d), corresponding to the direction of 4 different body diagonals of 3-D mesh, x+y+z+ (x-y-z-), x+y-z-(x-y+z+), x+y+z-(x-y-z+), x+y-z+ (x-y+z-).A, b, c, the value of d can be safety, dangerous or fault.
Summary of the invention
The purpose of this invention has been to design a kind of method for routing of avoiding deadlock based on the mesh net of channel overlapping.Mix at the tunnel branch, allow to share between the different virtual subnet some tunnel.
The invention is characterized in that described method is that two-dimentional the net on each node at mesh carried out, and contains following steps successively:
Step (1): initialization
The mesh net of a two dimension is divided into following four virtual subnet: x-y-, x-y+, x+y-, x+y+, and x+, x-promptly are illustrated in the route of the positive and negative direction on the x axle, for the y axle in like manner;
We use c being divided into two tunnels in every physical channel
iExpression, i=1,2;
Virtual subnet x-y-, x-y+ are merged, obtain virtual subnet x-y
*(c
1-, c
1), the label in the bracket represents to be assigned to the tunnel in each virtual subnet, the positive negative direction of "+" and "-" expression transmission of messages, "
*" represent positive and negative any direction, wherein x-y
*(c
1-, c
1) represent message for all routes on virtual subnet x-y-, x-y+, on the x direction, all use c
1-passage uses c on the y direction
1Passage;
Virtual subnet x+y-, x+y+ are merged, obtain virtual subnet x+y
*(c
1+, c
2), x+y wherein
*(c
1+, c
2) represent message for all routes on virtual subnet x+y-, x+y+, on the x direction, all use c
1+ passage uses c on the y direction
2Passage;
For the message of the route that on the y direction, detours, use to be different from former distribution tunnel (c
1Or c
2) an other tunnel (c
2Or c
1), when recovering the shortest path route, gain former distribution tunnel again, for the message of the route that on the x direction, detours, owing to c on the x direction
2Be idle channel;
Step (2): the complete self adaptation route of under the selected tunnel of step (1) distributes, carrying out two-dimentional mesh net according to the following steps;
Step (2.1): calculate present node and the distance of destination node on x direction and y direction, handle step by step by different situations;
Step (2.2): if present node and destination node on x direction and y direction distance and be 0, then route is finished;
Step (2.3): if present node and destination node on x direction and y direction distance and be 1, then message is routed directly to destination node;
Step (2.4): if present node and destination node on x direction and y direction distance and more than or equal to 2, and present node and destination node only in one direction distance is non-vanishing, message route on this dimension direction then;
Step (2.5): if present node and the destination node distance on x direction and y direction is all non-vanishing, then message is preferentially selected route on the x direction.
For 3-D mesh, said method is netted at mesh and is carried out on each node, contains following steps successively:
Step (1): initialization
The mesh net of a three-dimensional is divided into following eight virtual subnet: x+y+z+, x+y+z-, x+y-z+, x+y-z-, x-y+z+, x-y+z-, x-y-z+, x-y-z-, and x+, x-promptly are illustrated in the route of the positive and negative direction on the x axle, for y axle, z axle in like manner;
We use c being divided into two tunnels in every physical channel
iExpression, i=1,2;
Above-mentioned eight virtual subnets are merged in twos, thereby obtain following four virtual subnet: x+y+z
*(c
1+, c
1+, c
1), x+y-z
*(c
2+, c
1-, c
1), x-y
*Z+ (c
1-, c
2, c
2+), x-y
*Z-(c
2-, c
2, c
2-), the label in the bracket represents to be assigned to the tunnel in each virtual subnet, the positive negative direction of "+" and "-" expression transmission of messages, "
*" represent positive and negative any direction, x+y+z
*And x+y-z
*On the z direction, share c
1Passage, x-y
*Z+ and x-y
*Z-shares c on the y direction
2Passage, thus at x, y, on three directions of z, two tunnels have all only been used in every physical channel, and when message was turned from the y+ direction to the z direction, message jumped to an other tunnel that is different from former distribution passage, has avoided deadlock;
3-D mesh is divided into xy, yz and three two dimensional surfaces of zx;
Step (2): the complete self adaptation route of under the selected tunnel of step (1) distributes, carrying out 3-D mesh according to the following steps;
Step (2.1): calculate present node and the distance of destination node on x direction, y direction and z direction, handle step by step by different situations;
Step (2.2): if present node and destination node on x direction, y direction, z direction distance and be 0, then route is finished;
Step (2.3): if present node and destination node on x direction, y direction and z direction distance and be 1, then message is routed directly to destination node;
Step (2.4): if present node and destination node on x direction, y direction and z direction distance and more than or equal to 2, and present node and destination node only in one direction distance is non-vanishing, message route on this dimension direction then;
Step (2.5): if present node and the destination node distance on x direction, y direction and z direction is all non-vanishing, then message is preferentially selected route on the z direction.
Said method uses the minimum networking unit failure model of setting up for each two dimensional surface to expand to the method for routing that a kind of fault-tolerant mesh net is avoided deadlock, and its step is as follows:
Step (1): in selected xy, yz or xy, yz, zx plane, set up minimum networking unit failure model respectively, in selected each plane, node is at x+y+ and x-y-, y+z+ and y-z-, difference computational security information on each comfortable two diagonal of z+x+ and z-x-, if a node becomes the direction of symmetric relation to have fault or dangerous node at two with diagonal, this node is marked as dangerous node so, through too much wheel calculating, reach stable state until each node security;
Step (2): calculate present node and the distance of destination node on two-dimensional directional;
Step (3): handle respectively by different situations according to step (2) result calculated;
If the distance of present node and destination node is 0, then route is finished;
If present node and destination node in the distance of each dimension and be 1, then route messages to destination node;
If present node and destination node in the distance of each dimension with more than or equal to 2, and present node and destination node be malfunctioning node on apart from non-vanishing and route direction on the dimension only, routing failure then, otherwise on this dimension direction route;
If present node and destination node only on bidimensional distance non-vanishing, then examine or check the two dimension minimum of setting up this plane in the unit failure model that networks;
If next node is then routing failure of fault point or dangerous point on two dimension directions, otherwise selects a usable direction in two dimension directions to carry out route, preferentially select the z direction;
If present node and destination node distance on three-dimensional is all non-vanishing, then examine or check the minimum networking unit failure model on xy, yz, three directions of zx: use xy or the minimum networking of zx unit failure model in the x direction, the y direction is used yz or the minimum networking of xy unit failure model, and the z direction is used yz or the minimum networking of zx unit failure model;
If next node is fault point or dangerous point, then routing failure on three dimension directions; Otherwise select one in three dimension directions to carry out route, preferentially select the z direction to carry out route.
Adopt our method in the mesh grid, to carry out fault-tolerant route, compare with the Gomez method with traditional PAR method, when the standardization input load improved, our method obviously can improve the network actual flow, and the reduction transmission delay, thereby improve the transmission performance of whole network.
Description of drawings
The detour deadlock of route messages of Fig. 1 is avoided.
Fig. 2 realizes that the tunnel that does not have the complete self adaptation route of deadlock overlaps.
The standardization input load is to Effect on Performance in Fig. 3 fault-free network:
Nodal cache: 216 microplate fault numbers: 0.
The nodal cache size is to Effect on Performance in Fig. 4 fault-free network:
Input load: 0.4 fault number: 0.
The fault point number is to Effect on Performance in Fig. 5 fault tolerant network:
Input load: 0.4 nodal cache: 234 microplates.
The standardization input load is to Effect on Performance in Fig. 6 fault tolerant network:
Nodal cache: 234 microplate fault numbers: 10.
Fig. 7 avoids the method for routing flow chart of deadlock based on the mesh net of channel overlapping.
Embodiment
A physical network can be divided into several virtual subnets.The message of inserting network is limited in carrying out in some virtual subnets route.As long as in each virtual subnet, there is not deadlock, and can not form deadlock between each virtual subnet, just can guarantee deadlock can not occur in the whole network.The division methods of Ti Chuing is primarily aimed at two dimension and three-dimensional mesh net herein, and this method also can be expanded and be used for the more network of higher-dimension.
The mesh net of a two dimension can be divided into following four virtual subnet: 1.x-y-, 2.x-y+, 3.x+y-, 4.x+y+.We use c
iRepresent the i bar tunnel in the physical channel.In above-mentioned four virtual subnets, 1 and 2,3 and 4 can merge in twos, thereby obtain two virtual subnets, x-y
*(c
1-, c
1) and x+y
*(c
1+, c
2).Label in the bracket represents to be assigned to the tunnel in each virtual subnet, for example, and x+y
*(c
1+, c
2) represent message for all the 3rd classes and the 4th class, on the x direction, all use c
1+ passage uses c on the y direction
2Passage.The positive negative direction of "+" and "-" expression transmission of messages, "
*" represent positive and negative any direction.Below we will propose to use two tunnels just can realize not having the method for deadlock self adaptation route and the proof of correlation theorem in two-dimentional mesh net.
For two-dimentional mesh net,,, all can not exist the ring of passage relevant in any one virtual subnet according to above-mentioned virtual subnet division methods if do not allow to detour route (deroute).The message of the route that detours has the possibility that forms deadlock, and we avoid this deadlock by such method: for the message of the route that detours on the y direction, use to be different from former distribution tunnel (c
1Or c
2) an other tunnel (c
2Or c
1), when recovering the shortest path route, gain former distribution tunnel again; For the message of the route that on the x direction, detours, owing to c on the x direction
2Be idle channel, so the route messages that detours all uses c
2Passage can realize that deadlock avoids.
As shown in Figure 1, be that two kinds of rings that may form are relevant (a) with (b), the difference turning type of the numeral route messages of mark on the arrow.As can be seen from the figure, normal route messages with detour that also may to produce ring between the route messages relevant, needs deadlock avoiding method correspondingly.Relevant with the ring among Fig. 1 (a) is example, and we are assigned to the c of x direction at the route messages that the 1st class and the 4th class can be detoured
2Passage is assigned to the tunnel of another virtual subnet different with current virtual subnet with the 2nd class and the 3rd class route messages that detours.By such processing, just can avoid the relevant generation of passage ring among the figure.
Three-dimensional mesh net can be divided into following eight virtual subnets: (1) x+y+z+, (2) x+y+z-, (3) x+y-z+, (4) x+y-z-, (5) x-y+z+, (6) x-y+z-, (7) x-y-z+, (8) x-y-z-.These eight virtual subnets can merge in twos, thereby obtain following four virtual subnet: x+y+z
*(c
1+, c
1+, c
1), x+y-z
*(c
2+, c
1-, c
1), x-y
*Z+ (c
1-, c
2, c
2+), x-y
*Z-(c
2-, c
2, c
2-).In these four virtual subnets, x+y+z
*And x+y-z
*On the z direction, share c
1Passage, x-y
*Z+ and x-y
*Z-shares c on the y direction
2Passage.Be not difficult to find out, at x, y, on three directions of z, two tunnels have all only been used in every physical channel.
As shown in Figure 2, the route-type of the numeral message on the turning arrow, the route messages in the network can be divided into eight classes according to the relative position relation of its source node and destination node, respectively corresponding foregoing eight virtual subnets.As can be seen from the figure, it is relevant that 1,2,3,4 four class message may form ring shown in Fig. 1 (a), and it is relevant that 5,6,7,8 four class message may form the ring shown in Fig. 1 (c).Be not difficult to find out that ring is relevant only may to be created between y direction and the z direction, all impossible generation encircles relevant between x direction and the y direction and between x direction and the z direction.For the relevant elimination of ring among Fig. 1 (a) and Fig. 1 (c), we can turn and realize that the message that promptly with dashed lines draws among the figure is turned by limiting some message.The method that the restriction dotted line is turned, to the 1st class message, when its during by y directional steering z direction, use c
2The c of+passage rather than former distribution
1+ passage; Similarly, when the 3rd class message during, use c by y directional steering z direction
2-passage.The 5th class and the 6th class message that are designated as dotted line also can realize the restriction of turning by same method.
In traditional plane self-adapted routing method route is divided into a plurality of stages, can only be in a specific plane in each stage route, so just limited the adaptivity of route.Different with plane self-adapted route, the method that this paper proposes is not confined to message in some planes when route, the any direction that route messages can be chosen on the shortest path carries out route, has so just strengthened the adaptivity of route, thereby brings the raising on the performance.To needing to do turning to the message of z direction of special processing among Fig. 2 by the y direction, we can reduce the probability of its appearance as much as possible by such inspiration method: for the route messages that falls into any subnet, when route, under the possible situation, preferentially select the z direction to do next and jump route.
The foundation that is used for the minimum networking unit failure model of two-dimentional mesh net need not to allow node know the fault distributed intelligence of the overall situation.We are the labeling process of example explanation safety information with x+y+ (x-y-) direction.During initial condition, all non-fault points all are marked as security node; If the neighbor node of a point of safes on x+ direction and y+ direction all is fault point or dangerous point, perhaps the neighbor node on x-direction and y-direction all is fault point or dangerous point, and this node just is marked as dangerous node so; Carry out above labeling process repeatedly, reach stable state up to the fail safe of all nodes and no longer change.
Minimum networking unit failure model is extended to 3-D mesh.We are that example illustrates its labeling process with x+y+z+ (x-y-z-) direction.During initial condition, all non-fault points all are marked as safety; If a point of safes is at x+, y+, three directions of z+ (or x-, y-, equal fault point of neighbor node z-) or dangerous node, so, this node just is marked as dangerous node; It is stable until a have safe condition to carry out above process repeatedly.Three-dimensional minimum networking unit failure model can be labeled as dangerous node with point still less, the safety information that each node need be preserved is a four-tuple (a, b, c, d), corresponding to the direction of 4 different body diagonals of 3-D mesh, x+y+z+ (x-y-z-), x+y-z-(x-y+z+), x+y+z-(x-y-z+), x+y-z+ (x-y+z-).A, b, c, the value of d can be safety, dangerous or fault.
The present invention uses a kind of new method and comes the safety information of flag node.(x-y, y-z z-x) calculate respectively, calculate the minimum networking of two dimension unit failure model in each plane, and node is preserved two parts of safety informations on the both direction in the plane in three planes at its place in the fail safe of node.Like this, each node needs to preserve six parts of safety informations altogether.
Divide and the tunnel allocation strategy based on above-mentioned virtual subnet, provide the complete adaptive routing method of no deadlock in the 3-D mesh below.This method for routing also can expand in the network of higher-dimension more.Below narrate the complete adaptive routing method of 3-D mesh:
Be input as current some present node, the impact point destination node is calculated present node and the distance of destination node on all directions earlier, if the distance of present node and destination node is 0, route is finished, and message is digested at present node; If the distance of present node and destination node is 1, route messages to destination node.If the distance of present node and destination node is not less than 2: if present node and destination node only on a dimension distance non-vanishing, route on this dimension direction then; If the request channel is taken by other message, then wait for to passage being released; If present node and destination node only on two dimensions the distance non-vanishing, then select one in two dimension directions to carry out route, preferentially select the z direction; If present node and destination node all apart from all non-vanishing, then select one in three dimension directions to carry out route, preferentially select the z direction on three-dimensional.
This paper has realized the adaptive fault-tolerant method for routing of a kind of new no deadlock based on the channel overlapping technology.This method does not need to carry out passage to be reserved, and only needs two tunnels just can realize complete adaptive route every physical channel.This method for routing uses the minimum networking of two dimension unit failure model, shown in procedure is described below:
Be input as current some present node, the impact point destination node is calculated present node and the distance of destination node on all directions earlier, if the distance of r and destination node is 0, then route is finished, and message is digested at present node; If the distance of present node and destination node is 1, then route messages to destination node.If the distance of present node and destination node is not less than 2: if present node and destination node only are being malfunctioning node on the non-vanishing and route direction of distance on the dimension, routing failure then, otherwise on this dimension direction route; If the request channel is taken by other message, then wait for to passage being released; If present node and destination node only on bidimensional distance non-vanishing then investigate the minimum networking of the two dimension unit failure model safety information of setting up in this plane: if next node is fault point or dangerous point then routing failure on two dimension directions, otherwise select a usable direction in two dimension directions to carry out route, preferentially select the z direction.If present node and destination node distance on three-dimensional is all non-vanishing, then investigate x, y, minimum networking unit failure model safety information on three directions of z: use safety information in xy or the zx plane for the x direction, the y direction is used safety information in yz or the xy plane, and the z direction is used safety information in yz or the zx plane; If next node is fault point or dangerous point, then routing failure on three dimension directions; Otherwise select one in three dimension directions to carry out route, preferentially select the z direction.
Claims (3)
1. avoid the method for routing of deadlock based on the mesh net of channel overlapping, it is characterized in that, mix at the tunnel branch, allow to share between the different virtual subnet some tunnel, for two-dimentional mesh net, said method is netted at mesh and is carried out on each node, contains following steps successively:
Step (1): initialization
The mesh net of a two dimension is divided into following four virtual subnet: x-y-, x-y+, x+y-, x+y+, and x+, x-promptly are illustrated in the route of the positive and negative direction on the x axle, for the y axle in like manner;
We use c being divided into two tunnels in every physical channel
iExpression, i=1,2;
Virtual subnet x-y-, x-y+ are merged, obtain virtual subnet x-y* (c
1-, c
1), the label in the bracket represents to be assigned to the tunnel in each virtual subnet, the positive negative direction of "+" and "-" expression transmission of messages, and " * " represents positive and negative any direction, wherein x-y* (c
1-, c
1) represent message for all routes on virtual subnet x-y-, x-y+, on the x direction, all use c
1-passage uses c on the y direction
1Passage;
Virtual subnet x+y-, x+y+ are merged, obtain virtual subnet x+y* (c
1+, c
2), x+y* (c wherein
1+, c
2) represent message for all routes on virtual subnet x+y-, x+y+, on the x direction, all use c
1+ passage uses c on the y direction
2Passage;
For the message of the route that on the y direction, detours, use respectively successively to be different from former distribution tunnel c
1Or c
2An other tunnel c
2Or c
1, when recovering the shortest path route, gain former distribution tunnel again, for the message of the route that on the x direction, detours, owing to c on the x direction
2Be idle channel;
Step (2): the complete self adaptation route of under the selected tunnel of step (1) distributes, carrying out two-dimentional mesh net according to the following steps;
Step (2.1): calculate present node and the distance of destination node on x direction and y direction, handle step by step by different situations;
Step (2.2): if present node and destination node on x direction and y direction distance and be 0, then route is finished;
Step (2.3): if present node and destination node on x direction and y direction distance and be 1, then message is routed directly to destination node;
Step (2.4): if present node and destination node on x direction and y direction distance and more than or equal to 2, and present node and destination node only in one direction distance is non-vanishing, message route on this dimension direction then;
Step (2.5): if present node and the destination node distance on x direction and y direction is all non-vanishing, then message is preferentially selected route on the x direction.
2. avoid the method for routing of deadlock based on the mesh net of channel overlapping, it is characterized in that, mix at the tunnel branch, allow to share between the different virtual subnet some tunnel, for 3-D mesh, said method is netted at mesh and is carried out on each node, contains following steps successively:
Step (1): initialization
The mesh net of a three-dimensional is divided into following eight virtual subnet: x+y+z+, x+y+z-, x+y-z+, x+y-z-, x-y+z+, x-y+z-, x-y-z+, x-y-z-, and x+, x-promptly are illustrated in the route of the positive and negative direction on the x axle, for y axle, z axle in like manner;
We use c being divided into two tunnels in every physical channel
iExpression, i=1,2;
Above-mentioned eight virtual subnets are merged in twos, thereby obtain following four virtual subnets: x+y+z* (c
1+, c
1+, c
1), x+y-z* (c
2+, c
1-, c
1), x-y*z+ (c
1-, c
2, c
2+), x-y*z-(c
2-, c
2, c
2-), the label in the bracket represents to be assigned to the tunnel in each virtual subnet, the positive negative direction of "+" and "-" expression transmission of messages, and " * " represents positive and negative any direction, x+y+z* and x+y-z* share c on the z direction
1Passage, x-y*z+ and x-y*z-are shared c on the y direction
2Passage, thus at x, y, on three directions of z, two tunnels have all only been used in every physical channel, and when message was turned from the y+ direction to the z direction, message jumped to an other tunnel that is different from former distribution passage, has avoided deadlock;
3-D mesh is divided into xy, yz and three two dimensional surfaces of zx;
Step (2): the complete self adaptation route of under the selected tunnel of step (1) distributes, carrying out 3-D mesh according to the following steps;
Step (2.1): calculate present node and the distance of destination node on x direction, y direction and z direction, handle step by step by different situations;
Step (2.2): if present node and destination node on x direction, y direction and z direction distance and be 0, then route is finished;
Step (2.3): if present node and destination node on x direction, y direction and z direction distance and be 1, then message is routed directly to destination node;
Step (2.4): if present node and destination node on x direction, y direction and z direction distance and more than or equal to 2, and present node and destination node only in one direction distance is non-vanishing, message route on this dimension direction then;
Step (2.5): if present node and the destination node distance on x direction, y direction and z direction is all non-vanishing, then message is preferentially selected route on the z direction.
3. for the method for routing of the described avoiding dead lock in fault tolerance mesh based on channel overlapping of any one claim in claim 1 or the claim 2, it is characterized in that, described method uses the minimum networking unit failure model of setting up for each two dimensional surface to expand to the method for routing that a kind of fault-tolerant mesh net is avoided deadlock, and its step is as follows:
Step (1): in selected xy, yz or xy, yz, zx plane, set up minimum networking unit failure model respectively, in selected each plane, node is at x+y+ and x-y-, y+z+ and y-z-, difference computational security information on each comfortable two diagonal of z+x+ and z-x-, if a node becomes the direction of symmetric relation to have fault or dangerous node at two with diagonal, this node is marked as dangerous node so, through too much wheel calculating, reach stable state until each node security;
Step (2): calculate present node and the distance of destination node on two-dimensional directional;
Step (3): handle respectively by different situations according to step (2) result calculated;
If the distance of present node and destination node is 0, then route is finished;
If present node and destination node in the distance of each dimension and be 1, then route messages to destination node;
If present node and destination node in the distance of each dimension with more than or equal to 2, and present node and destination node be malfunctioning node on apart from non-vanishing and route direction on the dimension only, routing failure then, otherwise on this dimension direction route;
If present node and destination node only on bidimensional distance non-vanishing, then examine or check the two dimension minimum of setting up this plane in the unit failure model that networks;
If next node is then routing failure of fault point or dangerous point on two dimension directions, otherwise selects a usable direction in two dimension directions to carry out route, preferentially select the z direction;
If present node and destination node distance on three-dimensional is all non-vanishing, then examine or check the minimum networking unit failure model on xy, yz, three directions of zx: use xy or the minimum networking of zx unit failure model in the x direction, the y direction is used yz or the minimum networking of xy unit failure model, and the z direction is used yz or the minimum networking of zx unit failure model;
If next node is fault point or dangerous point, then routing failure on three dimension directions; Otherwise select one in three dimension directions to carry out route, preferentially select the z direction to carry out route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101016016A CN101262444A (en) | 2008-03-10 | 2008-03-10 | Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008101016016A CN101262444A (en) | 2008-03-10 | 2008-03-10 | Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101262444A true CN101262444A (en) | 2008-09-10 |
Family
ID=39962654
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008101016016A Pending CN101262444A (en) | 2008-03-10 | 2008-03-10 | Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101262444A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102301365A (en) * | 2009-01-30 | 2011-12-28 | 富士通株式会社 | Information Processing System, Information Processing Device, Control Method For Information Processing Device, Control Program For Information Processing Device, And Computer-readable Recording Medium |
| CN102333038A (en) * | 2011-10-21 | 2012-01-25 | 上海交通大学 | Non deadlock routing method based on network on chip |
| CN102437953A (en) * | 2011-12-14 | 2012-05-02 | 清华大学 | Low-power-consumption adaptive routing method in network on chip |
| CN103179034A (en) * | 2011-12-22 | 2013-06-26 | 清华大学 | Deadlock-free adaptive routing method |
| CN106254254A (en) * | 2016-09-19 | 2016-12-21 | 复旦大学 | A kind of network-on-chip communication means based on Mesh topological structure |
| CN110048947A (en) * | 2019-03-06 | 2019-07-23 | 清华大学 | The adaptive routing method and electronic equipment of data packet in two-dimentional Mesh network |
| CN111865782A (en) * | 2019-04-29 | 2020-10-30 | 清华大学 | Three-dimensional integrated circuit and routing method |
| CN112350929A (en) * | 2019-08-08 | 2021-02-09 | 特拉维夫迈络思科技有限公司 | Generating deadlock free routes in lossless Cartesian topology with a minimum number of virtual channels |
| US11425027B2 (en) | 2020-11-01 | 2022-08-23 | Mellanox Technologies, Ltd. | Turn-based deadlock-free routing in a Cartesian topology |
| CN115277551A (en) * | 2022-07-28 | 2022-11-01 | 上海交通大学 | Modular three-dimensional network-on-chip deadlock-free routing system and method based on ring structure |
| CN117135110A (en) * | 2023-10-25 | 2023-11-28 | 苏州元脑智能科技有限公司 | Self-adaptive routing method, device, system, equipment and storage medium |
-
2008
- 2008-03-10 CN CNA2008101016016A patent/CN101262444A/en active Pending
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102301365A (en) * | 2009-01-30 | 2011-12-28 | 富士通株式会社 | Information Processing System, Information Processing Device, Control Method For Information Processing Device, Control Program For Information Processing Device, And Computer-readable Recording Medium |
| CN102301365B (en) * | 2009-01-30 | 2013-12-25 | 富士通株式会社 | Information processing system, information processing device, control method for information processing device, control program for information processing device, and computer-readable recording medium |
| CN102333038A (en) * | 2011-10-21 | 2012-01-25 | 上海交通大学 | Non deadlock routing method based on network on chip |
| CN102333038B (en) * | 2011-10-21 | 2013-11-13 | 上海交通大学 | Non deadlock routing method based on network on chip |
| CN102437953A (en) * | 2011-12-14 | 2012-05-02 | 清华大学 | Low-power-consumption adaptive routing method in network on chip |
| CN102437953B (en) * | 2011-12-14 | 2014-07-30 | 清华大学 | Low-power-consumption adaptive routing method in network on chip |
| CN103179034A (en) * | 2011-12-22 | 2013-06-26 | 清华大学 | Deadlock-free adaptive routing method |
| CN103179034B (en) * | 2011-12-22 | 2016-01-20 | 清华大学 | Adaptive routing method without dead |
| CN106254254A (en) * | 2016-09-19 | 2016-12-21 | 复旦大学 | A kind of network-on-chip communication means based on Mesh topological structure |
| CN110048947B (en) * | 2019-03-06 | 2020-06-16 | 清华大学 | Self-adaptive routing method of data packet in two-dimensional Mesh network and electronic equipment |
| CN110048947A (en) * | 2019-03-06 | 2019-07-23 | 清华大学 | The adaptive routing method and electronic equipment of data packet in two-dimentional Mesh network |
| CN111865782A (en) * | 2019-04-29 | 2020-10-30 | 清华大学 | Three-dimensional integrated circuit and routing method |
| CN111865782B (en) * | 2019-04-29 | 2021-08-06 | 清华大学 | Three-dimensional integrated circuit and routing method |
| CN112350929A (en) * | 2019-08-08 | 2021-02-09 | 特拉维夫迈络思科技有限公司 | Generating deadlock free routes in lossless Cartesian topology with a minimum number of virtual channels |
| CN112350929B (en) * | 2019-08-08 | 2022-07-05 | 迈络思科技有限公司 | Apparatus and method for generating deadlock free route in topology by virtual channel |
| US11770326B2 (en) | 2019-08-08 | 2023-09-26 | Mellanox Technologies, Ltd. | Producing deadlock-free routes in lossless cartesian topologies with minimal number of virtual lanes |
| US11425027B2 (en) | 2020-11-01 | 2022-08-23 | Mellanox Technologies, Ltd. | Turn-based deadlock-free routing in a Cartesian topology |
| CN115277551A (en) * | 2022-07-28 | 2022-11-01 | 上海交通大学 | Modular three-dimensional network-on-chip deadlock-free routing system and method based on ring structure |
| CN115277551B (en) * | 2022-07-28 | 2024-01-12 | 上海交通大学 | Modularized three-dimensional network-on-chip deadlock-free routing system and method based on annular structure |
| CN117135110A (en) * | 2023-10-25 | 2023-11-28 | 苏州元脑智能科技有限公司 | Self-adaptive routing method, device, system, equipment and storage medium |
| CN117135110B (en) * | 2023-10-25 | 2024-03-01 | 苏州元脑智能科技有限公司 | Self-adaptive routing method, device, system, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101262444A (en) | Routing method for avoiding dead lock in fault tolerance mesh based on channel overlapping | |
| CN101335704B (en) | Adaptive routing method without dead lock in three-dimensional torus network | |
| CN103986664B (en) | A kind of mixing for network-on-chip interconnects Mesh topological structures and its routing algorithm | |
| US9015448B2 (en) | Message broadcast with router bypassing | |
| CN104539547B (en) | A kind of router and method for routing for three dimensional integrated circuits network-on-chip | |
| Nguyen et al. | A context-aware mobile learning adaptive system for supporting foreigner learning English | |
| Bahmani et al. | A 3D-NoC router implementation exploiting vertically-partially-connected topologies | |
| CN104579951B (en) | Novel failure and the fault-tolerance approach under congestion model in network-on-chip | |
| CN103580890A (en) | Reconfigurable on-chip network structure and configuration method thereof | |
| CN102761475A (en) | Internetwork-on-chip fault-tolerance routing method based on channel dependency graphs | |
| Singh et al. | Performance evalulation of different routing algorithms in Network on Chip | |
| CN101267394A (en) | No dead lock plane self-adapted routing method in 3-D mesh | |
| CN114844827B (en) | Shared storage-based spanning tree routing hardware architecture and method for network-on-chip | |
| CN101242372A (en) | Non lock routing method for k-element N-dimension mesh | |
| Hsin et al. | Ant colony optimization-based fault-aware routing in mesh-based network-on-chip systems | |
| Fukushima et al. | Fault-tolerant routing algorithm for network on chip without virtual channels | |
| CN101267398B (en) | Non deal lock self-adapted routing method in 2-D torus network | |
| Sinha et al. | D n-FTR: Fault-tolerant routing algorithm for Mesh based network-on-chip | |
| CN116886591B (en) | Computer network system and routing method | |
| Fukushima et al. | A hardware-oriented fault-tolerant routing algorithm for irregular 2D-mesh network-on-chip without virtual channels | |
| Zhou et al. | HARS: a high-performance reliable routing scheme for 3D NoCs | |
| Li et al. | Fault tolerant routing algorithm based on the artificial potential field model in Network-on-Chip | |
| US7561584B1 (en) | Implementation of a graph property in a switching fabric for fast networking | |
| Zhang et al. | Very fine-grained fault-tolerant routing algorithm of NoC based on buffer reuse | |
| Kumar et al. | Reconfigurable distributed fault tolerant routing algorithm for on-chip networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20080910 |