TWI544766B - Network topology system and method - Google Patents

Description

Network topology system and method

The invention relates to a technical field of computer networks, and in particular to a network topology system and method.

A high-performance computer or computer system provides optimal use of hardware and software and is implemented using processing nodes that include one or more microprocessors and memory. These computer systems are sometimes referred to as shared multiprocessor systems. In a shared multiprocessor computer system, the visual processors are network nodes connected to each other so that they can communicate with each other to share operating systems, resources, Information, memory, etc.

In the parallel computing computer system, as the number of computer nodes increases, the network communication between nodes will increase greatly. In order to increase the communication speed between the two nodes, the switch is used as the communication between the nodes. However, the larger the number of nodes, the more switches are used, and the number of layers using switches such as the Fat Tree structure is also increased, resulting in a complicated structure of the entire network system. Power is consumed and the cost of the network system will increase.

In view of the above problems, an object of the present invention is to provide a network topology system and method, wherein the topology mathematical calculation method is to find a set of node connection rules for each node in a system with multiple nodes. Each node and other The number of nodes connected, so that it can construct a network topology that allows all nodes to be based on their connection rules and their connections without using a switch, making the structure of the entire network system simple and non-exchangeable. The power consumption of the network, so the cost of the network system will not increase, and each node will pass the same form of communication freedom (using the same set of connection rules), and the connection number of all nodes is very close, and the so-called democracy is achieved. Democratized Dimension.

A first aspect of the present invention provides a network topology system including: a plurality of nodes, each node being a single core chip, a processor, a computer, an internal optimization group of a set of computers, and a One of the computer centers, each node is connected to a plurality of nodes in the nodes according to a connection rule; wherein the establishing of the connection rule includes the following steps: calculating a difference between adjacent prime numbers in a prime number column, To generate a prime numerical difference series; calculate the sum of the current position value of the prime numerical difference series and the values of all previous positions to generate a communication strategy numerical sequence; take out a number of reciprocal series as a number of connected nodes The value is used as an index sequence, and the number in the number sequence of the communication strategy is taken as the value of the number of connected nodes to generate a connection strategy number sequence, wherein the value in the index sequence is the sequence position of the number sequence of the communication strategy. The value of the sequence position is the value of the connection strategy numerical sequence; and the sum of each odd number and the value in the connection strategy numerical sequence Generating a plurality of connections to the number of nodes numbered columns, linked to the connection node of rule values corresponding to the node number of the connection in series of the node number of each of odd-numbered.

A second aspect of the present invention provides a network topology method for a network topology system, the network topology system including a plurality of nodes, each node being a single core chip, a processor, A computer, an internal optimization group of a set of computers, and a computer center, the method comprising the steps of: starting, by the network topology system, any one of the nodes according to a set of connection rules Connecting with the plurality of nodes; wherein establishing the connection rule comprises the steps of: calculating a difference between adjacent prime numbers in a prime number column to generate a prime numerical difference series; calculating a value of the current position in the prime value difference series and all The sum of the values of the previous positions to generate a communication strategy numerical sequence; taking the number of the number of connected nodes in a recursive sequence as an index sequence, and extracting the number of the communication strategy numerical sequence as the number of the connected nodes The value is used to generate a connection strategy value sequence, wherein the value in the index sequence is the sequence position of the number sequence of the communication strategy, and the value of the sequence position is The value of the connection strategy value sequence; and the sum of each odd number and the value in the connection strategy value sequence to generate a plurality of connection node number sequence columns to establish a connection for each odd numbered node link The connection rule for the node of the numerical number in the node number column.

1 is a schematic diagram of a node architecture of a network topology system according to the present invention; FIG. 2 is a flowchart of a network topology method of the present invention; FIG. 3 is a flowchart of a method for establishing a connection rule according to the present invention; 4A to 4D are diagrams showing the performance comparison between the network topology system of the present invention and various network topology systems.

The present invention will be further understood by those of ordinary skill in the art to which the present invention pertains. .

FIG. 1 is a schematic diagram of a node architecture of a network topology system according to the present invention. In FIG. 1, the network topology system includes a plurality of nodes (node numbers 1, 2, ..., 16), each node being a single core on chip, a processor, a computer. , a group of internally optimized group of computers or a computational center, each node in the network topology system is based on a set of connection rules Any of the starting nodes in the nodes are connected to a plurality of nodes.

The embodiment of the present invention uses 16 nodes as an example to illustrate the communication operation of the network topology system, but the number of nodes is not limited to the present invention, and the number of nodes of the network topology system of the present invention can be up to thousands or even millions. The number of nodes.

The way to establish the connection rules is as follows. First, a total number of nodes N and a number of connected nodes K are input, wherein the total number of nodes N represents the number of nodes of the network topology system, and the number K of connected nodes indicates the number of other nodes that can be connected in parallel to each node. In the present embodiment, the total number of nodes N is 16, and the number K of connection nodes is 4.

Next, a recursive sequence in which the value is less than one of the total number of nodes N is listed, wherein the recursive sequence can use a well-known recursive sequence. List the prime numbers as a prime number, such as 2, 3, 5, 7, 11, 13, 17, 19, .... Calculate the difference between adjacent prime numbers in the prime number series, such as 3-2=1, 5-3=2, 7-5=2, 11-7=4, 13-11=2, 17-13=4, .. To A numerical difference series of values of 1, 2, 2, 4, 2, 4, ... is generated.

Calculate the sum of the value of the current position in the numerical difference series and the value of all previous positions, that is, the value of the first position is 1, the value of the second position is 1 + 2 = 3, and the value of the third position is 1+2+2=5, the value of the 4th position is 1+2+2+4=9, the value of the 5th position, and the value of 1+2+2+4+2=11, the 6th position and Is 1+2+2+4+2+4=15,..., calculated by the above to produce values of 1(1), 3(2), 5(3), 9(4), 11(5) , 15(6), ... A communication strategy numerical sequence, where the number in parentheses indicates the index of the position of the value in the number sequence of the communication strategy.

The value of the third to K+2 (K is 4) in the recursive sequence is taken as an index sequence. In the present embodiment, the value of the index sequence is 1, 2, 3, and 5. The K values in the number sequence of the communication strategy are retrieved to generate a connection strategy number sequence, wherein the values in the K number index series correspond to the values of the sequence positions of the communication strategy numerical sequence. In this embodiment, the connection strategy value The values of the series are 1 (1), 3 (2), 5 (3), and 11 (5).

Calculating the sum of the values in each of the odd number and the connection strategy value series to generate a plurality of connection node number sequence columns to establish a node for each odd numbered node to link the corresponding numerical number in the connection node number sequence The connection rule, in this embodiment, the node with the odd number of 1 is a node with a parallel connection number of 1+1=2, 1+3=4, 1+5=6, 1+11=12, and an odd number of 3 nodes. The parallel link numbers are 3+1=4, 3+3=6, 3+5=8, 3+11=14, etc., as shown in Fig. 1.

In a network topology system with a total number of nodes N, find that the number of connections of each node is close to a specific value, that is, K _i → K, i =1 , 2 , ..... , N, where K = log ₂ N, and with the shortest average distance, known topology optimization (topology optimization).

In a network topology with a total number of nodes of N, the longest distance between all nodes can be expressed as the following distance matrix (Distance Matrix): Where d _ij is the longest distance between nodes i and j, and d _ii =0, that is, the diagonal elements are all 0.

The definition of the average distance A of a topology is as follows: , i, j =1 , 2 , .... , N where d _ij is the longest distance between any two nodes i and j. For example, the total number of nodes N is 4, the number of connected nodes K is 2, and the distance matrix is expressed as Then A=(1+2+1+...+2+1)/(4×3)=1.33

Let each node pass the same form of communication freedom (using the same set of node connection rules) and make the number of connections of all nodes very close, ie K _i → K, i =1 , 2 , ..... , N It is called the democratization dimension environment.

2 is a flow chart of a method for network topology of the present invention. Reference is made to the node of Figure 1 in illustrating the flow steps of Figure 2.

In FIG. 2, the established connection rules are first used to connect to the respective nodes of FIG. 1 (step S20).

3 is a flow chart of a method for establishing a connection rule according to the present invention. The steps of establishing the data of the connection rule are as shown in the flow chart of FIG. 3. In FIG. 3, a total number of nodes N and a number K of connection nodes are input. In this implementation, the total number of nodes N of the network topology system is 16, and the number K of connection nodes of each node that can be connected in parallel to other nodes is 4 (step Step S30).

The recursive sequence is set to 0, 1, 1, 2, 3, 5, 8, and 13 (step S32), wherein the value is less than one of the total number of nodes N. In this embodiment, the value is 0, 1, 1, 2, 3, 5, 8, and 13 (step S32). A well-known recursive sequence can be used.

The numerical value is listed as a prime number of prime numbers, and the values are 2, 3, 5, 7, 11, 13, 17, 19, ... (step S34). Calculate the difference between adjacent prime numbers in the prime number series, such as 3-2=1, 5-3=2, 7-5=2, 11-7=4, 13-11=2, 17-13=4, .. A numerical difference series of values of 1, 2, 2, 4, 2, 4, ... is generated (step S36).

Calculating the sum of the value of the current position in the prime value difference series and the value of all previous positions to generate a communication strategy value sequence. As in this embodiment, the value of the first position is the sum of the values of the first and second positions. 1+2=3, the value of the third position is 1+2+2=5, the value of the 4th position is 1+2+2+4=9, the value of the 5th position is 1+2+2 +4+2=11, the value of the sixth position is 1+2+2+4+2+4=15,..., and the above calculation is performed to generate values of 1(1), 3(2), 5 (3), 9(4), 11(5), 15(6), ..., a communication strategy numerical sequence, wherein the number in parentheses indicates an index of the position of the value in the communication strategy numerical sequence (step S38) .

The value of the third to K+2 (the K of the embodiment is 4) in the recursive sequence (0, 1, 1, 2, 3, 5, 8, 13) is taken as an index sequence. In this embodiment, the values of the index number column positions from the third to the sixth are 1, 2, 3, and 5. Then, the K values in the communication strategy numerical sequence are extracted to generate a connection strategy numerical sequence, wherein the values in the K numerical index series correspond to the values of the serial positions of the communication strategy numerical sequence. In this embodiment, the connection is performed. The values of the policy numerical sequence are 1 (1), 3 (2), 5 (3), and 11 (5) (step S40).

Calculate the sum of the values in each of the odd and connection strategy numeric columns to Generating a plurality of connection node number sequence columns to establish a connection rule for a node of each odd numbered node to link the numerical number in the corresponding connection node number sequence (step S42), as in the embodiment, the odd number is The node parallel connection number of 1 is 1+1=2, 1+3=4, 1+5=6, 1+11=12, etc., and the node with odd number is 3, the parallel connection number is 3+1=4, 3+ 3=6, 3+5=8, 3+11=14 nodes, etc. (as shown in Figure 1), and the established connection rules are used to connect the network nodes of Figure 1.

Referring again to FIG. 2, the network topology system performs communication transmission between any of the nodes and any of the destination nodes of FIG. 1 (step S22).

A comparison of the above network topology system with a known network topology system is described below. In FIG. 4A, the network topology system of the present invention having a total node number N of 324 and a connection node number K of 8 is compared with the network topology system of Fijitsu's TOFU-3x3x3 N324K7-10, and the network of the present invention is found. The average distance of the topology system is A= 3.41, and the longest distance is D=5, while the average distance of Fijitsu's network topology system is A=4.35 and the longest distance D=9, due to the average distance A of the network topology system of the present invention. The value of the longest distance D is smaller than the average distance A and the longest distance D of the network topology system of Fijitsu, so the communication transmission performance of the network topology system of the present invention is superior to that of the network topology system of Fijitsu. Transmission efficiency.

Similarly, in FIG. 4B, the total node number N of the present invention is 1500 and the average distance of the network topology system with the number of connected nodes K is 9 is A=4.23, the longest distance D=6, and the TOFU-5x5x5 N1500K7 of Fijitsu- The average distance of the network topology system of 10 is A=6.47, and the longest distance D=15i. In FIG. 4C, the total number of nodes N of the present invention is 1024 and the average distance A of the network topology system with the number of connected nodes K is 10. =3.63, the longest distance D=5, the average distance of the network topology system of IBM's BlueGene/Q N1024K10 is A=5.00, the longest distance D=10; in Fig. 4D, the total number of nodes of the invention N The average distance of the network topology system with 80 and the number of nodes K is 4 is A=3.59, and the longest distance is D=6. The average distance of the network topology system of Motorola's MC68xxx processor N80K2-4 is A=4.73, the longest distance. D=8.

It is found from FIGS. 4B to 4D that the communication transmission performance of the network topology system of the present invention is superior to that of Fijitsu's TOFU-5x5x5 N1500K7-10 network topology system, IBM's BlueGene/Q N1024K10 network topology system and Motorola's MC68xxx processor N80K2-4 network topology system and other communication transmission performance.

The present invention provides a network topology system and method, which has the advantage that the topology mathematical calculation method is to find a set of node connection rules for each node in a system with multiple nodes and the number of connections between each node and other nodes. It makes it possible to construct a network topology that allows all nodes to be based on their connection rules and their connections without using a switch, making the structure of the entire network system simple and without the power consumption of the switch. Therefore, the cost of the network system will not increase, and each node will pass the same form of communication freedom (using the same set of connection rules), and the connection number of all nodes is very close to the so-called democratization dimension.

The present invention has been described above with reference to the preferred embodiments and the accompanying drawings, and should not be considered as limiting. Various modifications, omissions and changes may be made without departing from the scope of the invention.

Claims (6)

A network topology system comprising: a plurality of nodes, each node being a single core chip, a processor, a computer, an internal optimization group of a set of computers, and a computer center, according to one The connection rule is connected between any one of the starting nodes and any one of the destination nodes; wherein the establishing of the connection rule comprises the following steps: calculating a difference between adjacent prime numbers in a prime number column to generate a prime number a numerical difference series; calculating a sum of a value of a current position in the numerical difference series and a value of all previous positions to generate a communication strategy numerical sequence; taking a number in a recursive sequence as a number of connected nodes as an index a number column, the number of the number of the communication strategy is taken as the number of the number of connected nodes, to generate a connection strategy number sequence, wherein the value in the index sequence is the sequence position of the number sequence of the communication strategy, and the sequence position thereof The value is the value of the number of values in the connection strategy; and the sum of each odd number and the value in the number sequence of the connection strategy is calculated to generate a complex number Connection node ID number of columns, the connection rule to link the corresponding value of the connection node of the node number of the column number of the node number of each odd-numbered. The network topology system of claim 1, wherein the establishing step of the connection rule further comprises: inputting a total number of nodes and the number of the connected nodes; and listing the recursive sequence whose value is less than the total number of nodes ; and list the prime number of the number as a prime number. For example, the network topology system of claim 1 or 2, wherein the recursive The third position in the sequence lists the number of the number of connected nodes as the index sequence. A network topology method is applied to a network topology system. The network topology system includes a plurality of nodes, each node being a single core chip, a processor, a computer, and a group of computers. In one of the Jiahua group and a computer center, the method includes the following steps: connecting, by the network topology system, any one of the starting nodes and any one of the destination nodes according to a connection rule; The establishing the connection rule comprises the steps of: calculating a difference between adjacent prime numbers in a prime number series to generate a prime numerical difference series; calculating a sum of a value of a current position in the numerical difference series and a value of all previous positions, To generate a communication strategy numerical sequence; take the number of the number of connected nodes in a recursive sequence as an index sequence, and take out the number in the numerical sequence of the communication strategy as the number of the connected nodes to generate a connection. The value sequence of the strategy, wherein the value in the index sequence is the position of the number column of the communication strategy, and the value of the sequence position is the numerical sequence of the connection strategy a value; and calculating a sum of each odd number and a value in the number of values of the connection strategy to generate a plurality of connection node number series, establishing a numerical number in the number of connected node number numbers for each odd numbered node The connection rule of the node. The network topology method of claim 4, wherein the step of establishing the connection rule further comprises: inputting a total number of nodes and the number of the connection nodes; and listing the recursive sequence whose value is less than the total number of nodes ;as well as List the prime numbers whose values are prime. The network topology method of claim 4, wherein the number of the number of connected nodes is taken as the index sequence from the third position in the recursive sequence.