A large-scale storage cluster expansion grouping method and device

Through automatic grouping and node allocation strategies, the expansion process of large-scale storage clusters is simplified, and the complexity of users manually specifying subclusters and virtual IP configurations is solved, and the expansion efficiency and cluster balance are improved, ensuring high availability and operation and maintenance are ensured. efficiency.

CN115695166BActive Publication Date: 2025-01-07CHINA ELECTRONICS CLOUD DIGITAL INTELLIGENCE TECH CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202211355992.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-11-01
Publication Date
2025-01-07
Estimated Expiration
2042-11-01

AI Technical Summary

Technical Problem

During the expansion of large-scale storage clusters, users need to manually specify the subclusters that nodes join and configure virtual IP, resulting in complex expansion processes and uneven cluster pressures, affecting user experience and operational efficiency.

Method used

Through automatic grouping policy, parse the storage node information selected by the user, initialize the grouping sequence, add nodes in IP order, set the upper limit value of the grouping nodes, automatically traverse and allocate nodes, update the distributed configuration file, and avoid users manually specifying subclusters and Virtual IP configuration.

Benefits of technology

Simplify capacity expansion operations, improve cluster capacity expansion efficiency and pressure balance, ensure sustainable services in grouping scenarios, and no user intervention is required to configure virtual IP, which improves operation and maintenance efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115695166B_ABST
    Figure CN115695166B_ABST
Patent Text Reader

Abstract

The present invention relates to the technical field of cluster expansion, and provides a large-scale storage cluster expansion grouping method and device. The method of the present invention comprises: parsing the storage node information selected by the user, initializing a grouping sequence, and sequentially adding the storage nodes to the grouping sequence in IP order; setting the grouping node upper limit, traversing the existing groups in the traversal order, obtaining the information of the current grouping, judging whether the number of nodes in the current grouping has reached the grouping node upper limit, and judging whether to traverse the next grouping or perform node addition processing on the current grouping according to the judgment result; after completing the traversal of the existing groups, comparing the number of remaining nodes to be grouped in the grouping sequence with the grouping node upper limit, and grouping the remaining nodes to be grouped in the grouping sequence according to the comparison result; and updating the grouping information in the distributed configuration file. The present invention can improve the efficiency of cluster expansion grouping.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of cluster expansion, and in particular to a large-scale storage cluster expansion grouping method and device. Background Art

[0002] In the expansion scenario of a large-scale storage cluster, if you are adding a storage node, you need to specify the subcluster to which the newly added storage node will join. If you are adding a management node for a subcluster, you also need to configure a virtual IP to ensure high availability.

[0003] The above process has the following deficiencies: 1. When adding a node, the user needs to specify which subcluster to join, which complicates the expansion process. If the number of nodes added to the subcluster is too different, it will cause uneven pressure on the cluster and reduce the overall operational efficiency. 2. Because the sub-management node carries the management and control tasks of the subcluster, the user needs to intervene and plan a new virtual IP when adding the node. The expansion process in this scenario is complicated, affecting the user experience.

[0004] Therefore, how to provide a method to improve the capacity expansion efficiency and user experience of large-scale storage clusters has become a technical problem that needs to be solved urgently. Summary of the invention

[0005] In view of this, the present invention mainly solves the problem of providing a large-scale storage cluster expansion grouping method, which frees users from the heavy expansion configuration process and improves the efficiency of large-scale storage cluster expansion grouping.

[0006] In one aspect, the present invention provides a large-scale storage cluster expansion grouping method, comprising:

[0007] Parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order;

[0008] Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the group nodes, and decide whether to traverse the next group or add nodes to the current group according to the judgment result;

[0009] After the existing grouping is traversed, the number of remaining nodes to be grouped in the grouping sequence is compared with the upper limit of the grouping nodes, and the remaining nodes to be grouped in the grouping sequence are grouped according to the comparison result;

[0010] Update the grouping information in the distributed configuration file.

[0011] Furthermore, in the large-scale storage cluster expansion grouping method of the present invention, the grouping node upper limit is set, the existing groups are traversed in ascending order according to the number of nodes in the group, the existing groups are traversed in the traversal order, the information of the current group is obtained, and it is determined whether the number of nodes in the current group has reached the grouping node upper limit. According to the determination result, it is determined whether to traverse the next group or to add nodes to the current group, including:

[0012] If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group;

[0013] If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated.

[0014] Furthermore, in the large-scale storage cluster expansion grouping method of the present invention, if the number of nodes in the current group does not reach the upper limit of the grouping nodes, the number of remaining nodes to be grouped in the grouping sequence is compared with the number of vacancies in the current grouping nodes, and nodes are selected from the grouping sequence to be added to the current group according to the comparison result, and the next group is traversed, including:

[0015] If the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping node, select nodes in the grouping sequence in turn according to the number of vacancies in the current grouping node to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping node, and then traverse to the next group;

[0016] If the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping node, the remaining nodes to be grouped in the grouping sequence are added to the current grouping, and the next grouping is traversed.

[0017] Furthermore, in the large-scale storage cluster expansion grouping method of the present invention, after completing the traversal of the existing groups, the number of remaining nodes to be grouped in the grouping sequence is compared with the upper limit of the grouping nodes, and the remaining nodes to be grouped in the grouping sequence are grouped according to the comparison result, including:

[0018] If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0019] If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

[0020] In another aspect, the present invention provides a large-scale storage cluster expansion grouping device, comprising:

[0021] A grouping sequence building module is used to parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order;

[0022] The traversal grouping module is used to set the upper limit of grouping nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the grouping nodes, and determine whether to traverse the next group or add nodes to the current group according to the judgment result;

[0023] A grouping reconstruction module is used to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes after completing the traversal of the existing groups, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0024] The update module is used to update the group information in the distributed configuration file.

[0025] Furthermore, in the large-scale storage cluster expansion grouping device of the present invention, the traversal grouping module is used to:

[0026] Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, and determine whether the number of nodes in the current group has reached the upper limit of the group nodes;

[0027] If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group;

[0028] If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated.

[0029] Furthermore, in the large-scale storage cluster expansion grouping device of the present invention, the traversal grouping module is used for:

[0030] When the number of nodes in the current grouping does not reach the upper limit of the grouping nodes, compare the number of remaining nodes to be grouped in the grouping sequence with the number of vacancies in the current grouping nodes;

[0031] If the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping node, select nodes in the grouping sequence in turn according to the number of vacancies in the current grouping node to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping node, and then traverse to the next group;

[0032] If the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping node, the remaining nodes to be grouped in the grouping sequence are added to the current grouping, and the next grouping is traversed.

[0033] Furthermore, in the large-scale storage cluster expansion grouping device of the present invention, the reconstruction grouping module is specifically used for:

[0034] If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0035] If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

[0036] Furthermore, the present invention provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed, the above method is performed.

[0037] Finally, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above method when executing the program.

[0038] A large-scale storage cluster expansion grouping method and device of the present invention has the following beneficial effects:

[0039] 1. Through the automatic grouping strategy, users do not need to specify the subcluster to join when adding nodes, making the expansion operation of large-scale clusters simpler and improving the expansion efficiency. At the same time, the number of nodes between groups will be considered when adding nodes, making the pressure on the cluster more balanced.

[0040] 2. The control strategy of automatically adding the expansion node to the unified management service ensures that each group can provide services to the outside world even in a fault scenario. This control strategy does not require user intervention for configuration and does not require the use of additional virtual IP addresses, thereby improving the efficiency of operation and maintenance. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0042] Figure 1 The present invention is a flowchart of a large-scale storage cluster expansion grouping method according to an exemplary first embodiment of the present invention.

[0043] Figure 2 This is an architectural diagram of a large-scale storage cluster expansion grouping device according to an exemplary second embodiment of the present invention. DETAILED DESCRIPTION

[0044] The embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0045] It should be noted that the following embodiments and features in the embodiments may be combined with each other in the absence of conflict; and, based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without making any creative work are within the scope of protection of the present disclosure.

[0046] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein may be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present disclosure, it should be understood by those skilled in the art that an aspect described herein may be implemented independently of any other aspect, and two or more of these aspects may be combined in various ways. For example, any number of aspects described herein may be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein may be used to implement this device and / or practice this method.

