CN107040394B - Network topological system and method - Google Patents
Network topological system and method Download PDFInfo
- Publication number
- CN107040394B CN107040394B CN201610075207.4A CN201610075207A CN107040394B CN 107040394 B CN107040394 B CN 107040394B CN 201610075207 A CN201610075207 A CN 201610075207A CN 107040394 B CN107040394 B CN 107040394B
- Authority
- CN
- China
- Prior art keywords
- sequence
- numerical value
- node
- values
- line
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of network topological system comprising: multiple nodes, the foundation of line rule include the following steps: the difference for calculating adjacent prime number to generate a prime number numerical value difference sequence；Current position and all the sum of numerical value of front position in prime number numerical value difference sequence are calculated, to generate a communication strategy sequence of values；Taking out number in a recursive sequence is the numerical value of a connecting node number as an index sequence, take out the numerical value that number in communication strategy sequence of values is connecting node number, to generate a line strategy sequence of values, wherein the numerical value in index sequence is the sequence location of communication strategy sequence of values, and the numerical value of sequence location is the numerical value of line strategy sequence of values；And the sum of numerical value in each odd number and the line strategy sequence of values is calculated, to generate both gut-nodes numbered sequence, to be established as the line rule that the node of each odd-numbered links the node of value number in corresponding both gut-nodes numbered sequence.
Description
Technical field
The present invention relates to a kind of technical field of computer network, in particular to a kind of network topological system and method.
Background technique
The optimization that high-performance computer or computer system can provide hardware and software uses, and using comprising one or
The processing node of multi-microprocessor and memory is realized.The sometimes referred to as shared multiprocessor system of these computer systems
System, in a shared multiprocessor computer system, regarding processor is network node to be connected with each other, and makes them can be with that
This is communicated, with sharing operation system, resource, data, memory etc..
In parallel calculation computer system, as computer node number increases, network communication can significantly increase between node
Add, in order to speed the communication speed between node two-by-two, will use exchanger and be used as each inter-node communication.However,
The quantity of node is bigger, and the quantity of used exchanger just the more, and uses the exchange of for example fat tree (Fat Tree) structure
The number of plies of device also will increase, thus cause the structure of whole network system considerably complicated and power consumption, and the cost of network system is also
It will increase.
Summary of the invention
In view of the above problem, the object of the present invention is to provide a kind of network topological system and method, topology meters
It is that each node finds a group node line rule (connection rules) that calculation mode, which is in the system with multiple nodes,
And the number that each node is connect with other nodes, make it that can build up one and allows all nodes according to its line rule and its company
Several constituted network topologies are connect, without using exchanger, makes whole network system the structure can be simplified and without exchanger
Power consumption, so the cost of network system not will increase, furthermore each node by the freedom of correspondence of same form (using same
Group line rule), and make the connection number of all nodes very close to person, and reach so-called democratization dimension
(Democratized Dimension)。
First aspect of the invention provides a kind of network topological system comprising:
Multiple nodes, each node be a monokaryon chip centroid, a processor, a computer, one group of computer inside most
One of them of goodization group and a computer center, each node is according to multiple destination nodes in line rule and these nodes
It is attached；
Wherein, the foundation of line rule includes the following steps:
The difference of adjacent prime number in a prime number sequence is calculated, to generate a prime number numerical value difference sequence；
The numerical value of current position and all the sum of numerical value of front position in the prime number numerical value difference sequence are calculated, to generate one
Communication strategy sequence of values；
Numerical value that number in a recursive sequence is a connecting node number is taken out as an index sequence, takes out the communication strategy
Number is the numerical value of the connecting node number in sequence of values, to generate a line strategy sequence of values, wherein in the index sequence
Numerical value be the communication strategy sequence of values sequence location, the numerical value of sequence location is the number of the line strategy sequence of values
Value；And
The sum of the numerical value in each odd number and the line strategy sequence of values is calculated, to generate multiple both gut-nodes number sequences
Column, be established as the node of each odd-numbered link value number in corresponding both gut-nodes numbered sequence node should
Line rule.
Second aspect of the invention provides a kind of network topological method, is applied to a network topological system, which opens up
The system of flutterring includes multiple nodes, and each node is the inside of a monokaryon chip centroid, a processor, a computer, one group of computer
One of them of optimization group and a computer center, this method includes the following steps:
By the network topological system according to one group of line rule by these nodes any start node and multiple nodes
It is attached；
Wherein, the line rule is established to include the following steps:
The difference of adjacent prime number in a prime number sequence is calculated, to generate a prime number numerical value difference sequence；
The numerical value of current position and all the sum of numerical value of front position in the prime number numerical value difference sequence are calculated, to generate one
Communication strategy sequence of values；
Numerical value that number in a recursive sequence is a connecting node number is taken out as an index sequence, takes out the communication strategy
Number is the numerical value of the connecting node number in sequence of values, to generate a line strategy sequence of values, wherein in the index sequence
Numerical value be the communication strategy sequence of values sequence location, the numerical value of sequence location is the number of the line strategy sequence of values
Value；And
The sum of the numerical value in each odd number and the line strategy sequence of values is calculated, to generate multiple both gut-nodes number sequences
Column, be established as the node of each odd-numbered link value number in corresponding both gut-nodes numbered sequence node should
Line rule.
Detailed description of the invention
Fig. 1 is the node architecture schematic diagram of network topological system of the invention；
Fig. 2 is the flow chart of network topological method of the invention；
Fig. 3 is the flow chart of the method for establishing line rule of the invention；And
Fig. 4 A to Fig. 4 D is the schematic diagram of network topological system of the invention compared with the efficiency of various network topological systems.
Specific embodiment
To enable those skilled in the art to be further understood that the present invention, hereafter spy enumerates presently preferred embodiments of the present invention,
And cooperate attached drawing, the constitution content that the present invention will be described in detail and it is to be reached the effect of.
Fig. 1 is the node architecture schematic diagram of network topological system of the invention.In Fig. 1, network topological system includes more
A node (node serial number 1,2 ..., 16), each node is a monokaryon chip centroid (single core on chip), a processing
Device, a computer, one group of computer inside optimization group (a group of internally optimized group of
Computers) or a computer center (a computational center), each node foundation in network topological system
Any start node of one group of line regular (connection rule) in these nodes is attached with multiple nodes.
The embodiment of the present invention illustrates the traffic operation of network topological system by taking 16 nodes as an example, but the number of nodes is simultaneously
The non-limitation present invention, the number of nodes of network topological system of the invention may be up to thousands of or even million number of nodes.
The mode of establishing of line rule is described as follows.An a total node number N and connecting node number K is inputted first, wherein always
Number of nodes N indicates that the number of nodes of network topological system, connecting node number K indicate that each node can connect other nodes in parallel
Quantity.In this embodiment, total node number N is 16, and connecting node number K is 4.
Then, the recursive sequence that numerical value is less than total node number N is listed, wherein known recurrence sequence can be used in recursive sequence
Column.List numerical value be prime number a prime number sequence, such as 2,3,5,7,11,13,17,19 ....Calculate adjacent matter in prime number sequence
Several differences, as 3-2=1,5-3=2,7-5=2,11-7=4,13-11=2,17-13=4 ... with generate numerical value be 1,2,
2, a prime number numerical value difference sequence 4,2,4 ....
Calculate the numerical value of current position and all the sum of numerical value of front position in prime number numerical value difference sequence, that is, the 1st
The numerical value set and for the 1, the 2nd position numerical value and be 1+2=3, the numerical value of the 3rd position and be 1+2+2=5, the 4th position numerical value
With the numerical value for 1+2+2+4=9, the 5th position and be 1+2+2+4+2=11, the numerical value of the 6th position and be 1+2+2+4+2+4=
15 ..., through above-mentioned calculating with generate numerical value be 1 (1), 3 (2), 5 (3), 9 (4), 11 (5), 15 (6) ... a communication strategy number
Value sequence, the index of the position of the digital representation numerical value in communication strategy sequence of values in bracket.
Taking out position in recursive sequence is the 3rd numerical value to K+2 a (K 4) as an index sequence, in this implementation
In example, the numerical value of index sequence is 1,2,3,5.K numerical value in communication strategy sequence of values is taken out, to generate a line strategy number
Value sequence, wherein K numerical value is the numerical value for the sequence location that numerical value in index sequence corresponds to communication strategy sequence of values, at this
In embodiment, the numerical value of line strategy sequence of values is 1 (1), 3 (2), 5 (3), 11 (5).
The sum of the numerical value in each odd number and line strategy sequence of values is calculated, to generate multiple both gut-nodes number sequences
Column, to be established as the company that the node of each odd-numbered links the node of value number in corresponding both gut-nodes numbered sequence
Line rule, in the present embodiment, it is 1+1=2,1+3=4,1+5=6,1+11=12 that the node that odd number is 1 links number in parallel
The node that equal nodes, odd number are 3 link in parallel number be the nodes such as 3+1=4,3+3=6,3+5=8,3+11=14 ... (such as figure
Shown in 1).
The connection number of each node is found out in the network topological system that a total node number is N close to a particular value, i.e.,
Kt→ K, i=1,2 ... .., N, wherein K=log2N, and there is shortest average distance person, referred to as topological optimization (topology
optimization)。
A total node number be N network topology in, the longest distance between all nodes can be expressed as with
Under distance matrix (Distance Matrix):
Wherein dijLongest distance between node i and j, and dii=0, i.e. diagonal entry is all 0.
One topological average distance A is defined as follows:
Wherein dtjRefer to the longest distance between any two node i and j.Such as total node number N is 4, connecting node number K is
2, distance matrix is expressed as
Then A=(1+2+1+ ...+2+1)/(4 × 3)=1.33
It allows each node by the freedom of correspondence of same form (using same group node line rule), and makes all sections
The connection number of point is very close to person, i.e. Kt→ K, i=1,2 ... .., N are just known as democratization dimension environment.
Fig. 2 is the flow chart of network topological method of the invention.In the process step of explanatory diagram 2 with reference to the node of Fig. 1.
In Fig. 2, each node (step S20) of the established line rule first to be connected to Fig. 1.
The step of Fig. 3 is the flow chart of the method for establishing line rule of the invention, establishes the data of line rule such as Fig. 3
Flow chart shown in.In Fig. 3, an a total node number N and connecting node number K, in this embodiment, network topological system are inputted
Total node number N is 16, and the connecting node number K that each node can connect other nodes in parallel is 4 (step S30).
List the recursive sequence that numerical value is less than total node number N, in the present embodiment, the numerical value of recursive sequence is 0,1,1,
2,3,5,8,13 (step S32), wherein known recursive sequence can be used in recursive sequence.
List the prime number sequence that numerical value is prime number, numerical value 2,3,5,7,11,13,17,19 ... (step S34).
The difference for calculating adjacent prime number in prime number sequence, such as 3-2=1,5-3=2,7-5=2,11-7=4,13-11=2,17-13=
4 ... with generate numerical value be 1,2,2,4,2,4 ... a prime number numerical value difference sequence (step S36).
The numerical value of current position and all the sum of numerical value of front position in prime number numerical value difference sequence are calculated, it is logical to generate one
Believe tactful sequence of values, such as in the present embodiment, the numerical value of the 1st position and for the 1, the 2nd position numerical value and be 1+2=3, the 3rd
The numerical value of position and for 1+2+2=5, the 4th position numerical value and be 1+2+2+4=9, the numerical value of the 5th position and be 1+2+2+4+2
The numerical value of=11, the 6th position and for 1+2+2+4+2+4=15 ..., through above-mentioned calculating with generate numerical value be 1 (1), 3 (2), 5
(3), 9 (4), 11 (5), 15 (6) ... communication strategy sequence of values, digital representation numerical value in bracket is in communication plan
The index (step S38) of position slightly in sequence of values.
Taking out position in recursive sequence (0,1,1,2,3,5,8,13) is the 3rd to K+2 (K of the present embodiment is 4)
Numerical value as an index sequence, in the present embodiment, index sequence position is that the 3rd to the 6th numerical value is 1,2,3,5.
Then, K numerical value in communication strategy sequence of values is taken out, to generate a line strategy sequence of values, wherein K numerical value is rope
Draw the numerical value that the numerical value in sequence corresponds to the sequence location of communication strategy sequence of values, in the present embodiment, line strategy numerical value
The numerical value of sequence is 1 (1), 3 (2), 5 (3), 11 (5) (step S40).
The sum of the numerical value in each odd number and line strategy sequence of values is calculated, to generate multiple both gut-nodes number sequences
Column, to be established as the company that the node of each odd-numbered links the node of value number in corresponding both gut-nodes numbered sequence
Line rule (step S42), such as in the present embodiment, it is 1+1=2,1+3=4,1+5=that the node that odd number is 1 links number in parallel
6, it is 3+1=4,3+3=6,3+5=8,3+11=14 constant pitch that the node that the nodes such as 1+11=12, odd number are 3 links number in parallel
Point ... (as shown in Figure 1), and the network node by the line rule established to connection figure 1.
Referring again to FIGS. 2, any start node and any purpose section by network topological system in these nodes of Fig. 1
Communications (step S22) is carried out between point.
The comparative descriptions of above-mentioned network topological system and known network topological system are as follows.In Fig. 4 A, the present invention
Total node number N be 324 and the TOFU-3x3x3N324K7-10 of network topological system and Fijitsu that connecting node number K is 8
Network topological system it was found that, average distance A=3.41, the longest distance D=5 of network topological system of the invention, and
Average distance A=4.35, the longest distance D=9 of the network topological system of Fijitsu, due to network topological system of the invention
Average distance A and longest distance D numerical value be smaller than Fijitsu network topological system average distance A and longest distance D
Numerical value, so the communications efficiency of network topological system of the invention better than Fijitsu network topological system communication
Transmission efficiency.
Similarly, in figure 4b, the network topology system that total node number N of the invention is 1500 and connecting node number K is 9
The network topological system of the average distance A=4.23 of system, the TOFU-5x5x5 N1500K7-10 of longest distance D=6, Fijitsu
Average distance A=6.47, longest distance D=15；In Fig. 4 C, total node number N of the invention is 1024 and connecting node number
The BlueGene/Q N1024K10's of the average distance A=3.63 of network topological system, longest distance D=5, IBM that K is 10
Average distance A=5.00, the longest distance D=10 of network topological system；In fig. 4d, total node number N of the invention be 80 and
Average distance A=3.59, the longest distance D=6 for the network topological system that connecting node number K is 4, Motorola's's
Average distance A=4.73, the longest distance D=8 of the network topological system of MC68xxx processor N80K2-4.
By finding the communications efficiency of network topological system of the invention better than Fijitsu's in Fig. 4 B to Fig. 4 D
The network topological system of TOFU-5x5x5N1500K7-10, the network topological system of the BlueGene/Q N1024K10 of IBM and
The communications efficiency of the network topological system of MC68xxx processor N80K2-4 of Motorola's etc..
The present invention provides a kind of network topological system and method, the advantage is that topology calculation be have it is more
It is the number that each node finds a group node line rule and each node is connect with other nodes in the system of a node, makes it
The network topology for allowing all nodes to be constituted according to its line rule and its connection number can be built up, without using exchange
Device, simple and without exchanger the power consumption for becoming the structure of whole network system, so the cost of network system not will increase, then
The each node of person makes the connection number of all nodes non-by the freedom of correspondence of same form (using same group of line rule)
Very close to person, and reach so-called democratization dimension.
Although the present invention describes as above with reference to preferred embodiment and illustrative attached drawing, it is not construed as to the present invention
Limitation.Various modifications, omission and the variation that those skilled in the art do the content of its form and concrete example, without departing from
The advocated range of claims of the present invention.
Claims (6)
1. a kind of network topological system comprising:
Multiple nodes, each node be a monokaryon chip centroid, a processor, a computer, one group of computer inside optimize
One of them of group and a computer center, according to any start node of the line rule in these nodes and any purpose
It is attached between node；
Wherein, the foundation of line rule includes the following steps:
The difference of adjacent prime number in a prime number sequence is calculated, to generate a prime number numerical value difference sequence；
The numerical value of current position and all the sum of numerical value of front position in the prime number numerical value difference sequence are calculated, to generate a communication
Tactful sequence of values；
Numerical value that number in a recursive sequence is a connecting node number is taken out as an index sequence, takes out the communication strategy numerical value
Number is the numerical value of the connecting node number in sequence, to generate a line strategy sequence of values, the wherein number in the index sequence
Value is the sequence location of the communication strategy sequence of values, and the numerical value of sequence location is the numerical value of the line strategy sequence of values；
And
The sum of the numerical value in each odd number and the line strategy sequence of values is calculated, to generate multiple both gut-nodes numbered sequences,
Be established as each odd-numbered node link value number in corresponding both gut-nodes numbered sequence node the line
Rule.
2. network topological system according to claim 1, wherein the establishment step of line rule further comprises:
Input a total node number and the connecting node number；
List the recursive sequence that numerical value is less than the total node number；And
List the prime number sequence that numerical value is prime number.
3. network topological system according to claim 1 or 2, wherein the 3rd position taking-up number is from the recursive sequence
The numerical value of the connecting node number is as the index sequence.
4. a kind of network topological method is applied to a network topological system, which includes multiple nodes, each
Node is a monokaryon chip centroid, a processor, a computer, the inside optimization group of one group of computer and a computer center
One of them, this method includes the following steps:
By the network topological system according between any start node of the line rule in these nodes and any destination node
It is attached；
Wherein, the line rule is established to include the following steps:
The difference of adjacent prime number in a prime number sequence is calculated, to generate a prime number numerical value difference sequence；
The numerical value of current position and all the sum of numerical value of front position in the prime number numerical value difference sequence are calculated, to generate a communication
Tactful sequence of values；
Numerical value that number in a recursive sequence is a connecting node number is taken out as an index sequence, takes out the communication strategy numerical value
Number is the numerical value of the connecting node number in sequence, to generate a line strategy sequence of values, the wherein number in the index sequence
Value is the sequence location of the communication strategy sequence of values, and the numerical value of sequence location is the numerical value of the line strategy sequence of values；
And
The sum of the numerical value in each odd number and the line strategy sequence of values is calculated, to generate multiple both gut-nodes numbered sequences,
Be established as each odd-numbered node link value number in corresponding both gut-nodes numbered sequence node the line
Rule.
5. network topological method according to claim 4, wherein the step for establishing line rule further comprises:
Input a total node number and the connecting node number；
List the recursive sequence that numerical value is less than the total node number；And
List the prime number sequence that numerical value is prime number.
6. network topological method according to claim 4 or 5, wherein the 3rd position taking-up number is from the recursive sequence
The numerical value of the connecting node number is as the index sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610075207.4A CN107040394B (en) | 2016-02-03 | 2016-02-03 | Network topological system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610075207.4A CN107040394B (en) | 2016-02-03 | 2016-02-03 | Network topological system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107040394A CN107040394A (en) | 2017-08-11 |
| CN107040394B true CN107040394B (en) | 2019-07-05 |
Family
ID=59532423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610075207.4A Active CN107040394B (en) | 2016-02-03 | 2016-02-03 | Network topological system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107040394B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5343554A (en) * | 1988-05-20 | 1994-08-30 | John R. Koza | Non-linear genetic process for data encoding and for solving problems using automatically defined functions |
| CN101164289A (en) * | 2004-11-15 | 2008-04-16 | 哈里公司 | Predictive mobile ad hoc networking including associated systems and methods |
| CN105138493A (en) * | 2014-06-03 | 2015-12-09 | 黄吉川 | Non-exchanger network construction system and method suitable for parallel operation |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050063539A1 (en) * | 2003-09-18 | 2005-03-24 | Langin-Hooper Jerry Joe | Prime-number-based method and apparatus for generating random numbers |
| GB2527273B (en) * | 2014-04-11 | 2016-08-03 | Entuity Ltd | Executing a loop computer program to identify a path in a network |
| US9600440B2 (en) * | 2013-10-30 | 2017-03-21 | Futurewei Technologies, Inc. | Network topology of hierarchical ring with recursive shortcuts |
-
2016
- 2016-02-03 CN CN201610075207.4A patent/CN107040394B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5343554A (en) * | 1988-05-20 | 1994-08-30 | John R. Koza | Non-linear genetic process for data encoding and for solving problems using automatically defined functions |
| CN101164289A (en) * | 2004-11-15 | 2008-04-16 | 哈里公司 | Predictive mobile ad hoc networking including associated systems and methods |
| CN105138493A (en) * | 2014-06-03 | 2015-12-09 | 黄吉川 | Non-exchanger network construction system and method suitable for parallel operation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107040394A (en) | 2017-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR20220054396A (en) | Method and device of deep learning training task | |
| CN102141975B (en) | Computer system | |
| US10430375B2 (en) | Parallel computing system and communication control program | |
| CN102780628B (en) | On-chip interconnection network routing method oriented to multi-core microprocessor | |
| TW201547239A (en) | Switchless network topology system for parallel computation and method thereof | |
| US9904577B2 (en) | Hybrid heterogeneous host system, resource configuration method and task scheduling method | |
| Li et al. | Metacube—a versatile family of interconnection networks for extremely large-scale supercomputers | |
| CN111079078B (en) | Lower triangular equation parallel solving method for structural grid sparse matrix | |
| Ke et al. | Aggregation on the fly: Reducing traffic for big data in the cloud | |
| CN113204423B (en) | Method, system and readable medium for synchronizing computing task data | |
| CN111901257B (en) | Switch, message forwarding method and electronic equipment | |
| CN104954439B (en) | A kind of Cloud Server and its node interconnected method, cloud server system | |
| CN107040394B (en) | Network topological system and method | |
| CN106681795B (en) | Virtual network mapping method for node local topology and available resource capacity | |
| US10193757B2 (en) | Network topology system and method | |
| CN113204422B (en) | Efficient inter-chip interconnect topology for distributed parallel deep learning | |
| US11620502B2 (en) | Hyper-square implementation of tree AllReduce algorithm for distributed parallel deep learning | |
| CN104636311A (en) | Method for developing sizes of multiprocessor system-on-chip network interconnection arrays | |
| CN111262913B (en) | Data center network topology structure, determination method and system | |
| JP2003067354A (en) | Parallel computer system and interprocessor communication processing method | |
| CN1917464A (en) | Distribution type task assignment and computation method based on lower bound to be raised step by step | |
| CN108009099B (en) | Acceleration method and device applied to K-Mean clustering algorithm | |
| TWI544766B (en) | Network topology system and method | |
| US20170262316A1 (en) | Allocation of resources | |
| CN112579510A (en) | Chip cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |