Construction method, device and equipment of internet independent set and readable storage medium

Abstract

The invention discloses an interconnection network independent set construction method and device, equipment and a readable storage medium, and relates to the technical field of computers. The construction method of the interconnection network independent set comprises the steps that the network dimension n of an initial folding segmentation and exchange cube network (FDSCn) is obtained, the node mark number of each processor node in the initial folding segmentation and exchange cube network (FDSCn) is created, n = 2d, and d is larger than or equal to 1; dividing the initial folding segmentation and exchange cube network (FDSCn) into a plurality of target folding segmentation and exchange cube networks (FDSC2) according to the network dimension n and the node label; a processor node is extracted from each target folding segmentation and exchange cube network (FDSC2) to form an independent set of an initial folding segmentation and exchange cube network (FDSCn), and the processor nodes in the independent set are not adjacent to each other. According to the scheme, communication conflicts between processor nodes are reduced, and the overall stability and reliability of an interconnection network are improved.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method, device, equipment and readable storage medium for constructing an independent set of an internetwork. Background Art

[0002] A high-performance parallel computer is a computer system. As the performance of computer systems continues to improve, the number of processors it has is increasing. A network that connects several processors in a specific way is called an internetwork. An internetwork can be represented by a simple graph G = (V, E), where V(G) represents the set of processor nodes in the graph and E(G) represents the edge set. The processor nodes in the graph G represent the processor nodes in the internetwork, and the edges represent the connection links between the processor nodes.

[0003] The nodes in the independent set of the Internet do not interfere with each other. When allocating frequency resources, bandwidth, storage space or computing power, it can ensure that resources are allocated to nodes that will not reduce efficiency due to mutual competition, so that effective utilization and optimal allocation of resources can be achieved. In the Internet, when multiple nodes try to transmit data through the same communication path at the same time, communication conflicts may occur, resulting in packet loss, increased transmission delay and other problems. By building independent sets, it can be ensured that there is no direct communication path between certain nodes, and no communication conflicts will occur when these nodes send data at the same time. Therefore, only nodes in the independent set are allowed to send data, thereby avoiding communication conflicts between directly adjacent nodes. In this way, even when the network is heavily loaded, the communication conflict rate can be kept low, improving the stability and reliability of the network.

[0004] Independent set is an important concept in graph theory, and plays a key role in the design, optimization and security of the Internet. Through the research and application of independent sets, we can effectively improve network performance, ensure network security and promote the effective flow of information.

[0005] There is currently no folded divide-and-swap cube (FDSC) network. n ) is a method for constructing independent sets on . Summary of the invention

[0006] The object of the present invention is to provide a method, device, apparatus and readable storage medium for constructing an independent set of interconnected networks by using a folded partitioning and switching cube network (FDSC) n) can ensure that resources are allocated to nodes that will not reduce efficiency due to mutual competition when allocating frequency resources, bandwidth, storage space or computing power. This can achieve effective utilization and optimal configuration of resources, which not only improves resource utilization, but also improves the overall stability of the system.

[0007] In order to achieve the above object, the present invention provides the following technical solutions:

[0008] In a first aspect, the present invention provides a method for constructing an independent set of interconnected networks, wherein the interconnected network is a folded partitioning and switching cube network (FDSC) n ), the interconnection network is a network obtained by connecting a plurality of processors in a specific manner, and the method comprises:

[0009] Get the initial folded split and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node, where n = 2 d And d ≥ 1;

[0010] According to the network dimension n and node label, the initial folded split and exchange cube network (FDSC n ) is divided into several target folded partitioning and switching cube networks (FDSC2);

[0011] A processor node is extracted from each target folding partitioning and switching cube network (FDSC2) to form the initial folding partitioning and switching cube network (FDSC n ), and the processor nodes in the independent set are not adjacent to each other.

[0012] In some embodiments, the initial folded partition and exchange cube network (FDSC) is converted into a network according to the network dimension n and the node labels. n ) is divided into several target folded segmentation and exchange cube networks (FDSC2), including:

[0013] Determine whether n is equal to 2;

[0014] If n is equal to 2, the target folded division and exchange cube network (FDSC2) is obtained.

[0015] In some embodiments, the method further comprises:

[0016] If n is greater than 2, the initial folded split and exchange cube network (FDSC n ) is divided into several intermediate folding, splitting and switching cube networks

[0017] Let n=n / 2, and repeat the process of determining whether n is equal to 2 until n is equal to 2.

[0018] In some embodiments, the initial folded partition and exchange cube network (FDSC) is converted into a n ) is divided into several intermediate folding, splitting and switching cube networks include:

[0019] The initial folded split and exchange cube network (FDSC n ) Identical processor nodes are grouped into the same central folding, splitting and switching cube network Get several intermediate folding, splitting and swapping cube networks

[0020] In some embodiments, a processor node is extracted from each target folded partition and exchange cube network (FDSC2) to form an initial folded partition and exchange cube network (FDSC n ), including:

[0021] The first processor node is extracted from each target folded partition and exchange cube network (FDSC2) to form a candidate set;

[0022] Let k = 2, and determine whether k is less than or equal to log2 n;

[0023] If k is greater than log2n, the candidate set is used as the initial folding split and switching cube network (FDSC n ) is an independent set.

[0024] In some embodiments, the method further comprises:

[0025] If k is less than or equal to log2 n, then find the number of processor nodes in the candidate set in e(2 k )The associated nodes on the edge;

[0026] Delete the associated nodes belonging to the candidate set from the candidate set;

[0027] Let k=k+1, and repeat the process of determining whether k is less than or equal to log2n until k is greater than log2n.

[0028] In a second aspect, the present invention further provides a device for constructing an independent set of internetworks, the device comprising:

[0029] Label creation module to obtain the initial folded split and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSCn ) is the node number of each processor node, where n = 2 d And d ≥ 1;

[0030] The network partitioning module is used to divide the initial folding partition and switching cube network (FDSC) according to the network dimension n and node label. n ) is divided into several target folded partitioning and switching cube networks (FDSC2);

[0031] The set building module is used to extract a processor node from each target folding partitioning and switching cube network (FDSC2) to form an initial folding partitioning and switching cube network (FDSC n ), and the processor nodes in the independent set are not adjacent to each other.

[0032] In a third aspect, the present invention further provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method for constructing an independent set of Internet networks provided in the first aspect is implemented.

[0033] In a fourth aspect, the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for constructing an independent set of Internet networks provided in the first aspect.

[0034] In a fifth aspect, the present invention further provides a computer program product, including a computer program, which, when executed by a processor, implements the method for constructing an independent set of interconnected networks provided in the first aspect.

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

[0036] First obtain the initial folding division and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) and then convert the initial folded partition and exchange cube network (FDSC) into a node number according to the network dimension n and the node number. n ) is divided into several target folding partitioning and switching cube networks (FDSC2); finally, a processor node is extracted from each target folding partitioning and switching cube network (FDSC2) to form an initial folding partitioning and switching cube network (FDSC n) is an independent set. The processor nodes in the independent set are not adjacent to each other. In this way, the independent set contains all the processor nodes in the target folded partitioning and switching cube network (FDSC2). These processor nodes are not interconnected and will not interfere with each other. Therefore, when allocating frequency resources, bandwidth, storage space or computing power, it can be ensured that resources are allocated to those nodes that will not reduce efficiency due to mutual competition, so that effective utilization and optimal configuration of resources can be achieved. In an interconnected network, when multiple processor nodes try to transmit data through the same communication path at the same time, communication conflicts may occur, resulting in packet loss, increased transmission delay and other problems. By constructing an independent set, it can be ensured that there is no direct communication path between these processor nodes, and no communication conflicts will occur when these processor nodes send data at the same time, which improves the stability and reliability of the network.

[0037] The above description is only an overview of the technical solution of the present invention. In order to more clearly understand the technical means of the present invention and implement it according to the contents of the specification, the following is a detailed description of the preferred embodiments of the present invention in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 A schematic diagram of the structure of a four-dimensional partitioning and switching cube network (DSC4) according to an embodiment of the present invention;

[0039] Figure 2 A schematic diagram of the structure of a four-dimensional folded partition and exchange cube network (FDSC4) according to an embodiment of the present invention;

[0040] Figure 3 A simple structural diagram of an Internet network shown in one embodiment of the present invention;

[0041] Figure 4 A schematic diagram of a flow chart of a method for constructing an independent set of internetworks according to an embodiment of the present invention;

[0042] Figure 5 A schematic diagram of the structure of an initial folding partitioning and switching cube network (FDSC2) shown in an embodiment of the present invention;

[0043] Figure 6 A schematic diagram of the structure of another four-dimensional folded partition and exchange cube network (FDSC4) shown in one embodiment of the present invention;

[0044] Figure 7 A schematic diagram of the structure of an eight-dimensional folded partition and exchange cube network (FDSC8) according to an embodiment of the present invention;

[0045] Figure 8A schematic flow chart of another method for constructing an independent set of internetworks according to an embodiment of the present invention;

[0046] Fig. 9 A schematic diagram of the structure of a device for constructing an independent set of internetworks according to an embodiment of the present invention;

[0047] Fig.10 A schematic diagram of the structure of an electronic device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0048] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0049] It should be noted that references to "one embodiment", "embodiment", "example embodiment", etc. in this specification refer to the embodiment being described which may include specific features, structures or characteristics, but not every embodiment must include these specific features, structures or characteristics. In addition, such expressions do not refer to the same embodiment. Furthermore, when describing specific features, structures or characteristics in conjunction with an embodiment, whether or not there is an explicit description, it is indicated that incorporating such features, structures or characteristics into other embodiments is within the knowledge of those skilled in the art.

[0050] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0051] In order to better understand the technical solution of the present application, the following first describes the Folded Split and Switched Cube Network (FDSC n ) is described and explained.

[0052] For integer n = 2 d and d ≥ 1, a divide-and-swap cube (DSC n Each processor node μ is represented by an n-bit binary string label, μ = μ1μ2...μ n (μ i ∈{0,1},1≤i≤n). For each 1≤k≤log2 n=d, the binary string label of the processor node μ can be divided into 3 parts, denoted as: μ=t1t2t3. Note that when k=1, then t3 is an empty string.

[0053] If d = 1, then n = 2 1 ,1≤k≤log2 n=1. t1=μ1, t2=μ2, μ=μ1μ2.

[0054] If d = 2, then n = 2 2 =4, 1≤k≤log2 n=2.

[0055] When k=1, t1=μ1μ2, t2=μ3μ4, μ=μ1μ2μ3μ4.

[0056] When k=2, t1=μ1, t2=μ2, t3=μ3μ4, μ=μ1μ2μ3μ4.

[0057] A processor node w is adjacent to μ if and only if one of the following two conditions holds:

[0058] (1) in It is the complement of μ1 (0,1 are complements of each other), and the edge between w and μ is called the e(1) edge.

[0059] (2) At this time, the edge between w and μ is called side.

[0060] like Figure 1 As shown, processor nodes 1110 and 0110 are different in the first digit of the processor node label, which meets condition 1. 1110 and 0110 are connected, and the edge between them is called e(1) edge.

[0061] When k = 1, t1 = μ1μ2, t2 = μ3μ4, μ = μ1μ2μ3μ4. For processor node μ = 1110, t1 = 11, t2 = 10. t1 ≠ t2, so μ is connected to w = 1011. The edge between 1110 and 1011 is called the e(4) edge.

[0062] When k = 2, t1 = μ1, t2 = μ2, t3 = μ3μ4. For processor node μ = 1110, t1 = 1, t2 = 1, t3 = 10. t1 = t2, so μ is connected to w = 0010. The edge between 1110 and 0010 is called the e(2) edge.

[0063] Split and swap cubes DSC n With 2 n processor nodes and 2 n-1 (d+1) edges, each processor node has d+1 neighbors, connected by d+1 edges. The d+1 edges are e(1) and Edge (1≤k≤d). For example, if d=2, then n=4, DSC n Each processor node in will be connected with one e(1) edge, one e(4) edge and one e(2) edge.

[0064] For integer n = 2 d and d ≥ 1, a folded divide and swap cube (FDSC n ) is in the Divide and Swap Cube (DSC n ) by adding an edge to each processor node. Folded Divide and Switch Cube (FDSC) n ) has 2 n processor nodes, for each processor node μ = μ1μ2...μ n , add an edge connection At this time, the edge between w and μ is called the e(f) edge.

[0065] like Figure 2 As shown, in FDSC4, for processor node 1110, it has one more e(f) edge connected to processor node 1010.

[0066] Let all e(i) edges be E i , FDSC n It has the following properties:

[0067] (1)FDSC n It is the d+2 rule.

[0068] (2)FDSC n The number of processor nodes is 2 n , the number of sides is 2 n-1 (d+2)

[0069] (3)FDSC n Can be divided into indivual

[0070] (4)|E1|=|E2|=|E4|=...=|E n |=|E f |=2 n-1

[0071] like Figure 3 As shown, given an interconnection network represented by a simple graph G = (V, E), where V is a set of processor nodes, an independent set S is a subset of the processor node set V, satisfying that any two processor nodes in S are not adjacent in G. That is, for any two processor nodes u and v in S,

[0072] Figure 3 The independent set in can be S = {v2, v3}.

[0073] In some embodiments, Figure 4 As shown in the figure, a method for constructing an independent set of interconnected networks is provided, and the interconnected network is a folded partitioning and switching cube network (FDSC n ), the interconnection network is a network obtained by connecting a plurality of processors in a specific manner, and the method comprises:

[0074] S101, obtain the initial folding segmentation and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node in .

[0075] Where n = 2 d And d≥1, the initial folding partitioning and exchanging cube network is an n-dimensional folding partitioning and exchanging cube network, and the node label is the identifier of each processor node, which is used to represent each processor node.

[0076] Specifically, the initial folded split and exchange cube network (FDSC n ) as the initial folded split and exchange cube network (FDSC n ), each processor node μ is represented by an n-bit binary string label, μ = μ1μ2...μ n (μ i ∈{0,1},1≤i≤n). For each 1≤k≤log2 n=d, the binary string label of the processor node μ can be divided into 3 parts, denoted as: μ=t1t2t3. Note that when k=1, then t3 is an empty string.

[0077] If d = 1, then n = 2 1 ,1≤k≤log2 n=1. t1=μ1, t2=μ2, μ=μ1μ2.

[0078] If d = 2, then n = 2 2 =4, 1≤k≤log2 n=2.

[0079] When k=1, t1=μ1μ2, t2=μ3μ4, μ=μ1μ2μ3μ4.

[0080] When k=2, t1=μ1, t2=μ2, t3=μ3μ4, μ=μ1μ2μ3μ4.

[0081] A processor node w is adjacent to μ if and only if one of the following two conditions holds:

[0082] (1) in It is the complement of μ1 (0 and 1 are complements of each other).

[0083] (2)

[0084] Exemplarily, when n=2, the node identifier of each processor node may be {00, 10, 11, 01}.

[0085] S102, according to the network dimension n and the node number, the initial folding, splitting and switching cube network (FDSC n ) is divided into several target folded partitioning and switching cube networks (FDSC2).

[0086] Optionally, determine whether n is equal to 2; if n is equal to 2, stop the initial folding split and exchange cube network (FDSC n ) to obtain the target folding partitioning and exchange cube network (FDSC2); if n is greater than 2, the initial folding partitioning and exchange cube network (FDSC n ) is divided into several intermediate folding, splitting and switching cube networks Let n=n / 2, and repeat the process of determining whether n is equal to 2 until n is equal to 2.

[0087] Specifically, all initial folded split and exchange cube networks (FDSC n ) are composed of several target folding segmentation and exchange cube networks (FDSC2). When n is equal to 2, it means that there is no need to continue the initial folding segmentation and exchange cube network (FDSC n ) to partition, initial folding partition and exchange cube network (FDSC n ) has been divided into the target folding partition and exchange cube network (FDSC2); when n is greater than 2, the initial folding partition and exchange cube network (FDSC n ) Identical processor nodes are grouped into the same central folding, splitting and switching cube network Get several intermediate folding, splitting and swapping cube networks Now let n = n / 2, and continue to judge whether n is equal to 2, until n is equal to 2, that is, the initial folding division and exchange cube network (FDSC n ) has been partitioned into multiple target folded partition and exchange cube networks (FDSC2).

[0088] For example, for an integer n=2 d and d ≥ 2, a FDSC n The network can be divided into indivual For example, when n=8, the FDSC8 network is first divided into 16 FDSC4 networks, and the processor nodes are labeled according to the first The processor nodes 00000000, 01000000, 10000000, 110000000, 00010000, 01010000, 10010000, 11010000, 00100000, 01100000, 10100000, 1110000, 00110000, 01110000, 10110000, 11110000, these processor nodes have the 5th to 8th bits as 0000, and will be assigned to the same FDSC4 network. Then each FDSC4 network is further divided into 4 FDSC2 networks, and the processor nodes are assigned to the corresponding FDSC2 networks according to the 3rd to 8th bits of the processor node number, and finally divided into 64 FDSC2 networks. For example, the processor nodes 00000000, 01000000, 10000000, 11000000 in the FDSC4 network above have the 3rd to 8th bits as 000000, which will be divided into a FDSC2 network. And so on, the initial folding and switching cube network (FDSC n ) division.

[0089] S103, extracting a processor node from each target folding partitioning and switching cube network (FDSC2) to form an initial folding partitioning and switching cube network (FDSC n ) is an independent set.

[0090] The processor nodes in the independent set are not adjacent to each other.

[0091] Optionally, the first processor node is extracted from each target folding partition and exchange cube network (FDSC2) to form a candidate set; let k = 2, and determine whether k is less than or equal to log2 n; if k is greater than log2 n, the candidate set is used as the initial folding partition and exchange cube network (FDSC n ) independent set; if k is less than or equal to log2 n, find the number of processor nodes in the candidate set in e(2 k ) edge; delete the associated nodes belonging to the candidate set from the candidate set; let k = k + 1, and repeatedly determine whether k is less than or equal to log2 n until k is greater than log2 n.

[0092] For example, when n=2, Figure 5 As shown, any processor node in FDSC2 is connected to other processor nodes, and each processor node has d+2=3 neighbors, that is, there are 3 edges, namely e(1), e(2), and e(f). Then for FDSC2, the set composed of any processor nodes is the independent set of FDSC2, and the independent set finally obtained can be S={00}.

[0093] When n = 4, Figure 6 As shown, the FDSC4 network is first divided into four FDSC2 networks: {0000, 0100, 1000, 1100}, {0001, 0101, 1001, 1101}, {0010, 0110, 1010, 1110}, {0011, 0111, 1011, 1111}; then the first processor node is taken from each FDSC2 to form a candidate set. Each processor node in the FDSC2 network will have an e(4) edge connected to other FDSC2 networks. Therefore, if the e(4) edge of any processor node in the candidate set is connected to another processor node that also appears in the candidate set, then one of the processor nodes needs to be deleted, and the final candidate set is the required independent set of the FDSC4 network; the final independent set can be S = {0000, 0001, 0010, 0011}.

[0094] When n = 8, Figure 7As shown, the FDSC8 network is divided into a network composed of 64 FDSC2s. The 64 FDSC2s are: {00000000, 01000000, 10000000, 11000000}, {00010000, 01010000, 10010000, 11010000}, {00100000, 01100000, 10100000, 11100000}, {00110000, 01110000, 10110000, 11110000}, {000000001, 01000001, 10000001, 11000001}, {00010001, 01010001, 1 0010001,11010001},{00100001,01100001,10100001,11100001},{00110001,01110001,10110001,11110001},{00000010,01000010,10000010,110 00010},{00010010,01010010,10010010,11010010},{00100010,01100010,10100010,11100010},{00110010,01110010,10110010,11110010},{000 00011,01000011,10000011,11000011},{00010011,01010011,10010011,11010011},{00100011,01100011,10100011,11100011},{00110011,01110 011,10110011,11110011},{00000100,01000100,10000100,11000100},{00010100,01010100,10010100,11010100},{00100100,01100100,1010010 0,11100100},{00110100,01110100,10110100,11110100},{00000101,01000101,10000101,11000101},{00010101,01010101,10010101,11010101} ,{00100101,01100101,10100101,11100101},{00110101,01110101,10110101,11110101},{00000110,01000110,10000110,11000110},{00010110,01010110,10010110,11010110},{00100110,01100110,10100110,11100110},{00110110,01110110,10110110,11110110},{00000111,01000111,10000111,11000111},{00010111,01010111,10010111,11010111},{00100111,01100111,10100111,11100111},{00110111,01110111,10110111,11110111},{00001000,01001000,10001000,11001000},{00011000,01011000,10011000,11011000},{00101000,01101000,10101000,11101000},{00111000,01111000,10111000,11111000},{00001001,01001001,10001001,11001001},{00011001,01011001,10011001,11011001},{00101001,01101001,10101001,11101001},{00111001,01111001,10111001,11111001},{00001010,01001010,10001010,11001010},{00011010,01011010,10011010,11011010},{00101010,01101010,10101010,11101010},{00111010,01111010,10111010,11111010},{00001011,01001011,10001011,11001011},{00011011,01011011,10011011,11011011},{00101011,01101011,10101011,11101011},{00111011,01111011,10111011,11111011},{00001100,01001100,10001100,11001100},{00011100,01011100,10011100,11011100},{00101100,01101100,10101100,11101100},{00111100,01111100,10111100,11111100},{00001101,01001101,10001101,11001101},{00011101,01011101,10011101,11011101},{00101101,01101101,10101101,1 1101101},{00111101,01111101,10111101,11111101},{00001110,01001110,10001110,11001110},{00011110,01011110,10011110,11011110},{ 00101110,01101110,10101110,11101110},{00111110,01111110,10111110,11111110},{00001111,01001111,10001111,11001111},{00011111,0101111,10101111,11101111},{00111111,0111111,10111111,1111111}, each of the FDSC2 networks contains 8 FDSCs. The processor node will have e(4) edges and e(8) edges connected to other FDSC2 networks. In each FDSC2, the first processor node is taken to form a candidate set. If the processor nodes connected by the e(4) edges and e(8) edges of any processor node in the candidate set are also included in the candidate set, then it is necessary to delete one of the processor nodes connected by the e(4) edges and e(8) edges. The final candidate set is the required independent set of the FDSC8 network. Finally, the independent set of the FDSC8 network is S={00000011,00110101,00001100,00001101,00101110,00111111,00110100,001 01111,00010011,00011101,00010010,00011100,00101101,00111000,00001110,00000001,00000000,00101000,00110011,00111100,00100110,0 0111101,00101001,00011011,00010001,00100100,00111110,00100101,00000010,00000111,00000110,00001001,00101010,00101011,00011010,00010110,00011000,00010111,00011001,00100111,00110010,00001010,0000101,00000101,00000100,00001111,00100010,00110110,00111001,00110111,00101100,00011110,00010101,00010100,00011111,00111010,00111011,00001000}. ,

[0095] From FDSC n Take the first processor node from each FDSC2 to form a candidate set. If any two processor nodes in the candidate set exist e(2 k ) edges (2≤k≤log2 n), then delete one of the processor nodes in the candidate set, and the final candidate set is the required FDSC n Independent set of networks.

[0096] The above-mentioned process of S102-S103 can be implemented based on a program algorithm. The program algorithms corresponding to some embodiments are as follows:

[0097]

[0098]

[0099]

[0100]

[0101] In the above embodiment, the initial folding partitioning and switching cube network (FDSC) is first obtained. n ) and create an initial folded split and exchange cube network (FDSC n ) and then convert the initial folded partition and exchange cube network (FDSC) into a node number according to the network dimension n and the node number. n ) is divided into several target folding partitioning and switching cube networks (FDSC2); finally, a processor node is extracted from each target folding partitioning and switching cube network (FDSC2) to form an initial folding partitioning and switching cube network (FDSC n) are independent sets. These processor nodes are not interconnected and will not interfere with each other. Therefore, when allocating frequency resources, bandwidth, storage space or computing power, it can ensure that resources are allocated to nodes that will not reduce efficiency due to mutual competition, so that effective utilization and optimal allocation of resources can be achieved. In an Internet network, when multiple processor nodes try to transmit data through the same communication path at the same time, communication conflicts may occur, resulting in packet loss, increased transmission delays and other problems. By building independent sets, it can be ensured that there is no direct communication path between these processor nodes. When these processor nodes send data at the same time, no communication conflicts will occur, which improves the stability and reliability of the network.

[0102] In order to more comprehensively demonstrate the present solution, this embodiment provides an optional method for constructing an independent set of interconnected networks, such as Figure 8 As shown:

