CN115695166A - Large-scale storage cluster capacity expansion grouping method and device - Google Patents

Large-scale storage cluster capacity expansion grouping method and device Download PDF

Info

Publication number
CN115695166A
CN115695166A CN202211355992.0A CN202211355992A CN115695166A CN 115695166 A CN115695166 A CN 115695166A CN 202211355992 A CN202211355992 A CN 202211355992A CN 115695166 A CN115695166 A CN 115695166A
Authority
CN
China
Prior art keywords
grouping
nodes
sequence
current
upper limit
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.)
Pending
Application number
CN202211355992.0A
Other languages
Chinese (zh)
Inventor
潘阳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CLP Cloud Digital Intelligence Technology Co Ltd
Original Assignee
CLP Cloud Digital Intelligence Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by CLP Cloud Digital Intelligence Technology Co Ltd filed Critical CLP Cloud Digital Intelligence Technology Co Ltd
Priority to CN202211355992.0A priority Critical patent/CN115695166A/en
Publication of CN115695166A publication Critical patent/CN115695166A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to the technical field of cluster capacity expansion, and provides a method and a device for large-scale storage cluster capacity expansion grouping, wherein the method comprises the following steps: analyzing the information of the storage nodes selected by the user, initializing a grouping sequence, and sequentially adding the storage nodes to the grouping sequence according to the IP sequence; setting an upper limit value of a grouping node, traversing the existing grouping according to a traversal sequence, acquiring information of the current grouping, judging whether the number of nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select to traverse the next grouping or perform node adding processing on the current grouping according to a judgment result; after traversing the existing groups, comparing the number of the nodes to be grouped in the group sequence with the upper limit value of the group nodes, and grouping the nodes to be grouped in the group sequence according to the comparison result; and updating grouping information in the distributed configuration file. The invention can improve the efficiency of cluster capacity expansion grouping.

Description

Large-scale storage cluster capacity expansion grouping method and device
Technical Field
The invention relates to the technical field of cluster capacity expansion, in particular to a method and a device for large-scale storage cluster capacity expansion grouping.
Background
In the large-scale storage cluster expansion scene, if a storage node is added, a user needs to specify a sub-cluster to which the newly added storage node is added, and if the storage node is a management node for adding the sub-cluster, a virtual IP (Internet protocol) is also needed to be configured to ensure high availability.
In the above flow, there are the following disadvantages: 1. the addition of the nodes requires a user to specify which sub-cluster to add, which brings complexity of the capacity expansion process, and if the number of the nodes added to the sub-clusters is too large, the pressure of the clusters is unbalanced, which reduces the overall operation effectiveness 2.
Therefore, how to provide a method for improving the capacity expansion efficiency and the user experience of the large-scale storage cluster becomes a technical problem to be solved urgently.
Disclosure of Invention
In view of this, the present invention mainly provides a large-scale storage cluster capacity expansion grouping method, which frees a user from a heavy capacity expansion configuration process and improves the large-scale storage cluster capacity expansion grouping efficiency.
In one aspect, the present invention provides a large-scale storage cluster capacity expansion grouping method, including:
analyzing the information of the storage nodes selected by the user, initializing a grouping sequence, and sequentially adding the storage nodes to the grouping sequence according to the IP sequence;
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select traversing the next grouping or adding the nodes to the current grouping according to a judgment result;
after traversing the existing groups, comparing the number of the nodes to be grouped in the group sequence with the upper limit value of the group nodes, and grouping the nodes to be grouped in the group sequence according to the comparison result;
updating grouping information in the distributed configuration file.
Furthermore, in the large-scale storage cluster capacity expansion grouping method of the present invention, an upper limit value of the grouping nodes is set, a traversal sequence is generated for the existing grouping from small to large according to the number of the nodes in the grouping, the existing grouping is traversed according to the traversal sequence, information of the current grouping is obtained, whether the number of the nodes in the current grouping reaches the upper limit value of the grouping nodes is judged, and the next grouping is selected to be traversed or node addition processing is performed on the current grouping according to the judgment result, which includes:
if the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the nodes in the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping;
and if the number of nodes in the current packet reaches the upper limit value of the packet node, finishing traversing the existing packet.
Further, in the large-scale storage cluster capacity expansion grouping method of the present invention, if the number of nodes in the current grouping does not reach the upper limit value of the grouping nodes, the number of the nodes to be grouped remaining in the grouping sequence is compared with the number of the nodes in the current grouping, the nodes are selected from the grouping sequence according to the comparison result to join in the current grouping, and the next grouping is traversed, including:
if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacant nodes of the current grouping node, sequentially selecting the nodes from the grouping sequence according to the number of the vacant nodes of the current grouping node to join the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping;
and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping and traversing the next grouping.
Further, in the large-scale storage cluster capacity expansion grouping method of the present invention, after traversing the existing groups, comparing the number of the nodes to be grouped remaining in the group sequence with the upper limit value of the group nodes, and grouping the nodes to be grouped remaining in the group sequence according to the comparison result, the method includes:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the serial number of the group.
In another aspect, the present invention provides a large-scale storage cluster capacity expansion grouping apparatus, including:
the grouping sequence construction module is used for analyzing the storage node information selected by the user, initializing a grouping sequence and sequentially adding the storage nodes into the grouping sequence according to the IP sequence;
the traversal grouping module is used for setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping from small to large according to the number of the nodes in the grouping, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select to traverse the next grouping or perform node adding processing on the current grouping according to the judgment result;
the packet reconstruction module is used for comparing the number of the nodes to be grouped which remain in the packet sequence with the upper limit value of the packet nodes after traversing the existing packets, and grouping the nodes to be grouped which remain in the packet sequence according to the comparison result;
and the updating module is used for updating the grouping information in the distributed configuration file.
Further, in the large-scale storage cluster capacity-expansion grouping apparatus of the present invention, the traversal grouping module is configured to:
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of the nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, and judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node;
if the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the vacant nodes of the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping;
and if the number of the nodes in the current packet reaches the upper limit value of the packet node, ending the traversal of the existing packet.
Further, in the large-scale storage cluster capacity-expansion grouping apparatus of the present invention, the traversal grouping module is configured to:
when the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped which remain in the grouping sequence with the number of the vacant nodes of the current grouping nodes;
if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacancy of the current grouping node, sequentially selecting the nodes in the grouping sequence according to the number of the vacancy of the current grouping node to add into the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping;
and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping, and traversing the next grouping.
Further, in the large-scale storage cluster capacity expansion grouping device of the present invention, the reconstruction grouping module is specifically configured to:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the serial number of the group.
Furthermore, the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed, performs the above-described method.
Finally, the invention provides a computer device comprising a memory, a processor and a computer program stored on said memory and executable on said processor, said processor implementing the steps of the above method when executing said program.
The invention discloses a large-scale storage cluster capacity expansion grouping method and a device, which have the following beneficial effects:
1. through the automatic grouping strategy, the situation that a user needs to designate an added sub-cluster when adding nodes is avoided, the capacity expansion operation under a large-scale cluster is simpler, the capacity expansion efficiency is improved, and meanwhile, the number of nodes among groups is considered by adding the nodes, so that the pressure of the cluster is more balanced.
2. The management and control strategy of the unified management service is automatically added through the capacity expansion node, so that each group can also provide service to the outside under a fault scene, the management and control strategy is configured without intervention of a user, an extra virtual IP is not occupied, and the operation and maintenance efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart illustrating a large-scale storage cluster capacity expansion grouping method according to an exemplary first embodiment of the present invention.
FIG. 2 is a diagram illustrating an architecture of a large-scale storage cluster capacity expansion grouping apparatus according to a second exemplary embodiment of the present invention
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
It should be noted that, in the case of no conflict, the features in the following embodiments and examples may be combined with each other; moreover, all other embodiments that can be derived by one of ordinary skill in the art from the embodiments disclosed herein without making any creative effort fall within the scope of the present disclosure.
It is noted that various aspects of the embodiments are described below within the scope of the appended claims. It should be apparent that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the disclosure, one skilled in the art should appreciate that one aspect described herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented and/or a method practiced using any number of the aspects set forth herein. Additionally, such an apparatus may be implemented and/or such a method may be practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.
Fig. 1 is a flowchart of a large-scale storage cluster capacity expansion grouping method according to an exemplary first embodiment of the present invention, and as shown in fig. 1, the method of this embodiment includes:
analyzing the information of the storage nodes selected by the user, initializing a grouping sequence, and sequentially adding the storage nodes to the grouping sequence according to the IP sequence;
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of the nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select to traverse the next grouping or perform node adding processing on the current grouping according to the judgment result;
after traversing the existing groups, comparing the number of the nodes to be grouped in the group sequence with the upper limit value of the group nodes, and grouping the nodes to be grouped in the group sequence according to the comparison result;
and updating grouping information in the distributed configuration file.
In the method of this embodiment, setting an upper limit value of a packet node, generating a traversal order from small to large for an existing packet according to the number of nodes in the packet, traversing the existing packet according to the traversal order, acquiring information of a current packet, determining whether the number of nodes in the current packet has reached the upper limit value of the packet node, and determining to select to traverse a next packet or perform node addition processing on the current packet according to a determination result, includes:
and if the number of nodes in the current packet reaches the upper limit value of the packet node, finishing traversing the existing packet.
If the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the nodes in the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping, wherein the method specifically comprises the following steps: if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacancy of the current grouping node, sequentially selecting the nodes in the grouping sequence according to the number of the vacancy of the current grouping node to add into the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping;
and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping, and traversing the next grouping.
In the method of this embodiment, after traversing an existing packet, comparing the number of nodes to be grouped remaining in the packet sequence with the upper limit value of the packet node, and grouping the nodes to be grouped remaining in the packet sequence according to the comparison result, the method includes:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the serial number of the group.
According to the method, through an automatic grouping strategy, the situation that a user needs to designate an added sub-cluster when adding the nodes is avoided, the capacity expansion operation under a large-scale cluster is simpler, the capacity expansion efficiency is improved, meanwhile, the number of the inter-group nodes is considered when adding the nodes, and the pressure of the cluster is more balanced. The management and control strategy of the unified management service is automatically added through the capacity expansion node, so that each group can also provide service to the outside under a fault scene, the management and control strategy is configured without intervention of a user, an extra virtual IP is not occupied, and the operation and maintenance efficiency is improved.
Fig. 2 is an architecture diagram of a large-scale storage cluster capacity expansion grouping apparatus according to an exemplary second embodiment of the present invention, as shown in fig. 2, the apparatus of this embodiment includes:
the grouping sequence construction module is used for analyzing the storage node information selected by the user, initializing a grouping sequence and sequentially adding the storage nodes into the grouping sequence according to the IP sequence;
the traversal grouping module is used for setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping from small to large according to the number of the nodes in the grouping, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select to traverse the next grouping or perform node adding processing on the current grouping according to the judgment result;
the packet reconstruction module is used for comparing the number of the nodes to be grouped which remain in the packet sequence with the upper limit value of the packet nodes after traversing the existing packets, and grouping the nodes to be grouped which remain in the packet sequence according to the comparison result;
and the updating module is used for updating the grouping information in the distributed configuration file.
In practical applications, the traversal grouping module of the apparatus of this embodiment is configured to:
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of the nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, and judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node;
if the number of the nodes in the current packet reaches the upper limit value of the packet nodes, ending traversing the existing packet;
if the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the nodes in the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping;
specifically, when the number of nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of nodes to be grouped remaining in the grouping sequence with the number of vacant nodes of the current grouping; if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacancy of the current grouping node, sequentially selecting the nodes in the grouping sequence according to the number of the vacancy of the current grouping node to add into the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping; and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping and traversing the next grouping.
In practical applications, the packet rebuilding module of the apparatus of this embodiment is specifically configured to:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the serial number of the group.
The present invention provides a computer readable storage medium having stored thereon a computer program which, when executed, performs the steps of a large scale storage cluster capacity-extension grouping method.
Finally, the invention provides a computer device comprising a memory, a processor and a computer program stored on said memory and executable on said processor, said processor implementing the steps of the large scale storage cluster capacity-extension grouping method when executing said program.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are also within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (10)

1. A method for large-scale storage cluster capacity expansion grouping, the method comprising:
analyzing the information of the storage nodes selected by the user, initializing a grouping sequence, and sequentially adding the storage nodes to the grouping sequence according to the IP sequence;
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select traversing the next grouping or adding the nodes to the current grouping according to a judgment result;
after traversing the existing packets, comparing the number of the nodes to be grouped remaining in the packet sequence with the upper limit value of the packet nodes, and grouping the nodes to be grouped remaining in the packet sequence according to the comparison result;
and updating grouping information in the distributed configuration file.
2. The large-scale storage cluster capacity expansion grouping method according to claim 1, wherein a grouping node upper limit value is set, a traversal sequence is generated from the small to the large of the number of the existing grouping nodes according to the grouping node, the existing grouping nodes are traversed according to the traversal sequence, information of the current grouping node is obtained, whether the number of the grouping nodes in the current grouping node reaches the grouping node upper limit value is judged, and whether to traverse the next grouping node or perform node addition processing on the current grouping node is judged according to the judgment result, and the method comprises the following steps:
if the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the vacant nodes of the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping;
and if the number of the nodes in the current packet reaches the upper limit value of the packet node, ending the traversal of the existing packet.
3. The large-scale storage cluster capacity expansion grouping method according to claim 2, wherein if the number of nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of nodes to be grouped remaining in the grouping sequence with the number of nodes in the current grouping sequence, selecting nodes from the grouping sequence according to the comparison result to join the current grouping, and traversing the next grouping, comprising:
if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacancy of the current grouping node, sequentially selecting the nodes in the grouping sequence according to the number of the vacancy of the current grouping node to add into the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping;
and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping, and traversing the next grouping.
4. The large-scale storage cluster capacity expansion grouping method according to claim 1, wherein after traversing the existing groups, the method compares the number of the nodes to be grouped remaining in the group sequence with the upper limit value of the group nodes, and groups the nodes to be grouped remaining in the group sequence according to the comparison result, and comprises:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the number of the group.
5. An apparatus for large scale storage cluster capacity expansion grouping, the apparatus comprising:
the grouping sequence construction module is used for analyzing the storage node information selected by the user, initializing a grouping sequence and sequentially adding the storage nodes into the grouping sequence according to the IP sequence;
the traversal grouping module is used for setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping from small to large according to the number of the nodes in the grouping, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node, and judging to select to traverse the next grouping or perform node adding processing on the current grouping according to the judgment result;
the packet reconstruction module is used for comparing the number of the nodes to be grouped which remain in the packet sequence with the upper limit value of the packet nodes after traversing the existing packets, and grouping the nodes to be grouped which remain in the packet sequence according to the comparison result;
and the updating module is used for updating the grouping information in the distributed configuration file.
6. The large-scale storage cluster capacity grouping apparatus of claim 5, wherein the traversal grouping module is configured to:
setting an upper limit value of a grouping node, generating a traversal sequence of the existing grouping according to the number of the nodes in the grouping from small to large, traversing the existing grouping according to the traversal sequence, acquiring the information of the current grouping, and judging whether the number of the nodes in the current grouping reaches the upper limit value of the grouping node;
if the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the nodes in the current grouping, selecting the nodes from the grouping sequence according to the comparison result, adding the nodes into the current grouping, and traversing the next grouping;
and if the number of nodes in the current packet reaches the upper limit value of the packet node, finishing traversing the existing packet.
7. The large-scale storage cluster capacity grouping apparatus of claim 5 or 6, wherein the traverse grouping module is configured to:
when the number of the nodes in the current grouping does not reach the upper limit value of the grouping nodes, comparing the number of the nodes to be grouped remaining in the grouping sequence with the number of the vacant nodes of the current grouping;
if the number of the nodes to be grouped remaining in the grouping sequence is not less than the number of the vacancy of the current grouping node, sequentially selecting the nodes in the grouping sequence according to the number of the vacancy of the current grouping node to add into the current grouping until the number of the nodes of the current grouping reaches the upper limit value of the grouping node, and traversing the next grouping;
and if the number of the nodes to be grouped remaining in the grouping sequence is less than the number of the vacant nodes of the current grouping, adding the nodes to be grouped remaining in the grouping sequence into the current grouping, and traversing the next grouping.
8. The large-scale storage cluster capacity expansion grouping apparatus of claim 5, wherein the rebuild grouping module is specifically configured to:
if the number of the nodes to be grouped remaining in the grouping sequence is not smaller than the upper limit value of the grouping nodes, sequentially selecting the nodes in the grouping sequence according to the upper limit value of the grouping nodes to form a new group, adding one to the number of the group, continuously comparing the number of the nodes to be grouped remaining in the grouping sequence with the upper limit value of the grouping nodes, and grouping the nodes to be grouped remaining in the grouping sequence according to the comparison result;
and if the number of the nodes to be grouped remaining in the grouping sequence is smaller than the upper limit value, forming a new group by the nodes to be grouped remaining in the grouping sequence, and adding one to the serial number of the group.
9. A computer-readable storage medium, having stored thereon a computer program which, when executed, performs the method of any one of claims 1-4.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method of any one of claims 1 to 4 when executing the program.
CN202211355992.0A 2022-11-01 2022-11-01 Large-scale storage cluster capacity expansion grouping method and device Pending CN115695166A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211355992.0A CN115695166A (en) 2022-11-01 2022-11-01 Large-scale storage cluster capacity expansion grouping method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211355992.0A CN115695166A (en) 2022-11-01 2022-11-01 Large-scale storage cluster capacity expansion grouping method and device

