WO2014067268A1

WO2014067268A1 - Node partition dividing method, device and server

Info

Publication number: WO2014067268A1
Application number: PCT/CN2013/074395
Authority: WO
Inventors: 廖义祥; 吴登奔; 张羽
Original assignee: 华为技术有限公司
Priority date: 2012-10-29
Filing date: 2013-04-19
Publication date: 2014-05-08
Also published as: CN102932175B; CN102932175A

Abstract

Disclosed are a node partition dividing method, device and server, which relate to the technical field of electronic information, and can automatically analyse and obtain a partition scheme with a minimum hop count of the QPI according to a topological structure of a system, so that the influence of subjective factors during manual partition division is avoided, and a reduction in operating rate caused by improper partition is alleviated, thereby alleviating the reduction in system performance.The method of the present invention comprises: acquiring a topological structure of a system and the number of nodes participating in partition, the system comprising at least three nodes, and each node comprising at least two CPUs;determining connection information according to the topological structure of the system, the connection information comprising a connection relationship between each CPU and other CPUs in the system;and determining a partition scheme according to the number of nodes participating in partition and the connection information, wherein the number of nodes in the partition scheme is the number of nodes participating in partition.The present invention is applicable to server partition.

Description

划分节点分区的方法、装置及服务器 Method, device and server for dividing node partition

技术领域 Technical field

本发明涉及电子信息技术领域，尤其涉及一种划分节点分区的方法、装置及服务器。背景技术 The present invention relates to the field of electronic information technology, and in particular, to a method, an apparatus, and a server for dividing a node partition. Background technique

随着电子信息技术的发展，各类电子信息***中的数据量越来越大，例如：无线通讯***为了支持 3G 网络，必须承载更大的数据流量；互联网中的在线储存***为了能够支持更多的用户使用，需要扩大***的数据容量。使得各类电子信息***对数据承载量和容错性能要求越来越高。 With the development of electronic information technology, the amount of data in various electronic information systems is increasing. For example: In order to support 3G networks, wireless communication systems must carry more data traffic; online storage systems in the Internet can support For many users, it is necessary to expand the data capacity of the system. The requirements for data carrying capacity and fault tolerance performance of various electronic information systems are getting higher and higher.

由此，衍生出了服务器互联技术，即通过 QP I ( Qui ckPa th Int erconnec t ,快速互联通道）等技术手段将多个节点中的 CPU相互连接，使得多个原本独立工作的节点可以联合成一个整体（即组成一个分区），并将所联合成的整体作为一个执行主体来承担原来单个节点上的工作，从而提高服务器数据承载量和容错性。例如：在图 1 中，节点 0、节点 1、节点 2、节点 3 , 这 4个节点被划分进了同一个分区，其中的各个节点的 CPU之间通过 QPI相连，等于将这 4个节点中的总共 8个 CPU组成了一个新的服务器。 As a result, the server interconnection technology is derived, that is, the CPUs of the plurality of nodes are connected to each other through a technical means such as QP I (Quin-Calc Int erconnec t), so that a plurality of nodes that work independently can be combined. A whole (that is, a partition), and the combined entity as an executive body to undertake the work on the original single node, thereby improving the server data capacity and fault tolerance. For example: In Figure 1, node 0, node 1, node 2, node 3, these four nodes are divided into the same partition, and the CPUs of each node are connected by QPI, which is equal to the four nodes. A total of 8 CPUs make up a new server.

在现有技术中，由于服务器和 CPU的接口的数量是有限的，在实际应用中往往不能做到每个 CPU都与其他的 CPU两两相连，则需要借用其他 CPU 的 QPI相连，其中连接两个 CPU的一条 QPI称之为一跳，例如：在图 1中，节点 0中的 CPUO若要与节点 1中的 CPUO相连，则只需经过④这一跳 QPI; 但是，节点 0中的 CPU0若要与节点 2中的 CPU0相连，则需要经过①、 ②、 ③这三跳 QPI。但是，跳数越多，当前 CPU访问其他 CPU时，需要消耗的时间也就越多，例如：节点 0中的 CPUO访问节点 2中的 CPUO所需的时间，远远大于节点 0中的 CPUO访问节点 1中的 CPUO所需的时间。从而造成了 CPU的访问延时，使得 CPU在运算过程中需要消耗额外的时间等待相隔很多跳 QP I之外的其他 CPU所传输来的数据，从而降低了整个分区的运算速率。 In the prior art, since the number of interfaces of the server and the CPU is limited, in actual applications, it is often impossible to connect each CPU to other CPUs, and it is necessary to borrow QPIs of other CPUs, where two A QPI of a CPU is called a hop. For example: In Figure 1, if the CPU0 in node 0 is to be connected to the CPUO in node 1, then only 4 hops of QPI are passed; however, CPU0 in node 0 To connect to CPU0 in node 2, you need to go through the three-hop QPI of 1, 2, and 3. However, the more hops, the more time it takes for the current CPU to access other CPUs, for example: The time required for the CPUO in node 0 to access the CPUO in node 2 is much larger than the CPUO access in node 0. The time required for the CPUO in node 1. From The CPU access delay is caused, so that the CPU needs to spend extra time in the operation process to wait for data transmitted by other CPUs other than the QP I, thereby reducing the operation rate of the entire partition.

在现有技术中，导致上述问题的主要原因在于，在划分节点分区以及互联 CPU的过程是由技术人员手动操作完成的，并且为了保证分区能够有较高的运算速率，需要技术人员采集***的监控数据并根据自己的经验及知识分析出优选的分区方案，这必然增加了工作人员的工作量。对于一些运行情况不稳定的***，需要经常修改分区的，这就需要技术人员不间断地人工监控***的运行情况并随时手动修改分区，这需要占用技术人员大量的时间和工作量，增加了***的运行成本。发明内容 In the prior art, the main cause of the above problem is that the process of dividing the node partition and interconnecting the CPU is manually performed by a technician, and in order to ensure that the partition can have a higher operation rate, the technician needs to collect the system. Monitor the data and analyze the preferred partitioning scheme based on your own experience and knowledge, which inevitably increases the workload of the staff. For some systems with unstable operation, the partition needs to be modified frequently. This requires the technician to manually monitor the operation of the system and manually modify the partition at any time. This requires a large amount of time and workload for the technician, and increases the system. Operating costs. Summary of the invention

本发明的实施例提供一种划分节点分区的方法、装置及服务器，能够自动根据***的拓朴结构分析并得到分区方案，可以避免了技术人员手动划分分区，从而减轻了技术人员的时间消耗和工作量，从而降低了***的运行成本。 The embodiment of the invention provides a method, a device and a server for dividing a node partition, which can automatically analyze and obtain a partitioning scheme according to the topology structure of the system, which can avoid manual division of the partition by the technician, thereby reducing the time consumption of the technician and The workload, which reduces the operating costs of the system.

为达到上述目的，本发明的实施例采用如下技术方案： In order to achieve the above object, the embodiment of the present invention adopts the following technical solutions:

一方面，本发明的实施例提供一种划分节点分区的方法，包括：获取***的拓朴结构和参与分区的节点数量，所述***包括至少三个节点，每一个节点包括至少二个 CPU ; In one aspect, an embodiment of the present invention provides a method for partitioning a node partition, including: acquiring a topology of a system and a number of nodes participating in the partition, the system comprising at least three nodes, each node including at least two CPUs;

根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系； Determining connection information according to the topology structure of the system, where the connection information includes: a connection relationship between each CPU and other CPUs in the system;

根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 Determining a partitioning scheme according to the number of nodes participating in the partition and the connection information, wherein the number of nodes in the partitioning scheme is the number of nodes of the participating partitioning.

另一方面，本发明的实施例提供一种划分节点分区的装置，包括：拓朴提取模块，用于获取***的拓朴结构，所述***包括至少三个节点，每一个节点包括至少二个 CPU ; 数量确定模块，用于获取参与分区的节点数量； In another aspect, an embodiment of the present invention provides an apparatus for dividing a node partition, including: a topology extraction module, configured to acquire a topology structure of the system, where the system includes at least three nodes, each node includes at least two CPU ; a quantity determining module, configured to acquire the number of nodes participating in the partition;

拓朴分析模块，用于根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系；分析模块，用于根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 a topology analysis module, configured to determine connection information according to a topology structure of the system, where the connection information includes: a connection relationship between each CPU in the system and another CPU; an analysis module, configured to The number of nodes participating in the partition and the connection information determine a partitioning scheme, wherein the number of nodes in the partitioning scheme is the number of nodes of the participating partitions.

再一方面，本发明的实施例提供一种划分节点分区的服务器，包括了：处理器、存储器及输入设备，其中： In still another aspect, an embodiment of the present invention provides a server for partitioning a node partition, including: a processor, a memory, and an input device, where:

所述处理器从所述存储器和 /或所述输入设备，获取***的拓朴结构和参与分区的节点数量，所述***包括至少三个节点，每一个节点包括至少二个 CPU , 再根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系，最后根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 The processor acquires, from the memory and/or the input device, a topology of the system and a number of nodes participating in the partition, the system includes at least three nodes, each node includes at least two CPUs, and then Determining the connection structure of the system, the connection information includes: a connection relationship between each CPU in the system and other CPUs, and finally determining according to the number of nodes participating in the partition and the connection information a partitioning scheme, wherein the number of nodes in the partitioning scheme is the number of nodes of the participating partitioning.

本发明实施例提供的划分节点分区的方法、装置及服务器，能够自动根据***的拓朴结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。附图说明 The method, device and server for dividing a node partition provided by the embodiment of the invention can automatically analyze and obtain a partitioning scheme with the least number of interconnected channels according to the topology structure of the system, thereby reducing the workload of the technician and reducing the operation of the system. cost. DRAWINGS

为了更清楚地说明本发明实施例中的技术方案，下面将对实施例中所需要使用的附图作筒单地介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其它的附图。图 1为现有技术中的具体实例的结构示意图；图 2a为本发明实施例 1提供的划分节点分区的方法流程图；图 2b为本发明实施例提供的一个具体实例的结构示意图；图 2c为本发明实施例提供的另一个具体实例的结构示意图；图 2d为本发明实施例提供的再一个具体实例的结构示意图；图 3a为本发明实施例 2提供的一个划分节点分区的方法流程图；图 3b为本发明实施例 2提供的另一个划分节点分区的方法流程图；图 3c为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3cl为本发明实施例提供的一个具体实例的结构示意图；图 3c2为本发明实施例提供的另一个具体实例的结构示意图；图 3c 3为本发明实施例提供的再一个具体实例的结构示意图；图 3d为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3el为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3e2为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3f l为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3f 2为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3g为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3gl为本发明实施例 2提供的一个具体实例的结构示意图；图 3h为本发明实施例 2提供的再一个划分节点分区的方法流程图；图 3hl为本发明实施例 2提供的一个具体实例的结构示意图；图 4为本发明实施例 3提供的划分节点分区的装置的结构示意图；图 5a为本发明实施例 4提供的一个划分节点分区的装置的结构示意图；图 5b为本发明实施例 4提供的另一个划分节点分区的装置的结构示图 5 c为本发明实施例 4提供的再一个划分节点分区的装置的结构示 In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the present invention. Other drawings may also be obtained from those of ordinary skill in the art in light of the inventive work. 1 is a schematic structural diagram of a specific example in the prior art; FIG. 2a is a flowchart of a method for partitioning a node according to Embodiment 1 of the present invention; FIG. 2b is a schematic structural diagram of a specific example according to an embodiment of the present invention; 2a is a schematic structural diagram of another specific example according to an embodiment of the present invention; FIG. 2 is a schematic structural diagram of another embodiment of the present invention; FIG. 3a is a schematic diagram of partitioning a node partition according to Embodiment 2 of the present invention; FIG. 3b is a flowchart of another method for partitioning a node according to Embodiment 2 of the present invention; FIG. 3c is a flowchart of another method for partitioning a node according to Embodiment 2 of the present invention; FIG. 3c2 is a schematic structural diagram of another embodiment of the present invention; FIG. 3c is a schematic structural diagram of still another embodiment of the present invention; FIG. FIG. 3 is a flowchart of a method for partitioning a node partition according to Embodiment 2 of the present invention; FIG. 3e2 is a further partition node partition according to Embodiment 2 of the present invention; Method flow chart; FIG. 3f is a flow chart of another method for dividing a node partition according to Embodiment 2 of the present invention; FIG. FIG. 3g is a flowchart of another method for dividing a node partition according to Embodiment 2 of the present invention; FIG. 3g is a flowchart of a specific example provided by Embodiment 2 of the present invention; FIG. 3 is a schematic flowchart of a method for partitioning a node according to Embodiment 2 of the present invention; FIG. 3 is a schematic structural diagram of a specific example provided by Embodiment 2 of the present invention; FIG. 5 is a schematic structural diagram of an apparatus for partitioning a node partition according to Embodiment 4 of the present invention; FIG. 5b is a schematic structural diagram of another apparatus for partitioning a node partition according to Embodiment 4 of the present invention; FIG. 5 is a structural diagram of another apparatus for dividing a node partition according to Embodiment 4 of the present invention;

图 5 d为本发明实施例 4提供的再一个划分节点分区的装置的结构示意图；图 5 e为本发明实施例 4提供的再一个划分节点分区的装置的结构示意图；图 5 f 为本发明实施例 4提供的再一个划分节点分区的装置的结构示意图；图 5 g为本发明实施例 4提供的再一个划分节点分区的装置的结构示 FIG. 5 is a schematic structural diagram of another apparatus for dividing a node partition according to Embodiment 4 of the present invention; FIG. 5 e is a schematic structural diagram of another apparatus for partitioning a node partition according to Embodiment 4 of the present invention; FIG. FIG. 5 is a schematic structural diagram of another apparatus for dividing a node partition according to Embodiment 4 of the present invention; FIG.

图 6为本发明实施例 5提供的服务器的结构示意图。具体实施方式 FIG. 6 is a schematic structural diagram of a server according to Embodiment 5 of the present invention. detailed description

下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其它实施例，都属于本发明保护的范围。 The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

为使本发明技术方案的优点更加清楚，下面结合附图和实施例对本发明作详细说明。 In order to make the advantages of the technical solutions of the present invention clearer, the present invention will be described in detail below with reference to the accompanying drawings and embodiments.

实施例 1 Example 1

本发明实施例提供一种划分节点分区的方法，如图 2a所示，包括：需要说明的是，本发明实施例的方法流程可以由***中的承担***监管功能的服务器执行，例如：在现有技术中，通信***中的作为管理服务器的工作站可以承担监控整个通信***运行、调度的功能，技术人员可以通过工作站随时获取整个通信网络的运行情况。 The embodiment of the present invention provides a method for dividing a node partition, as shown in FIG. 2a, including: It should be noted that the method flow of the embodiment of the present invention may be performed by a server in the system that performs system supervision, for example: In the technology, the workstation as the management server in the communication system can undertake the function of monitoring the operation and scheduling of the entire communication system, and the technician can Get the entire communication network running at any time through the workstation.

5201 , 服务器获取***的拓朴结构和参与分区的节点数量。 5201. The server acquires the topology structure of the system and the number of nodes participating in the partition.

其中， ***包括至少三个节点，每一个节点包括至少二个 CPU。 The system includes at least three nodes, each of which includes at least two CPUs.

在本实施例中，服务器可以通过现有的技术手段获取***拓朴结构，并且***拓朴结构中包括了各个网元的数量和连接关系，例如：基站一移动终端的通信***，在架设完毕后，诸如：路由器、网关、交换机、服务器、发射天线等设备都是通过物理线缆按照运营商提供的拓朴结构图（包括了各种设备的数量以及连接关系）进行连接的，并且这个拓朴结构图被存储在了服务器中，以便于服务器可以在整个***运行时，根据拓朴结构图监控***中的各个节点的运行情况。 In this embodiment, the server can obtain the system topology structure by using existing technical means, and the system topology includes the number and connection relationship of each network element, for example: the communication system of the base station-mobile terminal is set up. Afterwards, devices such as routers, gateways, switches, servers, and transmitting antennas are connected by physical cables according to the topology map provided by the operator (including the number of various devices and connection relationships), and this extension is The Pak structure map is stored in the server so that the server can monitor the operation of each node in the system according to the topology structure diagram while the entire system is running.

进一步的，在本实施例中，服务器可以获取参与分区的节点数量，该节点数量可以由技术人员通过输入设备输入至服务器中，也可以由服务器根据具体的运行状态自动计算得到。 Further, in this embodiment, the server may acquire the number of nodes participating in the partition, and the number of the nodes may be input into the server by the technical personnel through the input device, or may be automatically calculated by the server according to the specific running state.

5202 , 根据所述***的拓朴结构，确定连接信息。 5202. Determine connection information according to the topology of the system.

其中，连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系。 The connection information includes: a connection relationship between each CPU in the system and other CPUs.

在本实施例中， CPU之间可以通过 QP I相连，服务器可以直接从拓朴结构中获取各个 CPU之间的连接关系，例如：在实际应用中， CPU之间的连接关系体现在运营商提供的拓朴结构图中，服务器可以从拓朴结构图中获取。 In this embodiment, the CPUs can be connected through the QP I, and the server can directly obtain the connection relationship between the CPUs from the topology structure, for example: In practical applications, the connection relationship between the CPUs is provided by the operator. In the topology diagram, the server can be obtained from the topology map.

5203 , 根据所述参与分区的节点数量和所述连接信息确定分区方案。其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。需要说明的是，在实际应用中， ***的各个设备往往都已通过物理线路（如数据线、同轴电缆等）相连，服务器也是通过相应的物理线路连接 CPU之间的端口，从而在物理层面上各个 CPU其实已经相连，但是在*** 的实际运行中，并不是所有的物理线路都被启用，比如：图 2b所示的是包括了节点 0、节点 1、节点 2这 3个节点拓朴结构图，并且各个节点中的 CPU都通过相应的物理线路相连，其中， ②、 ④可以是图 2 c所示的连接了各个节点之间的交联线； ①、 ③可以是图 2d 所示的单个节点内部连接 2个 CPU端口的桥接线。 S203. Determine a partitioning scheme according to the number of nodes participating in the partition and the connection information. The number of nodes in the partitioning scheme is the number of nodes in the participating partition. It should be noted that, in practical applications, each device of the system is often connected through physical lines (such as data lines, coaxial cables, etc.), and the server is also connected to the port between the CPUs through corresponding physical lines, thereby being physically The CPUs are actually connected, but in the actual operation of the system, not all physical lines are enabled. For example: Figure 2b shows the three node topologies including node 0, node 1, and node 2. Figure, and in each node The CPUs are all connected by corresponding physical lines, wherein 2, 4 may be the cross-links connected between the nodes shown in Figure 2c; 1, 3 may be the internal connections of the single nodes shown in Figure 2d 2 Bridge wiring for the CPU port.

服务器可以通过在一条物理线路上构建 QP I , 从而启用这一条物理线路，从而实现二个 CPU之间的信息交互，比如：服务器可以通过在①、 ④ 这二个物理线路上构建 QP I ,从而实现节点 0中的 CPU1和节点 1中的 CPU0 之间的信息交互。 The server can enable this physical line by constructing QP I on a physical line, so that the information exchange between the two CPUs can be realized. For example, the server can construct QP I on the two physical lines 1, 4 The information interaction between CPU1 in node 0 and CPU0 in node 1 is implemented.

本发明实施例提供的划分节点分区的方法，能够自动根据***的拓 4卜结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。 The method for partitioning node partitions provided by the embodiments of the present invention can automatically analyze and obtain the partitioning scheme with the least number of interconnected channels according to the topology of the system, thereby reducing the workload of the technicians and reducing the operating cost of the system.

实施例 2 Example 2

本发明实施例提供一种划分节点分区的方法，如图 3a所示，包括： S 301 , 服务器获取***的拓朴结构。 An embodiment of the present invention provides a method for dividing a node partition. As shown in FIG. 3a, the method includes: S301. The server acquires a topology structure of the system.

S 302a , 获取所述***的运行状态信息。 S302a, obtaining running state information of the system.

在本实施例中，服务器可以通过本领域技术人员所熟知的技术手段，获取***的运行状态信息，并将运行状态信息作为参量来分析并确定参与分区的节点数量，例如： In this embodiment, the server may obtain the running state information of the system by using technical means well known to those skilled in the art, and use the running state information as a parameter to analyze and determine the number of nodes participating in the partition, for example:

运行状态信息可以包括所述***中的 CPU的平均负载值，服务器获取 ***中各个 CPU的负载值，并以此计算出平均负载值。例如：服务器可以获取图 2b所示的 3个节点中的总共 6个 CPU的负载值，并计算出平均负载值。 The running status information may include an average load value of the CPU in the system, and the server acquires the load value of each CPU in the system, and calculates the average load value. For example: The server can get the load value of a total of 6 CPUs among the 3 nodes shown in Figure 2b and calculate the average load value.

S 303a , 检测所述平均负载值所在的区间，并将与所述区间相对应的预设值确定为所述参与分区的节点数量。 S 303a, detecting an interval in which the average load value is located, and determining a preset value corresponding to the interval as the number of nodes of the participating partition.

在本实施例中，服务器可以根据运行状态信息，通过阈值分析法确定参与分区的节点数量，例如： In this embodiment, the server may determine the number of nodes participating in the partition by using threshold analysis according to the running state information, for example:

服务器中可以预存一系列连续的区间，并且每一个区间都对应一个预设值，平均负载值所在的区间所对应的与设值即为参与分区的节点数量 , 比^口： A series of consecutive intervals can be pre-stored in the server, and each interval corresponds to one pre- Set value, the corresponding value of the interval where the average load value is located is the number of nodes participating in the partition, and the ratio is:

表一 Table I

表一所示的是存在服务器中的连续的区间与预设值之间的对应关系，若平均负载值为 6 , 则服务器将 3作为参与分区的节点数量，即总共将 3 个节点划分至一个分区中。 Table 1 shows the correspondence between the continuous interval in the server and the preset value. If the average load value is 6, the server will use 3 as the number of nodes participating in the partition, that is, divide the total of 3 nodes into one. In the partition.

同理，服务器也可以根据其他运行状态信息确定参与分区的节点数量，例如：服务器可以将数据流量作为运行状态信息，并通过诸如 S 303a 所述的阈值分析法，确定参与分区的节点数量。 Similarly, the server can also determine the number of nodes participating in the partition according to other running status information. For example, the server can use the data traffic as the running status information, and determine the number of nodes participating in the partition by using a threshold analysis method such as described in S 303a.

在本实施例中，服务器通过执行 S 302 a至 S 303a的流程，可以根据系统的运行状态自动分析出参与分区的节点数量，免去了现有技术中技术人员人工分析并计算参与分区的节点数量的过程，从而减少了技术人员的工作量，增加了***的自动化程度，减少了人工成本，最终降低了运行成本。 In this embodiment, the server can automatically analyze the number of nodes participating in the partition according to the running state of the system by executing the processes of S 302 a to S 303 a , thereby eliminating the manual analysis and calculating the nodes participating in the partition by those skilled in the prior art. The number of processes reduces the workload of the technicians, increases the automation of the system, reduces labor costs, and ultimately reduces operating costs.

并列可选的，如图 3b 所示，在本实施例中服务器确定参与分区的节点数量的方式还包括 S 302 b。 Parallelly, as shown in FIG. 3b, in the embodiment, the manner in which the server determines the number of nodes participating in the partition further includes S302b.

S 302b , 接收数量信息，并根据所述数量信息获取所述参与分区的节点数量。 S302b, receiving quantity information, and acquiring the number of nodes of the participating partition according to the quantity information.

在本实施例中，服务器可以接收技术人员输入的数量信息，并根据数量信息获取参与分区的节点数量。即在本实施例中，参与分区的节点数量可以由负责***维护的技术人员确定并输入，服务器再根据技术人员所输入的数量信息自动生成分区方案。需要说明的是，在 S 302 b中，技术人员只需要输入参与分区的节点数量，并不需要如现有技术中一样人工确定具体由哪些服务器参与分区，确定分区方案的过程还是由服务器自动执行，并不需要人工参与。例如： In this embodiment, the server may receive the quantity information input by the technician, and acquire the number of nodes participating in the partition according to the quantity information. That is, in this embodiment, the number of nodes participating in the partition may be determined and input by a technician responsible for system maintenance, and the server automatically generates a partitioning scheme according to the quantity information input by the technician. It should be noted that, in S 302 b, the technician only needs to input the number of nodes participating in the partition, and does not need to manually determine the same as in the prior art. Which servers participate in the partition, the process of determining the partitioning scheme is still performed automatically by the server, and does not require manual participation. E.g:

服务器可以在显示屏上显示一个输入界面，技术人员可以通过输入设备将数值输入服务器，服务器则将技术人员输入的数值作为数量信息进行处理并确定参与分区的节点数量。 The server can display an input interface on the display. The technician can enter the value into the server through the input device. The server processes the value entered by the technician as quantity information and determines the number of nodes participating in the partition.

进一步的， S 302a至 S 303a , 与 S 302b可以按照一定的先后顺序执行，例如：服务器可以先执行 S 302a至 S 303a的流程，并通过区间比对的方法自动获取一个预设值后，将该预设值显示显示在显示屏上的输入界面中，以供技术人员参考，并接收技术人员输入的数量信息。 Further, S 302a to S 303a and S 302b may be executed in a certain order. For example, the server may first execute the processes of S 302a to S 303a, and automatically obtain a preset value by using the interval comparison method, and then The preset value display is displayed in the input interface on the display for reference by the technician and receives the quantity information input by the technician.

S 304 , 根据所述***的拓朴结构，确定连接信息。 S304. Determine connection information according to a topology of the system.

S 305 , 根据所述参与分区的节点数量和所述连接信息确定分区方案。其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。并且， ***中的每一个 CPU与其他 CPU之间通过快速互联通道 QP I相连。 S305. Determine a partitioning scheme according to the number of nodes participating in the partition and the connection information. The number of nodes in the partitioning scheme is the number of nodes in the participating partition. Also, each CPU in the system is connected to other CPUs via the fast interconnect channel QP I.

进一步的，在本实施例中，如图 3c所示， S 305可以包括： Further, in this embodiment, as shown in FIG. 3c, the S305 may include:

53051 , 确定组成所述***的节点总数量 M。 53051, determine the total number of nodes M that make up the system.

53052 , 根据 M和所述参与分区的节点数量 N , 获取种分区组合。其中，在每一组分区组合中包括了 N个节点，这 N个节点为组成所述 ***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点。 53052, obtaining a partition combination according to M and the number of nodes N participating in the partition. Wherein, N nodes are included in each component zone combination, and the N nodes are part of M nodes constituting the system, and each partition combination includes nodes different from other zone combinations. .

即服务器可以获取当参与分区的节点数量为 N时，所有可能的服务器的分区组合。例如：如图 2b所示， ***中总共有 3个节点，而参与分区的节点数量为 2 , 则获取 C₃ ² = 3种分区组合，即节点 0—节点 1、节点 0— 节点 2、节点 1一节点 2。 That is, the server can obtain the partition combination of all possible servers when the number of nodes participating in the partition is N. For example: As shown in Figure 2b, there are a total of 3 nodes in the system, and the number of nodes participating in the partition is 2, then C ₃ ² = 3 partition combinations are obtained, namely node 0 - node 1, node 0 - node 2, node 1 node 2 .

5305 3 , 根据所述连接信息，获取每一种分区组合中的最大 QP I跳数。在本实施例中，服务器可以通过已有的穷举算法等手段获取每一种分区组合中的最大 QPI跳数。 5305 3: Obtain a maximum QP I hop count in each partition combination according to the connection information. In this embodiment, the server may obtain the maximum number of QPI hops in each partition combination by means of an existing exhaustive algorithm or the like.

例如：图 3cl、图 3c2、图 3c3所示的分别为图 2b中的 3种分区方案，其中： For example: Figure 3cl, Figure 3c2, Figure 3c3 are the three partitioning schemes in Figure 2b, where:

图 3cl为节点 0—节点 1 的分区组合，最大 QPI跳数为 2, 比如：节点 0中的 CPU0通过①和⑦二跳连接节点 1中的 CPU1; Figure 3cl is the partition combination of node 0-node 1, the maximum QPI hop count is 2, for example: CPU0 in node 0 is connected to CPU1 in node 1 through 1 and 7 second hop;

图 3c2为节点 0—节点 2的分区组合，最大 QPI跳数为 3, 比如：节点 0中的 CPU0通过①、 ②和③三跳连接节点 2中的 CPU0; Figure 3c2 is the partition combination of node 0 - node 2, the maximum QPI hop count is 3, for example: CPU0 in node 0 is connected to CPU0 in node 2 through 1, 2 and 3 three hops;

图 3c3为节点 1一节点 2的分区组合，最大 QPI跳数为 3, 比如：节点 0中的 CPU1通过⑥、 ⑤和③三跳连接节点 2中的 CPU1。 Figure 3c3 shows the partition combination of node 1 and node 2. The maximum number of QPI hops is 3. For example, CPU1 in node 0 connects to CPU1 in node 2 through 6, 5, and 3 triple hops.

S3054, 将最大 QPI跳数最小的分区组合确定为所述分区方案。 S3054: Determine a partition combination that minimizes a maximum QPI hop count as the partitioning scheme.

例如：图 3cl所示的分区组合的最大 QPI跳数为 2, 图 3c2所示的最大 QPI跳数为 3, 分区组合和图 3c3所示的分区组合的最大 QPI跳数为 3。则将图 3cl所示的分区组合确定为所述分区方案。 For example, the maximum QPI hop count of the partition combination shown in Figure 3cl is 2, the maximum QPI hop count shown in Figure 3c2 is 3, and the partition Q1 and the partition combination shown in Figure 3c3 have a maximum QPI hop count of 3. The partition combination shown in Fig. 3cl is determined as the partition scheme.

在本实施例中，服务器通过执行 S3051至 S3054的流程，可以通过穷举法等计算机算法，自动分析并获取最优的分区方案，从而避免了人工分析分区方案时的主观因素的影响，实现了服务器自动以最优选方案分区对 ***中的服务器进行分区。并且由于最优选方案分区中的最大 QPI跳数是最小了，緩减了 CPU之间由于 QPI跳数过多所导致的运算速率降低，从而緩减了***性能的降低。 In this embodiment, by executing the processes of S3051 to S3054, the server can automatically analyze and obtain an optimal partitioning scheme by using a computer algorithm such as an exhaustive method, thereby avoiding the influence of subjective factors when manually analyzing the partitioning scheme, and realizing The server automatically partitions the servers in the system with the most preferred scenario partition. And because the maximum QPI hop count in the most preferred scheme partition is the smallest, the computational rate reduction caused by the excessive number of QPI hops between the CPUs is reduced, thereby reducing the performance degradation of the system.

进一步的，如图 3d所示，还包括： Further, as shown in FIG. 3d, the method further includes:

S306, 若最大 QPI跳数最小的分区组合有至少二种，则检测是否存在识别信息。 S306. If there are at least two combinations of partitions with the smallest maximum number of QPI hops, it is detected whether there is identification information.

在本实施例中，存在最大 QPI跳数最小的分区组合有多个的情况，例如：分区组合 1的最大 QPI跳数为 2, 分区组合 2的最大 QPI跳数为 2, 分区组合 3的最大 QPI跳数为 4, 即分区组合 1和分区组合 2的最大 QPI 跳数为一样且都为最小。需要说明的是，本实施例中的识别信息可以预存在服务器中，并由服务器自动获取，例如：服务器的存储设备中可以预存作为识别信息的服务器的编号，当存在 1个以上的最大 QP I跳数最小的分区组合时，服务器自动提取服务器的编号，并将编号按照由小到大的顺序排列，再将所含的服务器的编号最靠前的分区组合确定为分区方案，比如：分区组合 1中包括了节点 0和节点 1 ; 分区组合 2中包括了节点 0和节点 2 , 显而易见分区组合 1中的服务器编号 0、 1相比分区组合 1中的服务器编号 0、 2更靠前，则服务器可以将分区组合 1确定为分区方案。 In this embodiment, there are multiple combinations of partitions with the smallest maximum number of QPI hops, for example: the maximum QPI hop count of partition combination 1 is 2, the maximum QPI hop count of partition combination 2 is 2, and the maximum partition combination 3 is The QPI hop count is 4, that is, the maximum QPI hop count of partition combination 1 and partition combination 2 is the same and both are minimum. It should be noted that the identification information in this embodiment may be pre-stored in the server and automatically obtained by the server. For example, the storage device of the server may pre-store the number of the server as the identification information, and when there is more than one maximum QP I When the partition with the smallest number of hops is combined, the server automatically extracts the number of the server, and arranges the numbers in the order of small to large, and then determines the partition combination of the highest number of the included server as the partition scheme, for example: partition combination 1 includes node 0 and node 1; partition combination 2 includes node 0 and node 2, and it is obvious that server numbers 0 and 1 in partition combination 1 are higher than server numbers 0 and 2 in partition combination 1, The server can determine partition combination 1 as a partitioning scheme.

还需要说明的是，识别信息也可以由技术人员通过输入设备输入，例如： It should also be noted that the identification information can also be input by a technician through an input device, for example:

服务器可以在显示屏上显示一个输入界面，并且输入界面上显示了分区组合 1和分区组合 2 , 技术人员可以通过输入设备输入识别信息，该识别信息对应于分区组合 1或分区组合 2 , 以便于服务器根据识别信息从分区组合 1和分区组合 2中选择一个作为分区方案。 The server can display an input interface on the display screen, and the partition interface 1 and the partition combination 2 are displayed on the input interface, and the technician can input the identification information through the input device, and the identification information corresponds to the partition combination 1 or the partition combination 2, so as to facilitate The server selects one of the partition combination 1 and the partition combination 2 as a partitioning scheme based on the identification information.

S 307a , 若存在识别信息，则将所述识别信息所指定的分区组合确定为所述分区方案。 S 307a, if the identification information exists, determining the partition combination specified by the identification information as the partitioning scheme.

S 307b , 若不存在识别信息，则从所获取的最大 QPI 跳数最小的分区组合中选择一个分区组合确定为所述分区方案。 S 307b , if there is no identification information, selecting a partition combination from the obtained partition combination with the smallest maximum QPI hop count is determined as the partition scheme.

在本实施例中，服务器可以在不存在识别信息的情况下自动选则一个分区组合并确定为分区方案。其中，服务器进行自动选择的具体实施方式可以是本领域技术人员所熟知的任意方式，例如：服务器可以将最先获取的最大 QPI跳数最小的分区组合的作为分区方案。 In this embodiment, the server can automatically select a partition combination and determine the partition scheme without the identification information. The specific implementation manner in which the server performs automatic selection may be any manner known to those skilled in the art. For example, the server may use the partition combination with the smallest maximum number of QPI hops obtained first as the partitioning scheme.

进一步的，在确定分区方案后，如图 3el所示，所述方法还包括： Further, after determining the partitioning scheme, as shown in FIG. 3el, the method further includes:

S 308a , 检测是否接收到触发信息。 S 308a , detecting whether a trigger information is received.

在本实施例中，服务器在自动生成分区方案后，可以根据分区方案自动进行分区，具体的分区方式可以为本领域技术人员所熟知的方式。并且可以由技术人员通过输入设备输入触发信息以触发分区的执行过程。 S309a, 若接收到所述触发信息，则根据所确定的分区方案对所述系统进行分区。 In this embodiment, after the server automatically generates the partitioning scheme, the partitioning may be automatically performed according to the partitioning scheme, and the specific partitioning manner may be a manner well known to those skilled in the art. And the trigger information can be input by the technician through the input device to trigger the execution process of the partition. S309a. If the trigger information is received, the system is partitioned according to the determined partitioning scheme.

需要说明的是，在本实施例中，服务器在接收到技术人员输入的触发信息后，可以自动根据分区方案进行分区，并且整个分区的过程不需要人为操作，技术人员仅仅是触发分区的过程开始执行。 It should be noted that, in this embodiment, after receiving the trigger information input by the technician, the server may automatically perform partitioning according to the partitioning scheme, and the process of the entire partition does not need to be manually operated, and the technician only starts the process of triggering the partition. carried out.

其中，若没有接收到所述触发信息，则不做任何处理。 If no trigger information is received, no processing is performed.

需要说明的是，服务器可以在执行完毕 S305后执行 S308a至 S309a, 或 S308b; 也可以如图 3e2所示在执行完毕 S307a或 S307b后执行 S308a 至 S309a, 或如图 3f2所示的，在执行完毕 S307a或 S307b后 S308b, 即服务器只要在确定分区方案后执行 S308a至 S309a, 或 S308b即可。 It should be noted that the server may perform S308a to S309a, or S308b after the execution of S305; or may perform S308a to S309a after executing S307a or S307b as shown in FIG. 3e2, or as shown in FIG. 3f2, after execution is completed. S307a or S307b and S308b, that is, the server may perform S308a to S309a, or S308b after determining the partitioning scheme.

并列的，如图 3Π所示，还包括： Parallel, as shown in Figure 3, also includes:

S308b, 根据所确定的分区方案对所述***进行分区。 S308b, partitioning the system according to the determined partitioning scheme.

即不需要技术人员输入触发信息，服务器在确定了分区方案后就立即自动执行分区过程。 That is, the technician is not required to input the trigger information, and the server automatically performs the partitioning process immediately after determining the partitioning scheme.

进一步的，在对所述***进行分区后，所述方法还包括： Further, after the system is partitioned, the method further includes:

其一，如图 3g所示， First, as shown in Figure 3g,

S310a, 获取所述***中当前的平均负载值。 S310a, obtaining a current average load value in the system.

S311a,若所述当前的平均负载值大于所述区间的最大值，则将 C^⁺¹种分区组合中，最大 QPI跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 S311a, if the current average load value is greater than the maximum value of the interval, the partition combination with the smallest maximum QPI hop count among the C^ ⁺¹ partition combinations is determined as a new partition scheme, and according to the new partition scheme Partition the system.

例如：如表一所示，若服务器重新获取的 CPU的平均负载值由原来的 6增加为 12, 则预设值为 3。 For example: As shown in Table 1, if the average load value of the CPU reacquired by the server is increased from the original 6 to 12, the default value is 3.

若所述当前的平均负载值不大于所述区间的最大值，则不作处理。即服务器需要向分区中增加一个节点。服务器可以重新在 c^⁺¹种分区组合中，将最大 QPI跳数最小的分区组合确定为新分区方案。 If the current average load value is not greater than the maximum value of the interval, no processing is performed. That is, the server needs to add a node to the partition. The server can re-determine the partition combination with the smallest maximum QPI hop count as the new partition scheme in the c^ ⁺¹ partition combination.

进一步的，服务器所获取的新分区方案中可以包括***当前所使用的分区中的节点。即服务器可以在***已经运行的分区中再加入服务器，使得新的分区中包括了原来***已经运行的分区中的所有服务器和新加入的服务器。例如：如图 3g l所示，在***当前所使用的分区中有节点 0和节点 1两个节点，若服务器需要在***当前所使用的分区中再加入一个节点，则服务器可以通过穷举法等技术手段获取 C^⁺¹ 种分区组合，并在 C^⁺¹种分区组合中筛选出具有***当前所使用的分区中的节点（在本实例中即为节点 0和节点 1 ) 的分区组合，并在具有***当前所使用的分区中的节点的的分区组合中选取最大 QPI跳数最小的分区组合确定为新分区方案。其中， M为组成***的节点总数量， N 为***当前所使用的分区中的节点数量。新分区方案中包括了节点 0、节点 1和节点 2 , 则服务器在系统当前所使用的分区中加入节点 2 , 并通过增加⑤、 ③、 ②这 3条线路将节点 2与节点 0和节点 1相连，即可实现新分区方案，并且在实现新分区方案的过程中，由于不需要改变对原有分区中的节点和服务器之间的连接关系，从而不需要中断在***当前所使用的分区上的业务。 Further, the new partitioning scheme acquired by the server may include nodes in the partition currently used by the system. That is, the server can join the server in the partition where the system is already running, so that the server The new partition includes all the servers in the partition that the original system has been running and the newly joined servers. For example: As shown in Figure 3g l, there are two nodes, Node 0 and Node 1, in the partition currently used by the system. If the server needs to add another node to the partition currently used by the system, the server can pass the exhaustive method. The technical means obtains C^ ⁺¹ partition combinations, and ^{selects the} partition combination of the nodes in the partition currently used by the system (node 0 and node 1 in this example) in the C^ ⁺¹ partition combination. And selecting the combination of partitions with the smallest maximum QPI hop count among the partition combinations of the nodes in the partition currently used by the system as the new partition scheme. Where M is the total number of nodes that make up the system, and N is the number of nodes in the partition currently used by the system. The new partitioning scheme includes node 0, node 1, and node 2. Then the server adds node 2 to the partition currently used by the system, and adds node 2, node 0, and node 1 by adding 5 lines, 3, and 2 lines. Connected, the new partitioning scheme can be implemented, and in the process of implementing the new partitioning scheme, since there is no need to change the connection relationship between the node and the server in the original partition, there is no need to interrupt the partition currently used by the system. Business.

