CN104022928B - The topological construction method and system of a kind of high density server - Google Patents
The topological construction method and system of a kind of high density server Download PDFInfo
- Publication number
- CN104022928B CN104022928B CN201410215126.0A CN201410215126A CN104022928B CN 104022928 B CN104022928 B CN 104022928B CN 201410215126 A CN201410215126 A CN 201410215126A CN 104022928 B CN104022928 B CN 104022928B
- Authority
- CN
- China
- Prior art keywords
- kautz
- high density
- node
- child servers
- exchange chip
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of topological construction method and system of high density server.Methods described includes：Kautz digraphs for the topological structure of high density server are created according to the demand to network size, and the Kautz digraphs are divided into multiple isomorphism subgraphs；Exchange chip is arranged in child servers according to isomorphism subgraph, and multiple child servers are arranged in high density server according to Kautz digraphs so that the exchange chip in the plurality of child servers is consistent with the connected mode between the node one-to-one corresponding in the Kautz digraphs and the corresponding node in the connected mode and the Kautz digraphs between exchange chip.The present invention based on Kautz digraphs, use topological structure identical child servers form high density server so that the high density server have efficiently, zmodem and it is expansible the characteristics of；Furthermore, it is possible to child servers are produced in batches, so as to save manufacturing cost and time cost.
Description
Technical field
The present invention relates to the Topology Structure Design field of data center network, and in particular to a kind of high density server is opened up
Flutter construction method and system.
Background technology
With becoming increasingly popular for cloud computing, how to build the data center network that fault-tolerance is preferable and efficiency is higher has turned into
Current study hotspot.Due to good nature of the Kautz networks in node scale, path length and fault-tolerance, its by
It is widely used as the topological structure of data center network.By taking SiCortex SC5832 systems as an example, the system is by 6 processor cores
Piece forms one a little bigger (i.e. a server), and will be linked to be a diameter of 6 as 972 a little louder and spend the kautz nets for 3
Network (or Kautz digraphs).
As a rule, Kautz digraphs can be denoted as K (d, n), and it represents the out-degree of node and in-degree all for d (d >=2) simultaneously
And network diameter is n (n >=1).In K (d, n), u is identified as each1u2…ukNode U (be denoted as U=u1u2…uk), U
There are d bars to go out side.That is, for any α ∈ 0,1,2 ..., d and α ≠ uk, node U=u1u2…ukThere is one to section
Point V=u2u3…ukα's goes out side.Kautz digraphs have following property：
1st, node scale：K (d, n) number of nodes N is dn-1+dn。
2nd, network diameter：Arbitrary Kautz for giving node number of degrees d and node total number N, its network diameter n can reach
To minimum value, therefore Kautz has optimal network diameter.
3rd, fault-tolerance：K (d, n) has Connected degree d, i.e., between any two node of Kautz figures, d bars be present mutually not
Intersecting path.
However, for SiCortex SC5832 etc. existing system, the clothes that are made up of 6 processor chips
Business device can not meet the needs of data-center applications are to high-throughput.To solve this problem, current way is to use
High density server provides required high-throughput.Wherein, high density server can be by more blade servers (or
Backboard) server that forms, every server includes multiple exchange chips.Every high density server can include hundreds and thousands of
Exchange chip, for improving required high-throughput.
In high density server, the connected mode of hundreds and thousands of individual exchange chips influences whether the property of whole system
Energy.How to build efficiently, zmodem, expansible high density server, while save child servers therein (such as
Blade server) production cost be current urgent problem to be solved.
The content of the invention
To solve the above problems, according to one embodiment of present invention, there is provided a kind of topology constructing of high density server
Method, including：
It is step 1), oriented according to the Kautz for the demand of network size, creating the topological structure for high density server
Figure, and the Kautz digraphs are divided into multiple isomorphism subgraphs；
Step 2), exchange chip arranged in child servers according to isomorphism subgraph so that the exchange chip in child servers
Corresponded with the node in isomorphism subgraph and the corresponding node in connected mode and isomorphism subgraph between exchange chip it
Between connected mode it is consistent；And
Step 3), multiple child servers are arranged in high density server so that the exchange core in the plurality of child servers
Node in piece and the Kautz digraphs corresponds and the connected mode between exchange chip and the Kautz are oriented
The connected mode between corresponding node in figure is consistent.
In one embodiment, step 3) includes：According to the connected mode between the node in different isomorphism subgraphs,
Exchange chip corresponding to connection in different child servers.
In one embodiment, the direction of the line direction indicating data transmission between exchange chip.
In a further embodiment, the network diameter of the Kautz digraphs is 2.
In one embodiment, the Kautz digraphs are the out-degree of node and in-degree is 8 and network diameter is 2
Kautz digraphs.In another embodiment, the Kautz digraphs are the out-degree of node and in-degree is 3 and network diameter is
2 Kautz digraphs.
According to one embodiment of present invention, a kind of topology constructing system of high density server is also provided, including：
For creating the Kautz digraphs of the topological structure for high density server according to the demand to network size,
And the Kautz digraphs are divided into the equipment of multiple isomorphism subgraphs；
For arranging exchange chip in child servers according to isomorphism subgraph so that exchange chip in child servers with it is same
Node in structure subgraph corresponds and between the corresponding node in connected mode and isomorphism subgraph between exchange chip
The consistent equipment of connected mode；And
For arranging multiple child servers in high density server so that exchange chip in the plurality of child servers with
Node in the Kautz digraphs corresponds and in the connected mode between exchange chip and the Kautz digraph
Corresponding node between the consistent equipment of connected mode.
Following beneficial effect can be reached using the present invention：
And routing mechanism identical multiple child servers identical by topological structure form high density server, and high density
All exchange chips and its line of server form Kautz digraphs so that the high density server formed possess efficiently,
Zmodem and it is expansible the advantages of.Further, since child servers can be produced in batches, so as to save manufacturing cost and
Time cost.
Brief description of the drawings
Fig. 1 is the flow chart of the topological construction method of high density server according to an embodiment of the invention；
Fig. 2 a are Kautz digraphs K (3,2) schematic diagrames；
Fig. 2 b-2d respectively illustrate each isomorphism subgraph of the Kautz digraphs K (3,2) shown in Fig. 2 a；And
Fig. 3 a-3i respectively illustrate Kautz digraphs K (8,2) each isomorphism subgraph.
Embodiment
The present invention is illustrated with reference to the accompanying drawings and detailed description.It is it should be appreciated that described herein specific
Embodiment only to explain the present invention, is not intended to limit the present invention.
According to one embodiment of present invention, there is provided a kind of topological construction method of high density server.Wherein, the height
Density server is made up of multiple child servers (such as blade server), and multiple exchange chips are included in each child servers.Letter
For wanting, the topological construction method includes：Create Kautz digraphs and it is divided, obtain multiple isomorphism subgraphs；According to
Isomorphism subgraph arranges exchange chip in each child servers；And multiple such child servers are connected to form high density
Server, make the topological structure of the high density server consistent with the Kautz created figures.Referring now to Fig. 1, the detailed topological structure
Each step of construction method：
The first step：Create Kautz digraphs
As described above, because Kautz digraphs are applied to structure zmodem, efficient and expansible network, therefore,
It is expected that the line between all exchange chips and exchange chip in high density server can form a Kautz digraph
(wherein, the exchange chip in high density server corresponds with the node in Kautz digraphs).Because exchange chip is located at
In different child servers in high density server, it is therefore desirable to build the topological structure of each child servers and determine son
Connected mode (will below the step of described in) between server so that in the high density server, different sub-services
All exchange chips and its line on device can form a Kautz digraph.
It is possible, firstly, to according to the demand to network size, Kautz of the design suitable for the topological structure of high density server
Digraph K (d, n).Wherein, the out-degree of node and in-degree be d, network diameter n, interstitial content N=dn-1+dn, the node
Number is identical with the exchange chip number in high density server.For example, can according to exchange chip sum demand or
One Kautz digraph is designed to the demand of the network diameter in high density server.
In a preferred embodiment, the reason for creating the Kautz digraphs that network diameter n is 2, selecting 2 is：Net
Network diameter is shorter, and network delay can be smaller.
Second step：Divide isomorphism subgraph
In this step, it can use that well known to a person skilled in the art any dividing mode by Kautz digraphs K
(d, n) is divided into multiple identical isomorphism subgraphs, wherein the topological structure of each isomorphism subgraph is identical.For example, first by node
Total N carries out decile (such as k deciles), then the Kautz digraphs are divided into k isomorphism subgraph., can according to the result of division
To obtain the number of nodes m in each isomorphism subgraph, wherein N=k*m.
3rd step：The topological structure of child servers is set
In this step, m exchange chip (nodes in i.e. each isomorphism subgraph) is arranged into a sub-services first
On device, the exchange chip corresponds with the node in isomorphism subgraph；Then, the line between the node in isomorphism subgraph
Mode, the exchange chip corresponding to connection in child servers.The interconnection instruction of two exchange chips can be in the two exchange cores
Direct transmission packet between piece, the direction of the direction indicating data transmission of line.If for example, in isomorphism subgraph, two save
The line direction put is to point to node B from node A, then corresponding node A exchange chip can directly transmit packet to correspondingly
Node B exchange chip, it is on the contrary then not all right.
4th step：High density server is formed by child servers
The total and second step for forming the child servers of high density server divides the total equal of obtained isomorphism subgraph,
Network topology structure in these child servers is identical and routing mechanism can also be identical.During production, by institute
Production is the child servers of same size (identical topological structure and routing mode), therefore can be processed in batches, so as to save
The cost of production.
When building high density server, according to the Kautz digraphs created and the isomorphism subgraph divided, by son
Server connects.I.e. according to the line between the different isomorphism subgraphs of Kautz digraphs, to connect in different child servers
Exchange chip so that all exchange chips and its line in high density server and the Kautz digraph structures created
Unanimously.
Hereafter respectively with K (3,2) and K (8,2) exemplified by, show after isomorphism subgraph is divided, opening up in each child servers
Flutter structure.
Fig. 2 a show Kautz digraphs K (3,2) schematic diagram, and Fig. 2 b-2d are that divided to obtain to it three are same
Structure subgraph.As shown in Fig. 2 b-2d, the K (3,2) is divided into 3 groups, every group of 4 nodes, and each group of node number phase
Deng and topological structure it is identical.In practice, sub-services can be built as the topological structure shown in any one in Fig. 2 b- Fig. 2 d
Device (3 child servers altogether, and have 4 exchange chips in each child servers), and child servers are being added into high density
During server, the topological structure according to Fig. 2 a connects each child servers so that is K (3,2) in high density server
Structure.
Fig. 3 a-3i respectively illustrate the result for carrying out isomorphism subgraph to Kautz digraphs K (8,2) and dividing to obtain, K (8,2)
9 groups are divided into, every group of 8 nodes.As shown in Fig. 3 a-3i, each group of node number is equal and topological structure is identical.In reality
In trampling, can according to shown in any one in Fig. 3 a-3i topological structure next life produce surviving of son server (9 child servers altogether, each
Have 8 exchange chips in child servers), and when child servers are added into high density server, according to the topology of K (8,2)
Structure connects each child servers so that is the structure of K (8,2) in high density server.
According to one embodiment of present invention, a kind of topology constructing system of high density server is also provided.
The system includes being used for creating the topological structure for high density server according to the demand to network size
Kautz digraphs, and the equipment that the Kautz digraphs are divided into multiple isomorphism subgraphs；For according to isomorphism subgraph in son
Exchange chip is arranged on server so that the exchange chip in child servers is corresponded and handed over the node in isomorphism subgraph
The consistent equipment of the connected mode changed between the connected mode between chip and the corresponding node in isomorphism subgraph；And for
The multiple child servers of arrangement in high density server so that in the exchange chip and Kautz digraphs in the plurality of child servers
Node correspond and exchange chip between connected mode and Kautz digraphs in corresponding node between connection side
The consistent equipment of formula.
It should be noted that and understand, the feelings of the spirit and scope of the present invention required by appended claims are not departed from
Under condition, various modifications and improvements can be made to the present invention of foregoing detailed description.It is therefore desirable to the model of the technical scheme of protection
Enclose and do not limited by given any specific exemplary teachings.
Claims (9)
1. a kind of topological construction method of high density server, including：
Step 1), basis create the Kautz digraphs of the topological structure for high density server to the demand of network size, and
And the Kautz digraphs are divided into multiple isomorphism subgraphs；
Step 2), exchange chip arranged in child servers according to isomorphism subgraph so that exchange chip in child servers with it is same
Node in structure subgraph corresponds and between the corresponding node in connected mode and isomorphism subgraph between exchange chip
Connected mode is consistent；And
Step 3), multiple child servers are arranged in high density server so that exchange chip in the plurality of child servers with
Node in the Kautz digraphs corresponds and in the connected mode between exchange chip and the Kautz digraph
Corresponding node between connected mode it is consistent.
2. according to the method for claim 1, wherein, step 3) includes：
According to the connected mode between the node in different isomorphism subgraphs, the exchange corresponding to connection in different child servers
Chip.
3. method according to claim 1 or 2, wherein, the side of the line direction indicating data transmission between exchange chip
To.
4. method according to claim 1 or 2, wherein, the network diameter of the Kautz digraphs is 2.
5. method according to claim 1 or 2, wherein, the Kautz digraphs be the out-degree of node and in-degree be 8 and
Network diameter is 2 Kautz digraphs.
6. method according to claim 1 or 2, wherein, the Kautz digraphs be the out-degree of node and in-degree be 3 and
Network diameter is 2 Kautz digraphs.
7. a kind of topology constructing system of high density server, including：
For creating the Kautz digraphs of the topological structure for high density server according to the demand to network size, and
The Kautz digraphs are divided into the equipment of multiple isomorphism subgraphs；
For arranging exchange chip in child servers according to isomorphism subgraph so that exchange chip and isomorphism in child servers
Node in figure corresponds and the connection between the corresponding node in connected mode and isomorphism subgraph between exchange chip
The consistent equipment of mode；And
For arranging multiple child servers in high density server so that exchange chip in the plurality of child servers with it is described
Node in Kautz digraphs corresponds and the connected mode between exchange chip and pair in the Kautz digraphs
Answer the consistent equipment of the connected mode between node.
8. system according to claim 7, wherein, the direction of the line direction indicating data transmission between exchange chip.
9. the system according to claim 7 or 8, wherein, the network diameter of the Kautz digraphs is 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410215126.0A CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410215126.0A CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104022928A CN104022928A (en) | 2014-09-03 |
| CN104022928B true CN104022928B (en) | 2018-01-09 |
Family
ID=51439508
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410215126.0A Active CN104022928B (en) | 2014-05-21 | 2014-05-21 | The topological construction method and system of a kind of high density server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104022928B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105739929B (en) * | 2016-01-29 | 2019-01-11 | 哈尔滨工业大学深圳研究生院 | The selection method of data center when big data is migrated to cloud |
| CN107181613A (en) * | 2017-05-10 | 2017-09-19 | 广东工业大学 | A kind of kautz tree topology control methods based on wireless sensor network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921437A (en) * | 2006-08-04 | 2007-02-28 | 上海红神信息技术有限公司 | Inside and outside connecting network topology framework and parallel computing system for self-consistent expanding the same |
| CN102510404A (en) * | 2011-11-21 | 2012-06-20 | 中国人民解放军国防科学技术大学 | Nondestructive continuous extensible interconnection structure for data center |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080107116A1 (en) * | 2006-11-08 | 2008-05-08 | Sicortex, Inc. | Large scale multi-processor system with a link-level interconnect providing in-order packet delivery |
-
2014
- 2014-05-21 CN CN201410215126.0A patent/CN104022928B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921437A (en) * | 2006-08-04 | 2007-02-28 | 上海红神信息技术有限公司 | Inside and outside connecting network topology framework and parallel computing system for self-consistent expanding the same |
| CN102510404A (en) * | 2011-11-21 | 2012-06-20 | 中国人民解放军国防科学技术大学 | Nondestructive continuous extensible interconnection structure for data center |
Non-Patent Citations (1)
| Title |
|---|
| High-Performance and Cost-Efficient Interconnection Network for High-Density Servers;Wen-Tao Bao等;《JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY》;20140331;第281-291页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104022928A (en) | 2014-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107888425B (en) | network slice deployment method and device for mobile communication system | |
| CN102804712B (en) | Method and apparatus for selecting between multiple equal cost paths | |
| Yang et al. | Scan-based movement-assisted sensor deployment methods in wireless sensor networks | |
| Trik et al. | Providing an Adaptive Routing along with a Hybrid Selection Strategy to Increase Efficiency in NoC‐Based Neuromorphic Systems | |
| Oda et al. | Evaluation of WMN-GA for different mutation operators | |
| Sharmin et al. | Minimizing the energy hole problem in wireless sensor networks: A wedge merging approach | |
| JP2020517141A5 (en) | ||
| Shi et al. | Searching for optimal network topology with best possible synchronizability | |
| CN107453928A (en) | A kind of power telecom network pitch point importance evaluation method and device | |
| CN112468401A (en) | Network-on-chip routing communication method for brain-like processor and network-on-chip | |
| Guan et al. | On-demand cooperation among multiple infrastructure networks for multi-tenant slicing: A complex network perspective | |
| CN104022928B (en) | The topological construction method and system of a kind of high density server | |
| WO2018166249A1 (en) | Network service transmission method and system | |
| Bao et al. | A high-performance and cost-efficient interconnection network for high-density servers | |
| CN104954439A (en) | Cloud server, node interconnection method thereof and cloud server system | |
| Zhou et al. | Approach for minimising network effect of VNF migration | |
| Al-Zoubi et al. | A grid-shaped cellular modeling approach for wireless sensor networks | |
| Xiao et al. | A class of data-center network models offering symmetry, scalability, and reliability | |
| Shabka et al. | Resource allocation in disaggregated data centre systems with reinforcement learning | |
| US20220394362A1 (en) | Methods, systems, and devices for bandwidth steering using photonic devices | |
| Chen et al. | Embedding meshes and tori on double-loop networks of the same size | |
| Ali et al. | The static performance effect of hybrid-hierarchical interconnection by shifted completely connected network | |
| CN107623586B (en) | Network link prediction method and device | |
| Bahrebar et al. | Adaptive multicast routing method for 3D mesh-based Networks-on-Chip | |
| Arabas et al. | Router activation heuristics for energy-saving ECMP and valiant routing in data center networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |