Self-adaptive routing method and device for computing network

Abstract

The invention discloses a self-adaptive routing method for a computing network, which is realized by utilizing the computing network, and the computing network comprises computing nodes, a router network and a transmission link. The method comprises the following steps: acquiring a to-be-transmitted data packet and network structure information; the data packet to be transmitted comprises a data stream, a source address and a target address; carrying out segmentation and division processing on the router network to obtain division result information; the division result information comprises a first router set # imgabs0 # and a second router set # imgabs1 #, and a router connected with a computing node corresponding to a source address and a router connected with a computing node corresponding to a target address are respectively determined according to the source address and the target address in the data packet to be transmitted; whether the router connected with the computing node corresponding to the source address and the router connected with the computing node corresponding to the target address are in the same group or not is judged, and a first judgment result is obtained; if the first judgment result is yes, processing the division result information and the network structure information by using an intra-group routing model to obtain intra-group routing information; and if the first judgment result is no, processing the division result information and the network structure information by using an inter-group routing model to obtain global routing information.

Description

Technical Field

[0001] The present invention relates to the field of high performance computing, and in particular to an adaptive routing method and device for computing networks. Background Art

[0002] With the development of large-scale HPC systems, high-performance computing (HPC) systems use high-order routers to build high-order interconnect networks with low diameter, low deployment cost and high path diversity, Dragonfly being one example. High-performance interconnect networks need to accommodate hundreds of thousands of links and routers. For example, the Slingshot interconnect supports more than 250,000 endpoints in Dragonfly, using 64-port routers, resulting in more than 400,000 links between routers. Therefore, large-scale networks inherently have a higher probability of component failure, resulting in a lower mean time between failures (MTBF). Adaptive routing is a natural way to provide fault tolerance. It exploits path diversity to avoid failures and ensures continuous system operation through network management infrastructure. However, existing adaptive routing and fault tolerance schemes for HPC systems face the following problems: (1) Relying solely on virtual channels results in significant on-chip router buffering costs, especially after a network failure occurs. (2) Completely eliminating virtual channels through steering model-based routing results in severe load imbalance and performance degradation. (3) Reprocessing information about the distribution of failures incurs significant storage and bandwidth overhead, hindering rapid response to failures in large-scale networks. Summary of the invention

[0003] The present invention mainly solves the problems existing in the adaptive routing and fault-tolerant solutions of the existing high-performance computing systems, and discloses an adaptive routing method and device for computing networks.

[0004] In a first aspect of an embodiment of the present invention, an adaptive routing method for a computing network is disclosed, which is implemented using a computing network. The computing network includes computing nodes, a router network, and transmission links. The router network is used to provide transmission links for data stream transmission between various computing nodes. The transmission links include global links and local links. The router network includes several groups. The groups are connected through global links. The groups include N1 routers. Routers in the same group are connected through local links. The routers include ports. The ports include virtual channels and corresponding buffer queues. The network structure information includes the address of each router in the computing network and the routers and computing nodes connected thereto. The method includes:

[0005] S1, obtaining a data packet to be transmitted and network structure information; the data packet to be transmitted includes a data flow, a source address and a destination address;

[0006] S2, dividing and partitioning the router network to obtain division result information; the division result information includes a first router set and the second router set

[0007] S3, according to the source address and the destination address in the data packet to be transmitted, respectively determine the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the destination address;

[0008] S4, determining whether the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the target address are in the same group, and obtaining a first determination result;

[0009] If the first judgment result is yes, using an intra-group routing model, the division result information and the network structure information are processed to obtain intra-group routing information;

[0010] If the first judgment result is no, the division result information and the network structure information are processed using an inter-group routing model to obtain global routing information.

[0011] The segmentation and division processing of the router network to obtain the segmentation result information includes:

[0012] For the routers in each group, sort them from high to low according to the router number. All the routers before N1 / 2 in the sorting are divided into the first group of the group; all the routers after N1 / 2 in the sorting are divided into the second group of the group.

[0013] Merge the first packets of all groups to obtain the first router set Using the first router set All outbound global links of the router are constructed to obtain the OUT1 link set;

[0014] Merge the second packets of all groups to obtain the second router set Using the second router set All outbound global links of the router are constructed to obtain the OUT2 link set;

[0015] Using the destination router of each link in the OUT1 link set, we construct the router set Using the destination router of each link in the OUT2 link set, we construct the router set Among them, each router set satisfies

[0016] The method of using the intra-group routing model to process the division result information and the network structure information to obtain the intra-group routing information includes:

[0017] A router is randomly selected from the group of routers connected to the computing node corresponding to the source address as the non-shortest router;

[0018] In the group of routers connected to the computing node corresponding to the source address, a router connected to the computing node corresponding to the target address is selected as the shortest router;

[0019] Using a first adaptive routing decision algorithm, the non-shortest router and the shortest router are processed to obtain an optimal router;

[0020] The transmission link between the router connected to the computing node corresponding to the source address and the optimal router is determined as intra-group routing information.

[0021] The method of using the first adaptive routing decision algorithm to process the non-shortest router and the shortest router to obtain the best router includes:

[0022] Obtaining the port occupancy value A1 of the shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0023] Get the port occupancy value A2 of the non-shortest router;

[0024] Determine whether A1-A2 is less than a preset threshold value M to obtain a second judgment result; when the second judgment result is yes, determine the shortest router as the best router; when the second judgment result is no, determine the non-shortest router as the best router; the threshold value M is a positive number.

[0025] The method of using the inter-group routing model to process the division result information and the network structure information to obtain global routing information includes:

[0026] In the group of routers connected to the computing node corresponding to the source address, a router connected to the group of routers connected to the computing node corresponding to the target address is selected as the first shortest router;

[0027] Determine the router set to which the router connected to the computing node corresponding to the source address belongs, and randomly select a router that does not belong to the same group as the router connected to the computing node corresponding to the source address and is connected from another router set different from the router set to which it belongs, and determine the group to which the router belongs, which is the intermediate group; the router set is the first router set or a second router set

[0028] Selecting a router belonging to another router set different from the router set to which the router belongs from the intermediate group as a non-shortest route;

[0029] Using a second adaptive routing decision algorithm, the non-shortest router and the first shortest router are processed to obtain a first optimal router;

[0030] In the group where the router connected to the computing node corresponding to the target address is located, a router connected to the group where the router connected to the computing node corresponding to the target address is located is selected as the second shortest router;

[0031] Using a third adaptive routing decision algorithm, processing the non-shortest router and the second shortest router to obtain a second best router;

[0032] The transmission links between the router connected to the computing node corresponding to the source address, the first shortest router, the second shortest router and the router connected to the computing node corresponding to the target address are determined as global routing information.

[0033] The method of using the second adaptive routing decision algorithm to process the non-shortest router and the first shortest router to obtain the first best router includes:

[0034] Obtaining a port occupancy value B1 of the first shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0035] Obtain the port occupancy value B2 of the non-shortest router;

[0036] Determine whether B1 / (B2+M) is less than a preset threshold value M1 to obtain a third judgment result; when the third judgment result is yes, determine that the first shortest router is the first best router; when the third judgment result is no, determine that the non-shortest router is the first best router; the threshold values ​​M and M1 are positive numbers.

[0037] The method of using the third adaptive routing decision algorithm to process the non-shortest router and the second shortest router to obtain the second best router includes:

[0038] Obtaining the port occupancy value B1 of the second shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0039] Obtain the port occupancy value B2 of the non-shortest router;

[0040] Determine whether sin[B1 / (B2+M)] is less than a preset threshold value M2 to obtain a fourth judgment result; when the fourth judgment result is yes, determine that the second shortest router is the second best router; when the fourth judgment result is no, determine that the non-shortest router is the second best router; the threshold values ​​M and M2 are positive numbers.

[0041] According to a second aspect of an embodiment of the present invention, an adaptive routing device for a computing network is disclosed, the device comprising:

[0042] A memory storing executable program code;

[0043] a processor coupled to the memory;

[0044] The processor calls the executable program code stored in the memory to execute the adaptive routing method for computing networks.

[0045] According to a third aspect of an embodiment of the present invention, a computer storable medium is disclosed, wherein the computer storable medium stores computer instructions, and when the computer instructions are called, they are used to execute the adaptive routing method for computing networks.

[0046] According to a fourth aspect of the embodiments of the present invention, an information data processing terminal is disclosed. The information data processing terminal is used to implement the adaptive routing method for computing networks.

[0047] The beneficial effects of the present invention are:

[0048] The method of the present invention increases the number of available non-minimum paths in the HPC network, improves the load balancing capability, and results in a 10% to 150% improvement in performance before and after a failure. In addition, it introduces controllable storage overhead and can be deployed in a Dragonfly network.

[0049] The proposed method provides comparable performance to previous adaptive algorithms with 3 or 4 VCs, 10%-150% better performance than the existing fault-tolerant adaptive routing HyMFR, and exhibits graceful performance degradation when Dragonfly fails. Evaluation experiments conducted on an internal simulator show that the proposed method can achieve higher performance and lower latency in both fault-free and faulty scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 1 is a flow chart for implementing the method of the present invention;

[0051] Figure 2 This is a schematic diagram of the classification of routers of the present invention. DETAILED DESCRIPTION

[0052] In order to better understand the content of the present invention, an embodiment is given here.

[0053] Figure 1 1 is a flow chart for implementing the method of the present invention; Figure 2 This is a schematic diagram of the classification of routers of the present invention.

[0054] In a first aspect of an embodiment of the present application, an adaptive routing method for a computing network is disclosed, which is implemented using a computing network, wherein the computing network includes computing nodes, a router network, and a transmission link; the router network is used to provide a transmission link for data stream transmission between various computing nodes; the transmission link includes a global link and a local link; the router network includes several groups; each group is connected through a global link; the group includes N1 routers; the routers in the same group are connected through a local link; the router includes a port; the port includes a virtual channel and a corresponding buffer queue; the network structure information includes the address of each router in the computing network and the routers and computing nodes connected thereto;

[0055] The method comprises:

[0056] S1, obtaining a data packet to be transmitted and network structure information; the data packet to be transmitted includes a data flow, a source address and a destination address;

[0057] S2, dividing and partitioning the router network to obtain division result information; the division result information includes a first router set and the second router set

[0058] S3, according to the source address and the destination address in the data packet to be transmitted, respectively determine the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the destination address;

[0059] S4, determining whether the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the target address are in the same group, and obtaining a first determination result;

[0060] If the first judgment result is yes, using an intra-group routing model, the division result information and the network structure information are processed to obtain intra-group routing information;

[0061] If the first judgment result is no, the division result information and the network structure information are processed using an inter-group routing model to obtain global routing information.

[0062] The segmentation and division processing of the router network to obtain the segmentation result information includes:

[0063] For the routers in each group, sort them from high to low according to the router number. All the routers before N1 / 2 in the sorting are divided into the first group of the group; all the routers after N1 / 2 in the sorting are divided into the second group of the group.

[0064] Merge the first packets of all groups to obtain the first router set Using the first router set All outbound global links of the router are constructed to obtain the OUT1 link set;

[0065] Merge the second packets of all groups to obtain the second router set Using the second router set All outbound global links of the router are constructed to obtain the OUT2 link set;

[0066] Using the destination router of each link in the OUT1 link set, we can construct the router set Using the destination router of each link in the OUT2 link set, we construct the router set Among them, each router set satisfies

[0067] The method of using the intra-group routing model to process the division result information and the network structure information to obtain the intra-group routing information includes:

[0068] A router is randomly selected from the group of routers connected to the computing node corresponding to the source address as the non-shortest router;

[0069] In the group of routers connected to the computing node corresponding to the source address, a router connected to the computing node corresponding to the target address is selected as the shortest router;

[0070] Using a first adaptive routing decision algorithm, the non-shortest router and the shortest router are processed to obtain an optimal router;

[0071] Determine the transmission link between the router connected to the computing node corresponding to the source address and the optimal router as intra-group routing information;

[0072] The first adaptive routing decision algorithm is used to process the non-shortest routers and the shortest routers to obtain the best router;

[0073] Obtaining the port occupancy value A1 of the shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0074] Get the port occupancy value A2 of the non-shortest router;

[0075] Determine whether A1-A2 is less than a preset threshold value M, and obtain a second determination result; when the second determination result is yes, determine the shortest router as the best router; when the second determination result is no, determine the non-shortest router as the best router; the threshold value M is a positive number;

[0076] The method of using the inter-group routing model to process the division result information and the network structure information to obtain global routing information includes:

[0077] In the group of routers connected to the computing node corresponding to the source address, a router connected to the group of routers connected to the computing node corresponding to the target address is selected as the first shortest router;

[0078] Determine the router set to which the router connected to the computing node corresponding to the source address belongs, and randomly select a router that does not belong to the same group as the router connected to the computing node corresponding to the source address and is connected from another router set different from the router set to which it belongs, and determine the group to which the router belongs, which is the intermediate group; the router set is the first router set or a second router set

[0079] Selecting a router belonging to another router set different from the router set to which the router belongs from the intermediate group as a non-shortest route;

[0080] Using a second adaptive routing decision algorithm, the non-shortest router and the first shortest router are processed to obtain a first optimal router;

[0081] In the group where the router connected to the computing node corresponding to the target address is located, a router connected to the group where the router connected to the computing node corresponding to the target address is located is selected as the second shortest router;

[0082] Using a third adaptive routing decision algorithm, processing the non-shortest router and the second shortest router to obtain a second best router;

[0083] Determine the transmission links between the router connected to the computing node corresponding to the source address, the first shortest router, the second shortest router and the router connected to the computing node corresponding to the target address as global routing information;

[0084] The non-shortest router and the first shortest router are processed by the second adaptive routing decision algorithm to obtain the first best router;

[0085] Obtaining a port occupancy value B1 of the first shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0086] Obtain the port occupancy value B2 of the non-shortest router;

[0087] Determine whether B1 / (B2+M) is less than a preset threshold value M1 to obtain a third judgment result; when the third judgment result is yes, determine that the first shortest router is the first best router; when the third judgment result is no, determine that the non-shortest router is the first best router; the threshold values ​​M and M1 are positive numbers.

[0088] The non-shortest router and the second shortest router are processed by the third adaptive routing decision algorithm to obtain the second best router;

[0089] Obtaining the port occupancy value B1 of the second shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data;

[0090] Obtain the port occupancy value B2 of the non-shortest router;

[0091] Determine whether sin[B1 / (B2+M)] is less than a preset threshold value M2 to obtain a fourth judgment result; when the fourth judgment result is yes, determine that the second shortest router is the second best router; when the fourth judgment result is no, determine that the non-shortest router is the second best router; the threshold values ​​M and M2 are positive numbers.

[0092] The router set to which it belongs is the first router set or the first router set

[0093] N1 is an even number;

[0094] The determination of the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the target address is determined according to the connection relationship between each router and the computing node in the network structure information.

[0095] The data packet to be transmitted is sent from the computing node of the source address to the computing node of the target address.

[0096] The buffer queue is used to store data received in the router port but not yet sent out; the virtual channel is a channel used for data transmission between the router and multiple downstream routers, which can store data;

[0097] The routers within the group form a fully interconnected network, and the groups also form a fully interconnected network.

[0098] According to a second aspect of an embodiment of the present invention, an adaptive routing device for a computing network is disclosed, the device comprising:

[0099] A memory storing executable program code;

[0100] a processor coupled to the memory;

[0101] The processor calls the executable program code stored in the memory to execute the adaptive routing method for computing networks.

[0102] According to a third aspect of an embodiment of the present invention, a computer storable medium is disclosed, wherein the computer storable medium stores computer instructions, and when the computer instructions are called, they are used to execute the adaptive routing method for computing networks.

[0103] According to a fourth aspect of the embodiments of the present invention, an information data processing terminal is disclosed. The information data processing terminal is used to implement the adaptive routing method for computing networks.

[0104] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. An adaptive routing method for computing networks, characterized in that: The method is implemented by using a computing network, wherein the computing network includes computing nodes, a router network, and a transmission link; the router network is used to provide a transmission link for data stream transmission between various computing nodes; the transmission link includes a global link and a local link; the router network includes several groups; each group is connected through a global link; the group includes N1 routers; the routers in the same group are connected through a local link; the router includes a port; the port includes a virtual channel and a corresponding buffer queue; The network structure information includes the address of each router in the computing network and the routers and computing nodes connected thereto; the method includes: S1, obtaining a data packet to be transmitted and network structure information; the data packet to be transmitted includes a data flow, a source address and a destination address; S2, dividing and partitioning the router network to obtain division result information; the division result information includes a first router set and the second router set S3, according to the source address and the destination address in the data packet to be transmitted, respectively determine the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the destination address; S4, determining whether the router connected to the computing node corresponding to the source address and the router connected to the computing node corresponding to the target address are in the same group, and obtaining a first determination result; If the first judgment result is yes, using an intra-group routing model, the division result information and the network structure information are processed to obtain intra-group routing information; If the first judgment result is no, the division result information and the network structure information are processed using an inter-group routing model to obtain global routing information.

2. The adaptive routing method for computing networks as claimed in claim 1, characterized in that: The segmentation and division processing of the router network to obtain the segmentation result information includes: For the routers in each group, sort them from high to low according to the router number. All the routers before N1 / 2 in the sorting are divided into the first group of the group; all the routers after N1 / 2 in the sorting are divided into the second group of the group. Merge the first packets of all groups to obtain the first router set Using the first router set All outbound global links of the router are constructed to obtain the OUT1 link set; Merge the second packets of all groups to obtain the second router set Using the second router set All outbound global links of the router are constructed to obtain the OUT2 link set; Using the destination router of each link in the OUT1 link set, we construct the router set Using the destination router of each link in the OUT2 link set, we construct the router set Among them, each router set satisfies 3. The adaptive routing method for computing networks as claimed in claim 2, characterized in that: The method of using the intra-group routing model to process the division result information and the network structure information to obtain the intra-group routing information includes: A router is randomly selected from the group of routers connected to the computing node corresponding to the source address as the non-shortest router; In the group of routers connected to the computing node corresponding to the source address, a router connected to the computing node corresponding to the target address is selected as the shortest router; Using a first adaptive routing decision algorithm, the non-shortest router and the shortest router are processed to obtain an optimal router; The transmission link between the router connected to the computing node corresponding to the source address and the optimal router is determined as intra-group routing information.

4. The adaptive routing method for computing networks as claimed in claim 3, characterized in that: The method of using the first adaptive routing decision algorithm to process the non-shortest router and the shortest router to obtain the best router includes: Obtaining the port occupancy value A1 of the shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data; Get the port occupancy value A2 of the non-shortest router; Determine whether A1-A2 is less than a preset threshold value M to obtain a second judgment result; when the second judgment result is yes, determine the shortest router as the best router; when the second judgment result is no, determine the non-shortest router as the best router; the threshold value M is a positive number.

5. The adaptive routing method for computing networks as claimed in claim 2, characterized in that: The method of using the inter-group routing model to process the division result information and the network structure information to obtain global routing information includes: In the group of routers connected to the computing node corresponding to the source address, a router connected to the group of routers connected to the computing node corresponding to the target address is selected as the first shortest router; Determine the router set to which the router connected to the computing node corresponding to the source address belongs, and randomly select a router that does not belong to the same group as the router connected to the computing node corresponding to the source address and is connected from another router set different from the router set to which it belongs, and determine the group to which the router belongs, which is the intermediate group; the router set is the first router set or a second router set Selecting a router belonging to another router set different from the router set to which the router belongs from the intermediate group as a non-shortest route; Using a second adaptive routing decision algorithm, the non-shortest router and the first shortest router are processed to obtain a first optimal router; In the group where the router connected to the computing node corresponding to the target address is located, a router connected to the group where the router connected to the computing node corresponding to the target address is located is selected as the second shortest router; Using a third adaptive routing decision algorithm, processing the non-shortest router and the second shortest router to obtain a second best router; The transmission links between the router connected to the computing node corresponding to the source address, the first shortest router, the second shortest router and the router connected to the computing node corresponding to the target address are determined as global routing information.

6. The adaptive routing method for computing networks as claimed in claim 5, characterized in that: The method of using the second adaptive routing decision algorithm to process the non-shortest router and the first shortest router to obtain the first best router includes: Obtaining a port occupancy value B1 of the first shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data; Obtain the port occupancy value B2 of the non-shortest router; Determine whether B1 / (B2+M) is less than a preset threshold value M1 to obtain a third judgment result; when the third judgment result is yes, determine that the first shortest router is the first best router; when the third judgment result is no, determine that the non-shortest router is the first best router; the threshold values ​​M and M1 are positive numbers.

7. The adaptive routing method for computing networks as claimed in claim 5, characterized in that: The method of using the third adaptive routing decision algorithm to process the non-shortest router and the second shortest router to obtain the second best router includes: Obtaining the port occupancy value B1 of the second shortest router; the port occupancy value is the number of virtual channels of the router that are fully populated with data; Obtain the port occupancy value B2 of the non-shortest router; Determine whether sin[B1 / (B2+M)] is less than a preset threshold value M2 to obtain a fourth judgment result; when the fourth judgment result is yes, determine that the second shortest router is the second best router; when the fourth judgment result is no, determine that the non-shortest router is the second best router; the threshold values ​​M and M2 are positive numbers.

8. An adaptive routing device for a computing network, characterized in that: The device comprises: A memory storing executable program code; a processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the adaptive routing method for computing networks according to any one of claims 1 to 7.

9. A computer storable medium, characterized in that: The computer storable medium stores computer instructions, and when the computer instructions are called, they are used to execute the adaptive routing method for computing networks according to any one of claims 1 to 7.

10. An information data processing terminal, characterized in that: The information data processing terminal is used to implement the adaptive routing method for computing networks as described in any one of claims 1 to 7.

Images