其二，如图 3h所示， Second, as shown in Figure 3h,

S 310b , 获取所述***中当前的平均负载值。 S 310b , obtaining the current average load value in the system.

S 311b ,若所述当前的平均负载值小于所述区间的最小值，则将 C^—¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 S 311b, if the current average load value is less than the minimum value of the interval, determining a partition combination in which the maximum QP I hop count is the smallest in the C^ ^-1 partition combination, as a new partition scheme, and according to the new The partitioning scheme partitions the system.

例如：如表一所示，若服务器重新获取的 CPU的平均负载值由原来的 12减少为 6 , 则预设值由 3减少为 2。 For example: As shown in Table 1, if the average load value of the CPU reacquired by the server is reduced from the original 12 to 6, the default value is reduced from 3 to 2.

即服务器需要向分区中减少一个节点。服务器可以重新在 c^—¹种分区组合中，将最大 QPI跳数最小的分区组合确定为新分区方案。 That is, the server needs to reduce one node to the partition. The server can re-determine the partition combination with the smallest maximum QPI hop count as the new partition scheme in the c^ ^-1 partition combination.

进一步的， ***当前所使用的分区可以包括新分区方案中的节点。即服务器所获取的新分区方案中可以包括***当前所使用的分区中的一部分服务器，服务器可以在***已经运行的分区中减少服务器。例如：如图 3hl所示，在***当前所使用的分区中有节点 0、节点 1和节点 2 共三个节点，若服务器需要在***当前所使用的分区中减少一个节点，则服务器可以通过穷举法等技术手段获取

种分区组合中筛选出具有***当前所使用的分区中的节点（在本实例中即为节点 0、节点 1和节点 2中的任意二个）的分区组合，并在具有***当前所使用的分区中的节点的分区组合中选取最大 QP I跳数最小的分区组合确定为新分区方案。其中， M为组成***的节点总数量， N 为***当前所使用的分区中的节点数量。新分区方案中包括了节点 0、节点 1 , 则服务器在***当前所使用的分区中减去节点 2 , 并关闭⑤、 ③、 ②这 3条线路将节点 2 与节点 0和节点 1相连的线路，即可实现新分区方案，并且在实现新分区方案的过程中，由于不需要改变对原有分区中的除了所减去的服务器以外的服务器（在本实例中即为本节点 0、节点 1 )之间的连接关系，从而不需要中断在***当前所使用的分区上的业务。 Further, the partition currently used by the system may include nodes in the new partitioning scheme. That is, the new partitioning scheme acquired by the server may include a part of the servers in the partition currently used by the system, and the server may reduce the server in the partition in which the system has already run. For example: As shown in Figure 3hl, there are three nodes in node 0, node 1, and node 2 in the partition currently used by the system. If the server needs to reduce one node in the partition currently used by the system, the server Can be obtained through technical means such as exhaustive law

The partition combination is selected from the partition combination of the nodes in the partition currently used by the system (in this example, any two of node 0, node 1 and node 2), and has the partition currently used by the system. The partition combination in which the maximum QP I hop count is selected among the partition combinations of the nodes in the node is determined as the new partition scheme. Where M is the total number of nodes that make up the system, and N is the number of nodes in the partition currently used by the system. The new partitioning scheme includes node 0 and node 1. Then the server subtracts node 2 from the partition currently used by the system, and closes the lines connecting node 2 with node 0 and node 1 by 5, 3, and 2 lines. , the new partitioning scheme can be implemented, and in the process of implementing the new partitioning scheme, since it is not necessary to change the server other than the subtracted server in the original partition (in this example, it is the node 0, node 1) The connection relationship between them, so that there is no need to interrupt the traffic on the partition currently used by the system.

本发明实施例提供的划分节点分区的方法，能够自动根据***的拓 4卜结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。并且避免了人工分析分区方案时的主观因素的影响，以便于以最优选方案分区对***中的服务器进行分区，从而緩减了由于分区不当导致的运算速率降低，从而緩减了***性能降低。 The method for partitioning node partitions provided by the embodiments of the present invention can automatically analyze and obtain the partitioning scheme with the least number of interconnected channels according to the topology of the system, thereby reducing the workload of the technicians and reducing the operating cost of the system. Moreover, the influence of subjective factors in manually analyzing the partitioning scheme is avoided, so that the server in the system is partitioned by the most preferable scheme partitioning, thereby reducing the operation rate reduction caused by improper partitioning, thereby reducing system performance degradation.

实施例 3 Example 3

本发明实施例提供一种划分节点分区的装置，如图 4所示，包括：拓朴提取模块 41 , 用于获取***的拓朴结构。 An embodiment of the present invention provides a device for dividing a node partition, as shown in FIG. 4, including: a topology extraction module 41, configured to acquire a topology structure of the system.

数量确定模块 42 , 用于获取参与分区的节点数量。 The quantity determining module 42 is configured to obtain the number of nodes participating in the partition.

拓朴分析模块 43 , 用于根据所述***的拓朴结构，确定连接信息。其中，连接信息包括：在***中的每一个 CPU与其他 CPU之间的连接关系。 The topology analysis module 43 is configured to determine connection information according to the topology of the system. The connection information includes: a connection relationship between each CPU in the system and other CPUs.

分析模块 44 ,用于根据所述参与分区的节点数量和所述连接信息确定分区方案。 The analyzing module 44 is configured to determine a partitioning scheme according to the number of nodes participating in the partition and the connection information.

其中，在分区方案中的节点的数目为参与分区的节点数量。本发明实施例提供的划分节点分区的装置，能够通过分析模块自动根据***的拓朴结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。 Wherein, the number of nodes in the partitioning scheme is the number of nodes participating in the partition. The device for dividing a node partition provided by the embodiment of the present invention can automatically analyze and obtain a partitioning scheme with the minimum number of interconnected channels according to the topology structure of the system, thereby reducing the workload of the technician and reducing the operating cost of the system. .

实施例 4 Example 4

本发明实施例提供一种划分节点分区的装置，如图 5a所示，包括：拓朴提取模块 51 , 用于获取***的拓朴结构。 An embodiment of the present invention provides a device for dividing a node partition, as shown in FIG. 5a, including: a topology extraction module 51, configured to acquire a topology structure of the system.

其中， ***包括至少三个节点，每一个节点包括至少二个 CPU。数量确定模块 52 , 用于获取参与分区的节点数量。 The system includes at least three nodes, each of which includes at least two CPUs. The quantity determining module 52 is configured to acquire the number of nodes participating in the partition.

其中，如图 5b所示，所述数量确定模块 52包括： As shown in FIG. 5b, the quantity determining module 52 includes:

状态检测单元 521 a , 用于获取所述***的运行状态信息，所述运行状态信息包括所述***中的 CPU的平均负载值。 The state detecting unit 521 a is configured to acquire running state information of the system, where the running state information includes an average load value of a CPU in the system.

数量分析单元 522a ,用于根据所述平均负载值获取所述参与分区的节点数量。 The quantity analysis unit 522a is configured to acquire the number of nodes of the participating partition according to the average load value.

其中，所述数量分析单元 522a , 还用于检测所述平均负载值所在的区并列可选的，如图 5 c所示，所述数量确定模块 52还可以包括：数量信息接收单元 521 b , 用于根据所述数量信息获取所述参与分区的节点数量。 The quantity determining unit 522a is further configured to detect that the area where the average load value is located is juxtaposed. As shown in FIG. 5c, the quantity determining module 52 may further include: a quantity information receiving unit 521b. And a number of nodes used to acquire the participating partitions according to the quantity information.

拓朴分析模块 5 3 , 用于根据所述***的拓朴结构，确定连接信息。连接信息包括：在***中的每一个 CPU与其他 CPU之间的连接关系。分析模块 54 ,用于根据所述参与分区的节点数量和所述连接信息确定分区方案。 The topology analysis module 5 3 is configured to determine connection information according to the topology structure of the system. The connection information includes: The connection relationship between each CPU in the system and other CPUs. The analyzing module 54 is configured to determine a partitioning scheme according to the number of nodes participating in the partition and the connection information.

需要说明的是，在分区方案中的节点的数目为参与分区的节点数量。其中，如图 5d所示，所述分析模块 54可以包括： It should be noted that the number of nodes in the partitioning scheme is the number of nodes participating in the partition. The analysis module 54 can include:

总量确定单元 541 , 用于确定组成所述***的节点总数量^ A total amount determining unit 541, configured to determine the total number of nodes constituting the system^

其中，所述***中的每一个 CPU与其他 CPU之间通过快速互联通道 QP I 相连， Among them, each CPU in the system communicates with other CPUs through the fast interconnect channel QP I Connected,

分组单元 542, 用于根据 M和所述参与分区的节点数量 N, 获取种分区组合，其中在每一组分区组合中包括了 N个节点，这 N个节点为组成所述***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点。 a grouping unit 542, configured to acquire a seed partition combination according to M and the number N of nodes participating in the partition, where N nodes are included in each component area combination, and the N nodes are M nodes constituting the system Part of it, and each partition combination includes nodes that are different from other partition combinations.

统计单元 543, 用于根据所述连接信息，获取每一种分区组合中的最大 QPI跳数。 The statistic unit 543 is configured to obtain the maximum QPI hop count in each partition combination according to the connection information.

选择单元 544, 用于将最大 QPI跳数最小的分区组合确定为所述分区方案。 The selecting unit 544 determines a partition combination for minimizing the maximum QPI hop count as the partition scheme.

进一步的，如图 5e所示，所述分析模块 54还包括： Further, as shown in FIG. 5e, the analyzing module 54 further includes:

识别信息检测单元 545, 用于若最大 QPI跳数最小的分区组合有至少二种，则检测是否存在识别信息。 The identification information detecting unit 545 is configured to detect whether there is identification information if there are at least two combinations of partitions with the smallest maximum number of QPI hops.

所述选择单元 544, 还用于若存在识别信息，则将所述识别信息所指定的分区组合确定为所述分区方案。 The selecting unit 544 is further configured to determine, if the identification information exists, a partition combination specified by the identification information as the partitioning scheme.

可选的，在本实施例中，如图 5f 所示，所述装置还可以包括：分区模块 55, 用于在确定分区方案后，根据所确定的分区方案对所述 ***进行分区。 Optionally, in this embodiment, as shown in FIG. 5f, the apparatus may further include: a partitioning module 55, configured to partition the system according to the determined partitioning scheme after determining the partitioning scheme.