[0047] Figure 1 FIG. 1 is a flow chart of a large-scale storage cluster expansion grouping method according to an exemplary first embodiment of the present invention. Figure 1 As shown, the method of this embodiment includes:

[0048] Parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order;

[0049] Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the group nodes, and decide whether to traverse the next group or add nodes to the current group according to the judgment result;

[0050] After the existing grouping is traversed, the number of remaining nodes to be grouped in the grouping sequence is compared with the upper limit of the grouping nodes, and the remaining nodes to be grouped in the grouping sequence are grouped according to the comparison result;

[0051] Update the grouping information in the distributed configuration file.

[0052] In the method of this embodiment, an upper limit value of grouping nodes is set, and a traversal order is generated for existing groups according to the number of nodes in the group from small to large. The existing groups are traversed in the traversal order, and information of the current group is obtained. It is determined whether the number of nodes in the current group has reached the upper limit value of the grouping nodes. According to the determination result, it is determined whether to traverse the next group or to add nodes to the current group, including:

[0053] If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated.

[0054] If the number of nodes in the current group does not reach the upper limit of the grouping nodes, compare the number of remaining nodes to be grouped in the grouping sequence with the number of vacancies in the current grouping nodes, select nodes from the grouping sequence to add to the current group according to the comparison result, and traverse the next group, specifically including: if the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping nodes, select nodes in the grouping sequence in turn according to the number of vacancies in the current grouping nodes to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping nodes, and traverse the next group;

[0055] If the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping node, the remaining nodes to be grouped in the grouping sequence are added to the current grouping, and the next grouping is traversed.

[0056] In the method of this embodiment, after the existing group traversal is completed, the number of remaining nodes to be grouped in the group sequence is compared with the upper limit of the group node, and the remaining nodes to be grouped in the group sequence are grouped according to the comparison result, including:

[0057] If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0058] If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

[0059] The method of this embodiment uses an automatic grouping strategy to avoid the need for users to specify sub-clusters to join when adding nodes, making the expansion operation in large-scale clusters simpler and improving the expansion efficiency. At the same time, adding nodes will take into account the number of nodes between groups, making the pressure on the cluster more balanced. The control strategy of automatically adding the expanded nodes to the unified management service ensures that each group can provide services to the outside world in a fault scenario, and the control strategy does not require user intervention for configuration, nor does it require the occupation of additional virtual IPs, thereby improving the efficiency of operation and maintenance.

[0060] Figure 2 FIG. 1 is an architecture diagram of a large-scale storage cluster expansion grouping device according to an exemplary second embodiment of the present invention. Figure 2 As shown, the device of this embodiment includes:

[0061] A grouping sequence building module is used to parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order;

[0062] The traversal grouping module is used to set the upper limit of grouping nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the grouping nodes, and determine whether to traverse the next group or add nodes to the current group according to the judgment result;

[0063] A grouping reconstruction module is used to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes after completing the traversal of the existing groups, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0064] The update module is used to update the group information in the distributed configuration file.

[0065] In practical applications, the traversal grouping module of the device of this embodiment is used to:

[0066] Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, and determine whether the number of nodes in the current group has reached the upper limit of the group nodes;

[0067] If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated;

[0068] If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group;

[0069] Specifically, when the number of nodes in the current grouping does not reach the upper limit of the grouping nodes, compare the number of remaining nodes to be grouped in the grouping sequence with the number of vacancies in the current grouping nodes; if the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping nodes, select nodes in the grouping sequence in sequence according to the number of vacancies in the current grouping nodes to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping nodes, and traverse to the next group; if the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping nodes, add the remaining nodes to be grouped in the grouping sequence to the current group, and traverse to the next group.

[0070] In practical applications, the reconstruction grouping module of the device of this embodiment is specifically used for:

[0071] If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result;

[0072] If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

[0073] The present invention provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed, the steps of a large-scale storage cluster expansion grouping method are executed.

[0074] Finally, the present invention provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a large-scale storage cluster expansion grouping method when executing the program.

[0075] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed by the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A large-scale storage cluster expansion grouping method, characterized in that: The method comprises: Parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order; Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the group nodes, and decide whether to traverse the next group or add nodes to the current group according to the judgment result; After the existing grouping is traversed, the number of remaining nodes to be grouped in the grouping sequence is compared with the upper limit of the grouping nodes, and the remaining nodes to be grouped in the grouping sequence are grouped according to the comparison result; Update the grouping information in the distributed configuration file.

2. The large-scale storage cluster expansion grouping method according to claim 1, characterized in that: Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the group nodes, and decide whether to traverse the next group or add nodes to the current group according to the judgment result, including: If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group; If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated.

3. The large-scale storage cluster expansion grouping method according to claim 2, characterized in that: If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group, including: If the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping node, select nodes in the grouping sequence in turn according to the number of vacancies in the current grouping node to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping node, and then traverse to the next group; If the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping node, the remaining nodes to be grouped in the grouping sequence are added to the current grouping, and the next grouping is traversed.

4. The large-scale storage cluster expansion grouping method according to claim 1, characterized in that: After the existing grouping is traversed, the number of remaining nodes to be grouped in the grouping sequence is compared with the upper limit of the grouping nodes, and the remaining nodes to be grouped in the grouping sequence are grouped according to the comparison result, including: If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result; If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

5. A large-scale storage cluster expansion grouping device, characterized in that: The device comprises: A grouping sequence building module is used to parse the storage node information selected by the user, initialize a grouping sequence, and add the storage nodes to the grouping sequence in sequence according to the IP order; The traversal grouping module is used to set the upper limit of grouping nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, determine whether the number of nodes in the current group has reached the upper limit of the grouping nodes, and determine whether to traverse the next group or add nodes to the current group according to the judgment result; A grouping reconstruction module is used to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes after completing the traversal of the existing groups, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result; The update module is used to update the group information in the distributed configuration file.

6. The large-scale storage cluster expansion grouping device according to claim 5, characterized in that: Traverse the grouping module for: Set the upper limit of group nodes, generate a traversal order for the existing groups according to the number of nodes in the group from small to large, traverse the existing groups according to the traversal order, obtain the information of the current group, and determine whether the number of nodes in the current group has reached the upper limit of the group nodes; If the number of nodes in the current group does not reach the upper limit of the group node, compare the number of remaining nodes to be grouped in the group sequence with the number of vacancies in the current group node, select nodes from the group sequence to add to the current group according to the comparison result, and traverse the next group; If the number of nodes in the current group has reached the upper limit of the group nodes, the traversal of the existing group is terminated.

7. The large-scale storage cluster expansion grouping device according to claim 5 or 6, characterized in that: The traversal grouping module is used to: When the number of nodes in the current grouping does not reach the upper limit of the grouping nodes, compare the number of remaining nodes to be grouped in the grouping sequence with the number of vacancies in the current grouping nodes; If the number of remaining nodes to be grouped in the grouping sequence is not less than the number of vacancies in the current grouping node, select nodes in the grouping sequence in turn according to the number of vacancies in the current grouping node to add to the current group until the number of nodes in the current group reaches the upper limit of the grouping node, and then traverse to the next group; If the number of remaining nodes to be grouped in the grouping sequence is less than the number of vacancies in the current grouping node, the remaining nodes to be grouped in the grouping sequence are added to the current grouping, and the next grouping is traversed.

8. The large-scale storage cluster expansion grouping device according to claim 5, characterized in that: Reconstruct the grouping module, specifically for: If the number of remaining nodes to be grouped in the grouping sequence is not less than the upper limit of the grouping nodes, select nodes in the grouping sequence in sequence according to the upper limit of the grouping nodes to form a new group, increase the group number by one, continue to compare the number of remaining nodes to be grouped in the grouping sequence with the upper limit of the grouping nodes, and group the remaining nodes to be grouped in the grouping sequence according to the comparison result; If the number of remaining nodes to be grouped in the grouping sequence is less than the upper limit, the remaining nodes to be grouped in the grouping sequence are formed into a new group, and the group number is increased by one.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed, the method according to any one of claims 1 to 4 is performed.

10. A computer device, characterized in that: The computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the method according to any one of claims 1 to 4 when executing the program.

Citation Information

Patent Citations

  • Expansion method and equipment for memory database distributed cluster

    CN113868335A