Publications (1)

Publication Number Publication Date
CN115695166A true CN115695166A (en) 2023-02-03

Family

ID=85048459

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211355992.0A Pending CN115695166A (en) 2022-11-01 2022-11-01 Large-scale storage cluster capacity expansion grouping method and device

Country Status (1)

Country Link
CN (1) CN115695166A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107547469A (en) * 2016-06-24 2018-01-05 中兴通讯股份有限公司 A kind of information processing method and terminal
CN110363330A (en) * 2019-06-17 2019-10-22 中国平安财产保险股份有限公司 A kind of paths planning method, device, computer equipment and readable storage medium storing program for executing
CN111598486A (en) * 2020-06-09 2020-08-28 拉扎斯网络科技(上海)有限公司 Task grouping method, platform, server and storage medium
CN113868335A (en) * 2021-09-15 2021-12-31 威讯柏睿数据科技(北京)有限公司 Method and equipment for expanding distributed clusters of memory database

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107547469A (en) * 2016-06-24 2018-01-05 中兴通讯股份有限公司 A kind of information processing method and terminal
CN110363330A (en) * 2019-06-17 2019-10-22 中国平安财产保险股份有限公司 A kind of paths planning method, device, computer equipment and readable storage medium storing program for executing
CN111598486A (en) * 2020-06-09 2020-08-28 拉扎斯网络科技(上海)有限公司 Task grouping method, platform, server and storage medium
CN113868335A (en) * 2021-09-15 2021-12-31 威讯柏睿数据科技(北京)有限公司 Method and equipment for expanding distributed clusters of memory database