进一步的，在本实施例中，如图 5g所示，所述装置还包括：接收模块 56, 用于在确定分区方案后，检测是否接收到触发信息。所述分区模块 55,还用于若接收到所述触发信息，则根据所确定的分区方案对所述***进行分区。 Further, in this embodiment, as shown in FIG. 5g, the apparatus further includes: a receiving module 56, configured to detect whether the trigger information is received after determining the partitioning scheme. The partitioning module 55 is further configured to: if the trigger information is received, partition the system according to the determined partitioning scheme.

再进一步可选的，在本实施例中，还包括： Further, in this embodiment, the method further includes:

所述状态检测单元 521a, 还用于在对所述***进行分区后，获取所述 ***中当前的平均负载值。 The state detecting unit 521a is further configured to obtain a current average load value in the system after partitioning the system.

所述选择单元 522a,还用于若所述当前的平均负载值大于所述区间的最大值，则将 C^⁺¹种分区组合中，最大 QPI跳数最小的分区组合确定为新分区方案。所述分区模块 55 , 还用于根据所述新分区方案对所述***进行分区。其中，新分区方案包括***当前所使用的分区中的节点。 The selecting unit 522a is further configured to determine, as the new partitioning scheme, the partition combination in which the maximum QPI hop count is the smallest among the C^ ⁺¹ partition combinations, if the current average load value is greater than the maximum value of the interval. The partitioning module 55 is further configured to partition the system according to the new partitioning scheme. Among them, the new partitioning scheme includes the nodes in the partition currently used by the system.

并列可选的，在本实施例中，还包括： Optionally, in this embodiment, the method further includes:

所述状态检测单元 521 a , 还用于在对所述***进行分区后，获取所述 ***中当前的平均负载值。 The state detecting unit 521 a is further configured to obtain a current average load value in the system after partitioning the system.

所述选择单元 522a ,还用于若所述当前的平均负载值小于所述区间的最小值，则将 C^—¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案。 The selecting unit 522a is further configured to determine, as the new partitioning scheme, a partition combination in which the maximum QP I hop count is the smallest among the C^ ^-1 partition combinations, if the current average load value is less than the minimum value of the interval. .

所述分区模块 55 , 还用于根据所述新分区方案对所述***进行分区。其中， ***当前所使用的分区包括新分区方案中的节点。 The partitioning module 55 is further configured to partition the system according to the new partitioning scheme. The partition currently used by the system includes nodes in the new partition scheme.

本发明实施例提供的划分节点分区的装置，能够通过分析模块自动根据***的拓朴结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。并且避免了人工分析分区方案时的主观因素的影响，以便于以最优选方案分区对***中的服务器进行分区，从而緩减了由于分区不当导致的运算速率降低，从而緩减了*** 性能降低。 The device for dividing a node partition provided by the embodiment of the present invention can automatically analyze and obtain a partitioning scheme with the minimum number of interconnected channels according to the topology structure of the system, thereby reducing the workload of the technician and reducing the operating cost of the system. . Moreover, the influence of subjective factors in the manual analysis of the partitioning scheme is avoided, so that the servers in the system are partitioned by the most preferable scheme partitioning, thereby reducing the operation rate reduction caused by improper partitioning, thereby reducing the system performance degradation.

实施例 5 Example 5

本发明实施例提供一种划分节点分区的服务器，如图 6所示，包括：本实施例中所述的划分节点分区的服务器包括：处理器 61、存储器 62、输入设备 63 , 其中： The embodiment of the present invention provides a server for partitioning a node partition. As shown in FIG. 6, the server includes: a processor 61, a memory 62, and an input device 63, where:

所述处理器 61从所述存储器 62或所述输入设备 63 ,获取***的拓朴结构和参与分区的节点数量；再根据所述***的拓朴结构，确定连接信息；最后根据所述参与分区的节点数量和所述连接信息确定分区方案。 The processor 61 acquires the topology structure of the system and the number of nodes participating in the partition from the memory 62 or the input device 63; and further determines connection information according to the topology structure of the system; and finally according to the participating partition The number of nodes and the connection information determine the partitioning scheme.

需要说明的是， ***包括至少三个节点，每一个节点包括至少二个 CPU。连接信息包括：在***中的每一个 CPU与其他 CPU之间的连接关系。在分区方案中的节点的数目为参与分区的节点数量。 It should be noted that the system includes at least three nodes, and each node includes at least two CPUs. The connection information includes: The connection relationship between each CPU in the system and other CPUs. The number of nodes in the partitioning scheme is the number of nodes participating in the partition.

其中，所述处理器 61获取参与分区的节点数量包括：所述处理器 61 获取所述***的运行状态信息，所述运行状态信息包括所述***中的 CPU 的平均负载值，再根据所述平均负载值获取所述参与分区的节点数量。 The number of nodes that the processor 61 acquires the participating partitions includes: the processor 61 Obtaining running state information of the system, where the running state information includes an average load value of the CPU in the system, and acquiring the number of nodes participating in the partition according to the average load value.

进一步的，所述处理器 61 根据所述平均负载值获取所述参与分区的节点数量包括：所述处理器 61 检测所述平均负载值所在的区间，并从所述存储器 62 中获取与所述区间相对应的预设值，并将该预设值确定为所述参与分区的节点数量。 Further, the obtaining, by the processor 61, the number of nodes participating in the partition according to the average load value includes: the processor 61 detecting an interval in which the average load value is located, and acquiring, from the memory 62, the The preset corresponding to the interval, and determining the preset value as the number of nodes participating in the partition.

并列可选的，所述处理器 61还可以通过所述输入设备 63接收数量信息，并根据所述数量信息获取所述参与分区的节点数量。 Optionally, the processor 61 may further receive the quantity information by using the input device 63, and obtain the number of nodes participating in the partition according to the quantity information.

具体的，在本实施例中，所述处理器 61 根据所述参与分区的节点数量和所述连接信息确定分区方案可以包括： Specifically, in this embodiment, the determining, by the processor 61, the partitioning scheme according to the number of nodes participating in the partition and the connection information may include:

所述处理器 61确定组成所述***的节点总数量 M,再根据 M和所述参与分区的节点数量 N , 获取种分区组合，其中在每一组分区组合中包括了 N个节点，这 N个节点为组成所述***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点，之后根据所述连接信息，获取每一种分区组合中的最大 QPI跳数，最后将最大 QP I跳数最小的分区组合确定为所述分区方案。 The processor 61 determines the total number M of nodes constituting the system, and obtains a seed partition combination according to M and the number of nodes N participating in the partition, wherein N nodes are included in each component area combination, and this N The nodes are part of the M nodes constituting the system, and each of the partition combinations includes nodes that are different from other partition combinations, and then obtain the largest of each partition combination according to the connection information. The QPI hop count, and finally the partition combination that minimizes the maximum QP I hop count is determined as the partition scheme.

需要说明的是， ***中的每一个 CPU与其他 CPU之间通过快速互联通道 QPI相连。 It should be noted that each CPU in the system is connected to other CPUs through the quick interconnect channel QPI.

其中，若最大 QPI跳数最小的分区组合有至少二种，则所述处理器 61 检测是否存在识别信息，所述识别信息由所述处理器 61 通过所述输入设备 63获取，或由所述处理器 61从所述存储器 62中获取。若存在识别信息，则所述处理器 61 将所述识别信息所指定的分区组合确定为所述分区方案。 The processor 61 detects whether there is identification information, and the identification information is acquired by the processor 61 through the input device 63, or by the The processor 61 is obtained from the memory 62. If the identification information exists, the processor 61 determines the partition combination specified by the identification information as the partition scheme.

另一方面，所述处理器 61 在确定分区方案后，可以根据所确定的分区方案对所述***进行分区。 On the other hand, after determining the partitioning scheme, the processor 61 may partition the system according to the determined partitioning scheme.

再一方面，在确定分区方案后，所述处理器 61 检测是否通过所述输入设备 63接收到触发信息。若所述输入设备 63接收到所述触发信息，则所述处理器 61根据所确定的分区方案对所述***进行分区。 In still another aspect, after determining the partitioning scheme, the processor 61 detects whether trigger information is received through the input device 63. If the input device 63 receives the trigger information, then The processor 61 partitions the system according to the determined partitioning scheme.

本实施例中所述的划分节点分区的服务器还可以包括： The server for dividing the node partition described in this embodiment may further include:

所述处理器 61 在对所述***进行分区后，获取所述***中当前的平均负载值。若所述当前的平均负载值大于所述区间的最大值，则所述处理器 61将 C^⁺¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。其中，新分区方案包括***当前所使用的分区中的节点。 The processor 61 obtains the current average load value in the system after partitioning the system. If the current average load value is greater than the maximum value of the interval, the processor 61 determines, as a new partitioning scheme, a partition combination in which the maximum QP I hop count is the smallest among the C^ ⁺¹ partition combinations, and according to the The new partitioning scheme partitions the system. Among them, the new partitioning scheme includes the nodes in the partition currently used by the system.

若所述当前的平均负载值小于所述区间的最小值，则所述处理器 61 将 C^—¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。其中， ***当前所使用的分区包括新分区方案中的节点。 If the current average load value is less than the minimum value of the interval, the processor 61 determines, as a new partitioning scheme, a partition combination in which the maximum QP I hop count is the smallest among the C^ ^-1 partition combinations, and according to the The new partitioning scheme partitions the system. The partition currently used by the system includes nodes in the new partition scheme.

本发明实施例提供的划分节点分区的服务器，能够自动根据***的拓朴结构，分析并得到互联通道数量最少的分区方案，从而减少了技术人员的工作量，降低了***的运行成本。并且避免了人工分析分区方案时的主观因素的影响，以便于以最优选方案分区对***中的服务器进行分区，从而緩减了由于分区不当导致的运算速率降低，从而緩减了***性能降低。本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，是可以通过计算机程序来指令相关的硬件来完成，所述的程序可存储于一计算机可读取存储介质中，该程序在执行时，可包括如上述各方法的实施例的流程。其中，所述的存储介质可为磁碟、光盘、只读存储记忆体 ( Read—On l y Memory , ROM ) 或随机存 4诸己' f乙体 ( Random Acce s s Memory , RAM ) 等。 The server dividing the node partition provided by the embodiment of the present invention can automatically analyze and obtain the partitioning scheme with the least number of interconnected channels according to the topology structure of the system, thereby reducing the workload of the technician and reducing the operating cost of the system. Moreover, the influence of subjective factors in manually analyzing the partitioning scheme is avoided, so that the server in the system is partitioned by the most preferable scheme partitioning, thereby reducing the operation rate reduction caused by improper partitioning, thereby reducing the system performance degradation. A person skilled in the art can understand that all or part of the process of implementing the above embodiment method can be completed by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium. In execution, the flow of an embodiment of the methods as described above may be included. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到的变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应该以权利要求的保护范围为准。 The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any change or replacement that can be easily conceived by those skilled in the art within the technical scope of the present invention is All should be covered by the scope of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

权利要求书 claims

1、一种划分节点分区的方法，其特征在于，包括： 1. A method for dividing node partitions, which is characterized by including:

服务器获取***的拓朴结构和参与分区的节点数量，所述***包括至少三个节点，每一个节点包括至少二个 CPU ; The server obtains the topology structure of the system and the number of nodes participating in the partition. The system includes at least three nodes, and each node includes at least two CPUs;

根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系； According to the topological structure of the system, connection information is determined, and the connection information includes: the connection relationship between each CPU and other CPUs in the system;

根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 A partition plan is determined according to the number of nodes participating in the partition and the connection information, where the number of nodes in the partition plan is the number of nodes participating in the partition.

2、根据权利要求 1 所述的划分节点分区的方法，其特征在于，所述服务器获取参与分区的节点数量包括： 2. The method of dividing node partitions according to claim 1, wherein the server obtains the number of nodes participating in the partitions by:

所述服务器获取所述***的运行状态信息，所述运行状态信息包括所述***中的 CPU的平均负载值； The server obtains the running status information of the system, and the running status information includes the average load value of the CPU in the system;

根据所述平均负载值获取所述参与分区的节点数量。 Obtain the number of nodes participating in the partition according to the average load value.

3、根据权利要求 1 所述的划分节点分区的方法，其特征在于，所述根据所述平均负载值获取所述参与分区的节点数量包括： 3. The method of dividing node partitions according to claim 1, characterized in that: obtaining the number of nodes participating in the partition according to the average load value includes:

所述服务器检测所述平均负载值所在的区间，并将与所述区间相对应的预设值确定为所述参与分区的节点数量。 The server detects the interval in which the average load value is located, and determines the preset value corresponding to the interval as the number of nodes participating in the partition.

4、根据权利要求 1 所述的划分节点分区的方法，其特征在于，所述获取参与分区的节点数量包括： 4. The method of dividing node partitions according to claim 1, wherein the obtaining the number of nodes participating in the partitions includes:

所述服务器接收数量信息，并根据所述数量信息获取所述参与分区的节点数量。 The server receives quantity information and obtains the number of nodes participating in the partition based on the quantity information.

5、根据权利要求 1 所述的划分节点分区的方法，其特征在于，所述 ***中的每一个 CPU与其他 CPU之间通过快速互联通道 QP I相连，所述根据所述参与分区的节点数量和所述连接信息确定分区方案包括： 5. The method of dividing node partitions according to claim 1, characterized in that each CPU in the system is connected to other CPUs through a fast interconnection channel QPI, and the number of nodes participating in the partition is determined by the number of nodes participating in the partition. and the connection information determines the partitioning scheme including:

所述服务器确定组成所述***的节点总数量 M； The server determines the total number M of nodes that make up the system;

根据 M和所述参与分区的节点数量 N , 获取种分区组合，其中在每一组分区组合中包括了 N个节点，这 N个节点为组成所述***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点； According to M and the number of nodes participating in the partition N, obtain a partition combination, where Each partition combination includes N nodes, which are part of the M nodes that make up the system, and each partition combination includes nodes that are different from other partition combinations;

根据所述连接信息，获取每一种分区组合中的最大 QPI跳数；将最大 QP I跳数最小的分区组合确定为所述分区方案。 According to the connection information, the maximum number of QPI hops in each partition combination is obtained; and the partition combination with the smallest maximum number of QPI hops is determined as the partition scheme.

6、根据权利要求 5 所述的划分节点分区的方法，其特征在于，还包括： 6. The method of dividing node partitions according to claim 5, further comprising:

若最大 QPI跳数最小的分区组合有至少二种，则所述服务器检测是否存在识别信息； If there are at least two partition combinations with the smallest maximum QPI hop count, then the server detects whether there is identification information;

若存在识别信息，则将所述识别信息所指定的分区组合确定为所述分区方案。 If identification information exists, the partition combination specified by the identification information is determined as the partition scheme.

7、根据权利要求 1 所述的划分节点分区的方法，其特征在于，在确定分区方案后，所述方法还包括： 7. The method of dividing node partitions according to claim 1, characterized in that, after determining the partition scheme, the method further includes:

所述服务器根据所确定的分区方案对所述***进行分区。 The server partitions the system according to the determined partitioning scheme.

8、根据权利要求 1 所述的划分节点分区的方法，其特征在于，在确定分区方案后，所述方法还包括： 8. The method of dividing node partitions according to claim 1, characterized in that, after determining the partition scheme, the method further includes:

所述服务器检测是否接收到触发信息； The server detects whether trigger information is received;

若接收到所述触发信息，则根据所确定的分区方案对所述***进行分区。 If the trigger information is received, the system is partitioned according to the determined partition plan.

9、根据权利要求 5或 7所述的划分节点分区的方法，其特征在于，在对所述***进行分区后，还包括： 9. The method of dividing node partitions according to claim 5 or 7, characterized in that, after partitioning the system, it further includes:

所述服务器获取所述***中当前的平均负载值； The server obtains the current average load value in the system;

若所述当前的平均负载值大于所述区间的最大值，则将 c^⁺¹种分区组合中，最大 QPI跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 If the current average load value is greater than the maximum value of the interval, then the partition combination with the smallest maximum QPI hop number among c^ ⁺¹ partition combinations is determined as a new partition scheme, and all partition combinations are configured according to the new partition scheme. partition the system.

10、根据权利要求 9所述的划分节点分区的方法，其特征在于，所述新分区方案包括所述***当前所使用的分区中的节点。 10. The method of dividing node partitions according to claim 9, wherein the new partition scheme includes nodes in the partition currently used by the system.

1 1、根据权利要求 5或 7所述的划分节点分区的方法，其特征在于，在对所述***进行分区后，还包括： 11. The method of dividing node partitions according to claim 5 or 7, characterized in that, after partitioning the system, it further includes:

若所述当前的平均负载值小于所述区间的最小值，则将 C^— ¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 If the current average load value is less than the minimum value of the interval, then the partition combination with the smallest maximum QPI hop number among C^ ^-1 partition combinations is determined as a new partition scheme, and the partition combination is determined according to the new partition scheme. The system is partitioned.

12、根据权利要求 1 1 所述的划分节点分区的方法，其特征在于，所述***当前所使用的分区包括所述新分区方案中的节点。 12. The method of dividing node partitions according to claim 11, characterized in that the partition currently used by the system includes nodes in the new partition scheme.

1 3、一种划分节点分区的装置，其特征在于，包括： 1 3. A device for dividing node partitions, characterized by including:

拓朴提取模块，用于获取***的拓朴结构，所述***包括至少三个节点，每一个节点包括至少二个 CPU ; The topology extraction module is used to obtain the topology structure of the system. The system includes at least three nodes, and each node includes at least two CPUs;

数量确定模块，用于获取参与分区的节点数量； Quantity determination module, used to obtain the number of nodes participating in the partition;

拓朴分析模块，用于根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系；分析模块，用于根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 The topology analysis module is used to determine the connection information according to the topology structure of the system. The connection information includes: the connection relationship between each CPU and other CPUs in the system; the analysis module is used to determine the connection information according to the topology structure of the system. The number of nodes participating in the partition and the connection information determine a partition plan, where the number of nodes in the partition plan is the number of nodes participating in the partition.

14、根据权利要求 1 3 所述的划分节点分区的装置，其特征在于，所述数量确定模块包括： 14. The device for dividing node partitions according to claim 13, characterized in that the quantity determination module includes:

状态检测单元，用于获取所述***的运行状态信息，所述运行状态信息包括所述***中的 CPU的平均负载值； A status detection unit, used to obtain the operating status information of the system, where the operating status information includes the average load value of the CPU in the system;

数量分析单元，用于根据所述平均负载值获取所述参与分区的节点数量。 A quantity analysis unit, configured to obtain the number of nodes participating in the partition according to the average load value.

15、根据权利要求 14 所述的划分节点分区的装置，其特征在于，所述数量分析单元，还用于检测所述平均负载值所在的区间，并将与所述区间相对应的预设值确定为所述参与分区的节点数量。 15. The device for dividing node partitions according to claim 14, characterized in that the quantity analysis unit is also used to detect the interval in which the average load value is located, and set the preset value corresponding to the interval Determine the number of nodes participating in the partition.

16、根据权利要求 1 3 所述的划分节点分区的装置，其特征在于，所述数量确定模块包括： 16. The device for dividing node partitions according to claim 13, characterized in that: The quantity determination module includes:

数量信息接收单元，用于根据所述数量信息获取所述参与分区的节点数量。 A quantity information receiving unit, configured to obtain the number of nodes participating in the partition according to the quantity information.

17、根据权利要求 13 所述的划分节点分区的装置，其特征在于，所述***中的每一个 CPU与其他 CPU之间通过快速互联通道 QP I相连，所述分析模块包括： 17. The device for dividing node partitions according to claim 13, characterized in that each CPU in the system is connected to other CPUs through a fast interconnection channel QPI, and the analysis module includes:

总量确定单元，用于确定组成所述***的节点总数量 M; The total amount determination unit is used to determine the total number M of nodes that make up the system;

分组单元，用于根据 M和所述参与分区的节点数量 N, 获取种分区组合，其中在每一组分区组合中包括了 N个节点，这 N个节点为组成所述***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点； A grouping unit, used to obtain a partition combination based on M and the number N of nodes participating in the partition, where each group of partition combinations includes N nodes, and these N nodes are among the M nodes that make up the system. part of , and each partition combination includes nodes that are different from other partition combinations;

统计单元，用于根据所述连接信息，获取每一种分区组合中的最大 QPI 跳数； A statistical unit, used to obtain the maximum number of QPI hops in each partition combination based on the connection information;

选择单元，用于将最大 QPI跳数最小的分区组合确定为所述分区方案。 A selection unit is used to determine the partition combination with the smallest maximum QPI hop count as the partition scheme.

18、根据权利要求 17 所述的划分节点分区的装置，其特征在于，所述分析模块还包括： 18. The device for dividing node partitions according to claim 17, characterized in that the analysis module further includes:

识别信息检测单元，用于若最大 QP I跳数最小的分区组合有至少二种，则检测是否存在识别信息； The identification information detection unit is used to detect whether there is identification information if there are at least two partition combinations with the smallest maximum QPI hop count;

所述选择单元，还用于若存在识别信息，则将所述识别信息所指定的分区组合确定为所述分区方案。 The selection unit is also configured to, if identification information exists, determine the partition combination specified by the identification information as the partition scheme.

19、根据权利要求 13 所述的划分节点分区的装置，其特征在于，所述装置还包括： 19. The device for dividing node partitions according to claim 13, characterized in that the device further includes:

分区模块，用于在确定分区方案后，根据所确定的分区方案对所述系统进行分区。 The partitioning module is used to partition the system according to the determined partitioning scheme after determining the partitioning scheme.

20、根据权利要求 13 所述的划分节点分区的装置，其特征在于，所述装置还包括： 20. The device for dividing node partitions according to claim 13, characterized in that the device further includes:

接收模块，用于在确定分区方案后，检测是否接收到触发信息；所述分区模块，还用于若接收到所述触发信息，则根据所确定的分区方案对所述***进行分区。 The receiving module is used to detect whether trigger information is received after determining the partition plan; The partition module is also configured to partition the system according to the determined partition scheme if the trigger information is received.

21、根据权利要求 1 7或 1 9所述的划分节点分区的装置，其特征在于，还包括： 21. The device for dividing node partitions according to claim 17 or 19, further comprising:

所述状态检测单元，还用于在对所述***进行分区后，获取所述*** 中当前的平均负载值； The status detection unit is also used to obtain the current average load value in the system after partitioning the system;

所述选择单元，还用于若所述当前的平均负载值大于所述区间的最大值，则将 C^⁺¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案； The selection unit is also configured to determine the partition combination with the smallest maximum QPI hop count among C^ ⁺¹ partition combinations as a new partition scheme if the current average load value is greater than the maximum value of the interval;

所述分区模块，还用于根据所述新分区方案对所述***进行分区。 The partition module is also used to partition the system according to the new partition scheme.

22、根据权利要求 21 所述的划分节点分区的方法，其特征在于，所述新分区方案包括所述***当前所使用的分区中的节点。 22. The method of dividing node partitions according to claim 21, characterized in that the new partition scheme includes nodes in the partition currently used by the system.

2 3、根据权利要求 1 7或 1 9所述的划分节点分区的装置，其特征在于，在对所述***进行分区后，还包括： 23. The device for dividing node partitions according to claim 17 or 19, characterized in that, after partitioning the system, it further includes:

所述选择单元，还用于若所述当前的平均负载值小于所述区间的最小值，则将 C^— ¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案； The selection unit is also configured to determine the partition combination with the smallest maximum QPI hop count among C^ ^-1 partition combinations as a new partition scheme if the current average load value is less than the minimum value of the interval;

24、根据权利要求 2 3 所述的划分节点分区的方法，其特征在于，所述***当前所使用的分区包括所述新分区方案中的节点。 24. The method of dividing node partitions according to claim 23, wherein the partition currently used by the system includes nodes in the new partition scheme.

25、一种划分服务器分区服务器的设备，其特征在于，包括：处理器、存储器、输入设备，其中： 25. A device for dividing a server into partitioned servers, characterized in that it includes: a processor, a memory, and an input device, wherein:

所述处理器从所述存储器或所述输入设备，获取***的拓朴结构和参与分区的节点数量，所述***包括至少三个节点，每一个节点包括至少二个 CPU , 再根据所述***的拓朴结构，确定连接信息，所述连接信息包括：在所述***中的每一个 CPU与其他 CPU之间的连接关系，最后根据所述参与分区的节点数量和所述连接信息确定分区方案，其中，在所述分区方案中的节点的数目为所述参与分区的节点数量。 The processor obtains the topology structure of the system and the number of nodes participating in the partition from the memory or the input device. The system includes at least three nodes, each node includes at least two CPUs, and then according to the system The topology structure of , determines the connection information, and the connection information includes: The connection relationship between each CPU and other CPUs in the system, and finally determine the partition plan according to the number of nodes participating in the partition and the connection information, where the number of nodes in the partition plan is Describe the number of nodes participating in the partition.

26、根据权利要求 25 所述的划分节点分区的服务器，其特征在于，所述处理器获取参与分区的节点数量包括： 26. The server for dividing node partitions according to claim 25, characterized in that, the processor obtaining the number of nodes participating in the partition includes:

所述处理器获取所述***的运行状态信息，所述运行状态信息包括所述***中的 CPU的平均负载值，再根据所述平均负载值获取所述参与分区的节点数量。 The processor obtains the running status information of the system, the running status information includes the average load value of the CPU in the system, and then obtains the number of nodes participating in the partition based on the average load value.

27、根据权利要求 26 所述的划分节点分区的服务器，其特征在于，所述处理器根据所述平均负载值获取所述参与分区的节点数量包括：所述处理器检测所述平均负载值所在的区间，并从所述存储器中获取与所述区间相对应的预设值，并将该预设值确定为所述参与分区的节点数量。 27. The server for dividing node partitions according to claim 26, characterized in that, the processor obtaining the number of nodes participating in the partition according to the average load value includes: the processor detecting where the average load value is located interval, obtain a preset value corresponding to the interval from the memory, and determine the preset value as the number of nodes participating in the partition.

28、根据权利要求 25 所述的划分节点分区的服务器，其特征在于，所述处理器获取参与分区的节点数量包括： 28. The server for dividing node partitions according to claim 25, characterized in that, the processor obtaining the number of nodes participating in the partition includes:

所述处理器通过所述输入设备接收数量信息，并根据所述数量信息获取所述参与分区的节点数量。 The processor receives quantity information through the input device, and obtains the number of nodes participating in the partition according to the quantity information.

29、根据权利要求 25 所述的划分节点分区的服务器，其特征在于，所述***中的每一个 CPU与其他 CPU之间通过快速互联通道 QP I相连，所述处理器根据所述参与分区的节点数量和所述连接信息确定分区方案包括： 29. The server for dividing node partitions according to claim 25, characterized in that each CPU in the system is connected to other CPUs through a fast interconnection channel QPI, and the processor participates in the partition according to the The number of nodes and the connection information determine the partitioning scheme including:

所述处理器确定组成所述***的节点总数量 M , 再根据 M和所述参与分区的节点数量 N , 获取种分区组合，其中在每一组分区组合中包括了 N个节点，这 N个节点为组成所述***的 M个节点中的一部分，并且每一种分区组合都包括了与其他的分区组合不相同的节点，之后根据所述连接信息，获取每一种分区组合中的最大 QP I跳数，最后将最大 QP I跳数最小的分区组合确定为所述分区方案。 The processor determines the total number M of nodes that make up the system, and then obtains a partition combination based on M and the number N of nodes participating in the partition, where each group of partition combinations includes N nodes, and these N The node is part of the M nodes that make up the system, and each partition combination includes nodes that are different from other partition combinations. Then, based on the connection information, the maximum QP in each partition combination is obtained. I hop count, and finally the partition combination with the smallest maximum QPI I hop count is determined as the partition scheme.

30、根据权利要求 29 所述的划分节点分区的服务器，其特征在于，还包括： 30. The server for dividing node partitions according to claim 29, further comprising:

若最大 QP I跳数最小的分区组合有至少二种，则所述处理器检测是否存在识别信息，所述识别信息由所述处理器通过所述输入设备获取，或由所述处理器从所述存储器中获取； If there are at least two partition combinations with the smallest maximum QPI hop count, the processor detects whether there is identification information. The identification information is obtained by the processor through the input device, or is obtained by the processor from all obtained from the above memory;

若存在识别信息，则所述处理器将所述识别信息所指定的分区组合确定为所述分区方案。 If identification information exists, the processor determines the partition combination specified by the identification information as the partition scheme.

31、根据权利要求 25 所述的划分节点分区的服务器，其特征在于，还包括： 31. The server for dividing node partitions according to claim 25, further comprising:

所述处理器在确定分区方案后，根据所确定的分区方案对所述***进行分区。 After determining the partition plan, the processor partitions the system according to the determined partition plan.

32、根据权利要求 25 所述的划分节点分区的服务器，其特征在于，还包括： 32. The server for dividing node partitions according to claim 25, further comprising:

在确定分区方案后，所述处理器检测是否通过所述输入设备接收到触发信息； After determining the partition scheme, the processor detects whether trigger information is received through the input device;

若所述输入设备接收到所述触发信息，则所述处理器根据所确定的分区方案对所述***进行分区。 If the input device receives the trigger information, the processor partitions the system according to the determined partition scheme.

33、根据权利要求 29或 31所述的划分节点分区的服务器，其特征在于，还包括： 33. The server for dividing node partitions according to claim 29 or 31, further comprising:

所述处理器在对所述***进行分区后，获取所述***中当前的平均负载值； After partitioning the system, the processor obtains the current average load value in the system;

若所述当前的平均负载值大于所述区间的最大值，则所述处理器将 ^CU⁺¹种分区组合中，最大 QP I跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 If the current average load value is greater than the maximum value of the interval, the processor determines the partition combination with the smallest maximum QPI hop count among ^C U ^{+ 1} partition combinations as the new partition scheme, and based on the The new partitioning scheme partitions the system.

34、根据权利要求 33 所述的划分节点分区的方法，其特征在于，所述新分区方案包括所述***当前所使用的分区中的节点。 34. The method of dividing node partitions according to claim 33, characterized in that the new partition scheme includes nodes in the partition currently used by the system.

35、根据权利要求 29或 31所述的划分节点分区的服务器，其特征在于，还包括： 35. The server for dividing node partitions according to claim 29 or 31, characterized in that For, also includes:

若所述当前的平均负载值小于所述区间的最小值，则所述处理器将 C^— ¹种分区组合中，最大 QPI跳数最小的分区组合确定为新分区方案，并根据所述新分区方案对所述***进行分区。 If the current average load value is less than the minimum value of the interval, the processor determines the partition combination with the smallest maximum QPI hop count among C^ ^-1 partition combinations as a new partition scheme, and determines the partition combination according to the new partition combination. A partitioning scheme partitions the system.

36、根据权利要求 35 所述的划分节点分区的方法，其特征在于，所述***当前所使用的分区包括所述新分区方案中的节点。 36. The method of dividing node partitions according to claim 35, characterized in that the partition currently used by the system includes nodes in the new partition scheme.