[0103] S201, obtain the initial folding segmentation and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node in .

[0104] Where n = 2 d And d≥1.

[0105] S202, determine whether n is equal to 2; if so, execute S203, if not, execute S204.

[0106] S203, obtaining a target folded segmentation and exchange cube network (FDSC2).

[0107] S204, the initial folded split and exchange cube network (FDSC n ) Identical processor nodes are grouped into the same central folding, splitting and switching cube network Get several intermediate folding, splitting and swapping cube networks

[0108] S205, set n=n / 2, and return to execute S202.

[0109] S206, extracting the first processor node from each target folding partitioning and switching cube network (FDSC2) to form a candidate set.

[0110] S207, let k=2.

[0111] S208, determine whether k is less than or equal to log2 n, if so, execute S209, if not, execute S212.

[0112] S209, find out the number of processor nodes in the candidate set in e(2 k ) on the edge.

[0113] S210, deleting the associated nodes belonging to the candidate set from the candidate set.

[0114] S211, set k=k+1, and return to execute S208.

[0115] S212, the candidate set is used as the initial folding split and exchange cube network (FDSC n ) is an independent set.

[0116] The specific process of the above S201-S212 can refer to the description of the above method embodiment. The implementation principle and technical effect are similar and will not be repeated here.

[0117] Based on the same inventive concept, the embodiment of the present application also provides a device for constructing an independent set of an internet network for implementing the method for constructing an independent set of an internet network involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in the embodiments of one or more devices for constructing an independent set of an internet network provided below can refer to the limitations of the method for constructing an independent set of an internet network above, and will not be repeated here.

[0118] In one embodiment, Fig. 9 As shown, a device for constructing an independent set of interconnected networks is provided, the device comprising:

[0119] The label creation module 30 is used to obtain the initial folded partition and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node, where n = 2 d And d ≥ 1;

[0120] The network partitioning module 31 is used to divide the initial folding partitioning and switching cube network (FDSC) into n ) is divided into several target folded partitioning and switching cube networks (FDSC2);

[0121] The set building module 32 is used to extract a processor node from each target folding partitioning and switching cube network (FDSC2) to form an initial folding partitioning and switching cube network (FDSC n ), and the processor nodes in the independent set are not adjacent to each other.

[0122] In another embodiment, the above Fig. 9 The network partitioning module 31 is specifically used for:

[0123] Determine whether n is equal to 2;

[0124] If n is equal to 2, the target folded division and exchange cube network (FDSC2) is obtained.

[0125] If n is greater than 2, the initial folded split and exchange cube network (FDSC n ) is divided into several intermediate folding, splitting and switching cube networks

[0126] Specifically, the initial folded split and exchange cube network (FDSC n ) Identical processor nodes are grouped into the same central folding, splitting and switching cube network Get several intermediate folding, splitting and swapping cube networks

[0127] Let n=n / 2, and repeat the process of determining whether n is equal to 2 until n is equal to 2.

[0128] In another embodiment, the above Fig. 9 The set building module 32 is specifically used for:

[0129] The first processor node is extracted from each target folded partition and exchange cube network (FDSC2) to form a candidate set;

[0130] Let k = 2, and determine whether k is less than or equal to log2 n;

[0131] If k is greater than log2 n, the candidate set is used as the initial folded split and exchange cube network (FDSC n ) is an independent set.

[0132] If k is less than or equal to log2 n, then find the number of processor nodes in the candidate set in e(2 k )The associated nodes on the edge;

[0133] Delete the associated nodes belonging to the candidate set from the candidate set;

[0134] Let k=k+1, and repeat the process of determining whether k is less than or equal to log2 n until k is greater than log2 n.

[0135] The present application also provides an electronic device, in some implementations, referring to Fig.10As shown, the electronic device 700 includes an input unit 710, a memory 720, a processor 730, and an output unit 740. The memory 720 stores program instructions that can be run on the processor 730, and the processor 730 calls the program instructions to execute the construction method and / or technical solution based on the independent set of the Internet in the above-mentioned embodiment. The electronic device 700 can be a mobile terminal device such as a mobile phone, a computer, etc.

[0136] In addition, the embodiment of the present application also provides a computer-readable storage medium for storing a computer program for executing a method for constructing an independent set of interconnected networks. For example, a computer program instruction, when executed by a computer, can call or provide a method and / or technical solution according to the present application through the operation of the computer. The program instruction for calling the method of the present application may be stored in a fixed or removable storage medium, and / or transmitted through a data stream in a broadcast or other signal-bearing medium and / or stored in a storage medium that runs according to the program instruction.

[0137] Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, and optionally, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. In this way, the present application is not limited to any specific combination of hardware and software.

[0138] The technical features of the above embodiments may be arbitrarily integrated. To make the description concise, not all possible integrations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the integration of these technical features, they should be considered to be within the scope of this specification.

[0139] The above embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for those of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the patent of the present invention shall be subject to the attached claims.

Claims

1. A method for constructing an independent set of Internet networks, characterized in that: The interconnection network is a folded partition and switched cube network (FDSC n ), the interconnection network is a network obtained by connecting a plurality of processors in a specific manner, and the method comprises: Get the initial folded split and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node, where n = 2 d And d ≥ 1; According to the network dimension n and the node labels, the initial folded partition and exchange cube network (FDSC n ) is divided into several target folded partitioning and switching cube networks (FDSC2); A processor node is extracted from each target folding partitioning and switching cube network (FDSC2) to form the initial folding partitioning and switching cube network (FDSC n ), wherein the processor nodes in the independent set are not adjacent to each other.

2. The method for constructing an independent set of Internet networks as claimed in claim 1, characterized in that: According to the network dimension n and the node labels, the initial folded partition and exchange cube network (FDSC n ) is divided into several target folded segmentation and exchange cube networks (FDSC2), including: Determine whether n is equal to 2; If n is equal to 2, the target folded division and exchange cube network (FDSC2) is obtained.

3. The method for constructing an independent set of Internet networks as claimed in claim 2, characterized in that: The method further comprises: If n is greater than 2, the initial folded partition and exchange cube network (FDSC) is converted into n ) is divided into several intermediate folding, splitting and switching cube networks Let n=n / 2, and repeat the process of determining whether n is equal to 2 until n is equal to 2.

4. The method for constructing an independent set of Internet networks as claimed in claim 3, characterized in that: According to the node labels, the initial folded partition and exchange cube network (FDSC n ) is divided into several intermediate folding, splitting and switching cube networks include: The initial folded partition and exchange cube network (FDSC n ) Identical processor nodes are grouped into the same central folding, splitting and switching cube network Get several intermediate folding, splitting and swapping cube networks 5. The method for constructing an independent set of Internet networks according to claim 1, characterized in that: A processor node is extracted from each target folding partitioning and switching cube network (FDSC2) to form the initial folding partitioning and switching cube network (FDSC n ), including: The first processor node is extracted from each target folded partition and exchange cube network (FDSC2) to form a candidate set; Let k = 2, and determine whether k is less than or equal to log2 n; If k is greater than log2 n, the candidate set is used as the initial folded partition and exchange cube network (FDSC n ) is an independent set.

6. The method for constructing an independent set of Internet networks according to claim 5, characterized in that: The method further comprises: If k is less than or equal to log2 n, then find the number of processor nodes in the candidate set in e(2 k )The associated nodes on the edge; Deleting associated nodes belonging to the candidate set from the candidate set; Let k=k+1, and repeat the process of determining whether k is less than or equal to log2 n until k is greater than log2 n.

7. A device for constructing an independent set of Internet networks, characterized in that: The device comprises: Label creation module to obtain the initial folded split and exchange cube network (FDSC n ) and create an initial folded split and exchange cube network (FDSC n ) is the node number of each processor node, where n = 2 d And d ≥ 1; A network partitioning module is used to divide the initial folded partition and exchange cube network (FDSC) into n ) is divided into several target folded partitioning and switching cube networks (FDSC2); The set building module is used to extract a processor node from each target folding partitioning and switching cube network (FDSC2) to form the initial folding partitioning and switching cube network (FDSC n ), wherein the processor nodes in the independent set are not adjacent to each other.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for constructing an independent set of internetworks according to any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method for constructing an independent set of internetworks according to any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method for constructing an independent set of internetworks described in any one of claims 1 to 6 is implemented.

Images