Similar Documents

Publication Publication Date Title
CN110688377B (en) Method and device for updating state Merck tree
CN112738820B (en) Dynamic deployment method and device of service function chain and computer equipment
CN111880936B (en) Resource scheduling method, device, container cluster, computer equipment and storage medium
JP4750457B2 (en) Data overlay, self-organizing metadata overlay and application level multicasting
JP2019513259A (en) Method and apparatus for expanding high availability server cluster
US8923113B2 (en) Optimizations in multi-destination tree calculations for layer 2 link state protocols
KR20140027518A (en) Method and apparatus for assignment of virtual resources within a cloud environment
CN110659284A (en) Block sequencing method and system based on tree graph structure and data processing terminal
CN109800058A (en) A kind of virtual machine Autonomic Migration Framework method
JP2017500816A (en) Traffic engineering for large data center networks
CN105827678A (en) High-availability framework based communication method and node
US9391875B2 (en) Resource oriented dependency graph for network configuration
CN115695166A (en) Large-scale storage cluster capacity expansion grouping method and device
CN111984196B (en) File migration method, device, equipment and readable storage medium
CN112506648A (en) Traffic stateless migration method of virtual network function instance and electronic equipment
CN112527450A (en) Super-fusion self-adaption method, terminal and system based on different resources
CN112486664A (en) Node capacity expansion method, system, terminal and storage medium
CN111901448B (en) CTDB virtual IP balance distribution method for cluster node fault scene
CN111866069A (en) Data processing method and device
CN107104829B (en) Physical equipment matching distribution method and device based on network topology data
CN105373451A (en) Virtual machine placement method and apparatus
CN115858250A (en) Data recovery method, device, storage medium and electronic device
CN106897137B (en) Physical machine and virtual machine mapping conversion method based on virtual machine live migration
CN110502582A (en) A kind of on-line rapid estimation method of distributed data base
Liu et al. Edge node data replica management method for distribution Internet of Things

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination