CN108769118B - Method and device for selecting master nodes in distributed system - Google Patents
Method and device for selecting master nodes in distributed system Download PDFInfo
- Publication number
- CN108769118B CN108769118B CN201810367597.1A CN201810367597A CN108769118B CN 108769118 B CN108769118 B CN 108769118B CN 201810367597 A CN201810367597 A CN 201810367597A CN 108769118 B CN108769118 B CN 108769118B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- target
- distributed system
- priority level
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000012163 sequencing technique Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 4
- 238000004891 communication Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1051—Group master selection mechanisms
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a method and a device for selecting a master node in a distributed system, wherein the method is applied to any node in the distributed system, and comprises the following steps: acquiring authorized information sent by at least one target node, wherein the target node is a node of which the performance parameter value is not less than a preset value in a distributed system; and when the condition of reselecting the main node is met, determining the main node from the target nodes which send the authorized information, wherein the priority level of the main node in the target nodes is the highest. In the implementation of the invention, only the node with the authority as the master node can send the authorized information to other nodes, and the node without the authority as the master node can not send the authorized information to other nodes, so the communication times of the whole system are reduced, and simultaneously, the master node is selected from the nodes with the authority as the master node, and the selection speed of the master node is accelerated only by comparing the priority levels of all the nodes.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a method and a device for selecting a master node in a distributed system.
Background
With the rapid development of internet technology, the application range of distributed systems is wider and wider. The distributed system is a cluster system which is composed of a plurality of autonomous computers as nodes through a communication network, and the distributed system can be used as a server side to provide data for clients. In a distributed system, one node is usually selected as a master node (master), and the other nodes in the system are selected as slave nodes (slave). The access request sent by the client usually needs to be sent to the master node first, and then the master node issues the access request to the slave nodes, and the slave nodes execute specific tasks. Response information generated by the slave node executing the task also needs to be sent to the client through the master node. When the slave node finds that the slave node cannot normally communicate with the master node, a new master node needs to be selected, and therefore response information is sent to the client through the new master node.
In a distributed system, each node typically sends its own performance parameters, such as resource usage, to all other nodes at a fixed period. When a node needs to select a new master node, a node with better performance parameters can be selected from the system as the master node according to the performance parameters of all the nodes.
However, the master node selection method requires that each node sends the performance parameters to all other nodes according to a fixed period, which causes more communication times and wastes network resources. And each node needs to calculate and determine a new master node according to the performance parameters of all the nodes, the performance parameters may include various types of parameters, the calculation is complex, and the overall performance of the system is also influenced to a certain extent. Meanwhile, the time for selecting a new master node is also longer due to the complex calculation.
Disclosure of Invention
In order to solve the problems in the prior art, embodiments of the present invention provide a method and an apparatus for selecting a master node in a distributed system. The technical scheme is as follows:
in a first aspect, a method for selecting a master node in a distributed system is provided, where the method is applied to any node in the distributed system, and the method includes:
acquiring authorized information sent by at least one target node, wherein the target node is a node of which the performance parameter value is not less than a preset value in a distributed system;
and when the condition of reselecting the main node is met, determining the main node from the target nodes which send the authorized information, wherein the priority level of the main node in the target nodes is the highest.
Optionally, before the obtaining of the authorized information sent by the at least one target node, the method includes:
and acquiring the priority level sent by each node in the distributed system, wherein the priority level of each node is a preset numerical value or a numerical value calculated according to preset configuration parameters and a preset algorithm of the node.
Optionally, after obtaining the priority level sent by each node in the distributed system and before obtaining the authorized information sent by the at least one target node, the method further includes:
and determining the node with the highest priority level in the distributed system as a main node.
Optionally, after obtaining the priority level sent by each node in the distributed system and before obtaining the authorized information sent by the at least one target node, the method further includes:
and sequencing the nodes according to the priority levels of the nodes to obtain a node list.
Optionally, after obtaining the authorized information sent by the at least one target node, the method includes:
marking each target node in the node list with an authorized identifier according to the authorized information;
and when the condition of reselecting the main node is met, searching the nodes with the highest priority level in the node list in sequence, and determining the first searched node marked with the right identifier as the main node.
In a second aspect, an apparatus for selecting a master node in a distributed system is provided, where the apparatus includes:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring authorized information sent by at least one target node, and the target node is a node of which the performance parameter value in a distributed system is not less than a preset value;
and the determining unit is used for determining the master node from the target nodes which send the authorized information when the condition of reselecting the master node is met, wherein the priority level of the master node in the target nodes is the highest.
Optionally, the obtaining unit is further configured to:
and acquiring the priority level sent by each node in the distributed system, wherein the priority level of each node is a preset numerical value or a numerical value calculated according to preset configuration parameters and a preset algorithm of the node.
Optionally, the determining unit is further configured to determine a node with a highest priority level in the distributed system as a master node.
Optionally, the apparatus further comprises: and the sequencing unit is used for sequencing the nodes according to the priority levels of the nodes to obtain a node list.
Optionally, the apparatus further comprises a marking unit;
the marking unit is used for marking each target node in the node list with a right identifier according to the right information;
and the determining unit is used for searching in sequence from the node with the highest priority level in the node list when the condition of reselecting the main node is met, and determining the searched node marked with the right identifier as the main node.
In the implementation of the invention, only the node with the authority as the master node can send the authorized information to other nodes, and the node without the authority as the master node can not send the authorized information to other nodes, so the communication times of the whole system are reduced, and simultaneously, the master node is selected from the nodes with the authority as the master node, and the selection speed of the master node is accelerated only by comparing the priority levels of all the nodes.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced 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 schematic diagram of a network framework of a distributed system according to an embodiment of the present invention;
fig. 2 is a flowchart of a method for selecting a master node in a distributed system according to an embodiment of the present invention;
fig. 3 is a flowchart of a method for selecting a master node in a distributed system according to an embodiment of the present invention;
fig. 4 is a block diagram of a selecting apparatus of a master node in a distributed system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
Fig. 1 is a schematic diagram of a network framework of a distributed system according to an embodiment of the present invention. The distributed system may include a plurality of nodes, each node being connected to another node via a network, and the nodes may be computers. A client may be networked to multiple nodes in a distributed system that may act as a server side to provide data to the client. When a client accesses data in the distributed system, the client can send access requests to the master node or the slave nodes, and some access requests sent by the client can directly respond through the slave nodes, and some access requests can only respond through the master node. When the access request sent by the client needs to be responded only through the master node, as described in the background art, the master node issues the access request sent by the client to the slave nodes, the slave nodes execute specific tasks, and the slave nodes send response information to the client through the master node. And when the slave node finds that the slave node cannot normally communicate with the master node, determining that the master node fails, and reselecting the master node. In a specific implementation, each slave node in the distributed system may send a test signal to the master node according to a fixed period to determine that the master node can normally communicate. When the slave node detects that it does not respond after sending the test signal, it can be determined that the master node has failed.
Referring to fig. 2, it is a flowchart of a method for selecting a master node in a distributed system according to an embodiment of the present invention, where the method may be applied to any node in the distributed system, and the method may specifically include the following steps.
In a specific implementation, each node in the distributed system may calculate its own performance parameter value, and the performance parameter value may be calculated according to the resource usage. The resource usage may include usage of CPU resources, memory resources, disk space, and the like. It should be noted that, the embodiment of the present invention does not specifically limit the algorithm of the performance parameter value. When the performance parameter value of the node is not less than the preset value, the node can be determined to have the authority of serving as the main node. Each node having the authority to be the master node, i.e., the target node, may transmit the authority information to all nodes except the node itself in the distributed system at a fixed period. The authorized information may be any information capable of indicating that its sending node has the authority to serve as the master node, such as an Internet Protocol (IP) address of the node sending the authorized information, or a preset identifier, etc.
It should be noted that, when the node a acquires the authorized information sent by the target node, if the performance parameter value of the node a is not less than the preset value, the target node also includes the node a.
And when any node finds that the current master node cannot normally communicate, the master node is reselected.
In the distributed system starting stage, each node can calculate the priority level according to the preset configuration parameters and the preset algorithm of the node. The preset configuration parameter may adopt an IP address or a Media Access Control (MAC) address, etc. For example, the value of the IP address may be calculated according to an Algorithm of Message-Digest Algorithm 5 (MD 5) to obtain an MD5 value corresponding to the IP address, and the MD5 value may be used as the priority level of the node. For example, the format of the MD5 value may be 38b8c2c1093dd0fec383a9d9ac 940515. The priority level of each node may also be a preset value, such as a preset code for each node. Of course, the priority level of each node may also be a numerical value calculated according to a preset code and a preset algorithm. It should be noted that, the algorithm of the priority level is not specifically limited in the embodiment of the present invention. After each node calculates its own priority level, it may send its own priority level to all other nodes in the system, so that each node can obtain the priority levels of all nodes, and each node may determine the node with the highest priority level in the distributed system as the master node. That is, during the distributed system startup phase, any node may determine the node with the highest priority level in the distributed system as the master node.
Therefore, before step 201, any node may obtain the priority level sent by each node in the distributed system, where the priority level of each node is a preset value or a value calculated according to a preset configuration parameter and a preset algorithm of the node. That is, each node in the distributed system may acquire and store the priority levels of all other nodes, so that when the master node is reselected, the node can determine the priority level of each target node that sends the entitled information according to the pre-stored priority levels.
It should be noted that, a target node having a right as a master node may send the right information at a fixed period, so when reselecting the master node, the master node is determined according to the right information obtained last time. The right information sent by each target node can comprise the priority level of the target node, so that the master node can be directly determined according to the level of each priority level. The authorized information sent by each target node can also comprise the IP address of the target node, so that when the main node is reselected, the corresponding priority level is directly calculated according to each IP address, and the main node is determined according to the level of each priority level.
In the implementation of the invention, only the node with the authority as the master node can send the authorized information to other nodes, and the node without the authority as the master node can not send the authorized information to other nodes, so the communication times of the whole system are reduced, and simultaneously, the master node is selected from the nodes with the authority as the master node, and the selection speed of the master node is accelerated only by comparing the priority levels of all the nodes.
Referring to fig. 3, a flowchart of a method for selecting a master node in another distributed system is provided in an embodiment of the present invention, where the method may be applied to any node in the distributed system, and the method may include the following steps.
And 302, sequencing the nodes according to the priority levels of the nodes to obtain a node list.
This list of nodes is now illustrated. For example, the distributed system includes a node a, a node B, and a node C, the priority level of the node a is higher than that of the node B, the priority level of the node B is higher than that of the node C, and the right information acquired last time is information sent by the node B and the node C. In this case, the node list that can be obtained is as follows:
node list:
| priority level | Node name | Whether or not it has the right |
| 1 | Node A | Is free of |
| 2 | Node B | Is provided with |
| 3 | Node C | Is provided with |
And 305, when the condition of reselecting the master node is met, searching the nodes with the highest priority level in the node list in sequence, and determining the first searched node marked with the authorized identifier as the master node.
If the nodes in the node list are sorted in order of priority level from high to low, the search may be started from the first node in the node list when the master node is reselected. For example, the node list in the above example, may start with node a, find that node a does not have a token, and continue to search downward. The node B may be determined to be the primary node when the node B is found to be marked with a valid identity.
It should be noted that, the embodiment of the present invention has many similarities or similarities with the embodiment shown in fig. 2, and the same or similar parts may refer to the embodiment shown in fig. 2, and the embodiment of the present invention is not repeated.
In the embodiment of the invention, each node in the node list is sorted according to the priority level, after receiving the authorized information each time, the node which needs to be marked with the authorized identifier in the node list is re-determined according to the authorized information, when the master node is reselected, the node can be searched according to the existing sorting, and the searched node which is marked with the authorized identifier is determined as the master node, so that the priority level of the target node is not required to be determined according to the authorized information when the master node is determined, and then the highest priority level is searched from all the priority levels.
Referring to fig. 4, a block diagram of a structure of a selecting apparatus for a master node in a distributed system according to an embodiment of the present invention is shown, where the apparatus may be configured in a node or be the node itself, and the apparatus may specifically include: an acquisition unit 401 and a determination unit 402.
The obtaining unit 401 is configured to obtain authorized information sent by at least one target node, where the target node is a node whose performance parameter value is not less than a preset value in a distributed system.
A determining unit 402, configured to determine a master node from target nodes that transmit the authorized information when a condition for reselecting the master node is satisfied, where a priority level of the master node is highest in the target nodes.
Preferably, in the distributed system startup phase, the obtaining unit is further configured to: and acquiring the priority level sent by each node in the distributed system, wherein the priority level of each node is a preset numerical value or a numerical value calculated according to preset configuration parameters and a preset algorithm of the node.
The determining unit is further configured to determine a node with a highest priority level in the distributed system as a master node.
Preferably, the apparatus may further comprise a sorting unit and a marking unit.
The sorting unit is used for sorting the nodes according to the priority levels of the nodes to obtain a node list.
And the marking unit is used for marking the authorized identification of each target node in the node list according to the authorized information.
A determining unit 402, configured to, when a condition for reselecting a master node is satisfied, sequentially search for nodes from the node with the highest priority level in the node list, and determine a node marked with a right identifier as a master node.
In the implementation of the invention, only the node with the authority as the master node can send the authorized information to other nodes, and the node without the authority as the master node can not send the authorized information to other nodes, so the communication times of the whole system are reduced, and simultaneously, the master node is selected from the nodes with the authority as the master node, and the selection speed of the master node is accelerated only by comparing the priority levels of all the nodes.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (6)
1. A method for selecting a master node in a distributed system is applied to any node in the distributed system, and the method comprises the following steps:
acquiring a priority level sent by each node in the distributed system, wherein the priority level of each node is a preset numerical value or a numerical value calculated according to a preset configuration parameter and a preset algorithm of the node;
determining the node with the highest priority level in the distributed system as a main node; each node in the distributed system acquires and stores the priority levels of all other nodes, so that when the master node is reselected, each node determines the priority level of each target node which sends the authorized information according to the pre-stored priority level;
acquiring authorized information sent by at least one target node, wherein the target node is a node of which the performance parameter value in the distributed system is not less than a preset value, the performance parameter of the target node is obtained by calculating the performance parameter of each node, and whether the target node has the authority of serving as a main node or not is determined according to the performance parameter;
and when the condition of reselecting the main node is met, determining the main node from the target nodes which send the authorized information, wherein the target nodes send the authorized information to other target nodes according to a fixed period, and determining the main node according to the authorized information obtained at the last time, wherein the priority level of the main node in the target nodes is the highest.
2. The method of claim 1, wherein after obtaining the priority level sent by each node in the distributed system and before obtaining the authorized information sent by at least one target node, the method further comprises:
and sequencing the nodes according to the priority levels of the nodes to obtain a node list.
3. The method of claim 2, wherein after obtaining the authorized information sent by the at least one target node, the method comprises:
marking each target node in the node list with an authorized identifier according to the authorized information;
and when the condition of reselecting the main node is met, searching the nodes with the highest priority level in the node list in sequence, and determining the first searched node marked with the right identifier as the main node.
4. An apparatus for selecting a master node in a distributed system, the apparatus comprising:
the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring authorized information sent by at least one target node, the target node is a node of which the performance parameter value in a distributed system is not less than a preset value, the performance parameter of the target node is obtained by calculating the performance parameter of each node, and whether the target node has the authority of being used as a main node or not is determined according to the performance parameter; acquiring a priority level sent by each node in the distributed system, wherein the priority level of each node is a preset numerical value or a numerical value calculated according to a preset configuration parameter and a preset algorithm of the node;
a determining unit, configured to determine a node with a highest priority level in the distributed system as a master node; when the condition of reselecting the main node is met, determining the main node from the target nodes which send the authorized information, wherein the target nodes send the authorized information to other target nodes according to a fixed period, and determining the main node according to the authorized information obtained at the last time, wherein the priority level of the main node in the target nodes is the highest;
each node in the distributed system acquires and stores the priority levels of all other nodes, so that when the master node is reselected, each node determines the priority level of each target node which sends the authorized information according to the pre-stored priority level.
5. The apparatus of claim 4, wherein the apparatus further comprises:
and the sequencing unit is used for sequencing the nodes according to the priority levels of the nodes to obtain a node list.
6. The apparatus of claim 5, further comprising a marking unit;
the marking unit is used for marking each target node in the node list with a right identifier according to the right information;
and the determining unit is used for searching in sequence from the node with the highest priority level in the node list when the condition of reselecting the main node is met, and determining the searched node marked with the right identifier as the main node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810367597.1A CN108769118B (en) | 2018-04-23 | 2018-04-23 | Method and device for selecting master nodes in distributed system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810367597.1A CN108769118B (en) | 2018-04-23 | 2018-04-23 | Method and device for selecting master nodes in distributed system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108769118A CN108769118A (en) | 2018-11-06 |
| CN108769118B true CN108769118B (en) | 2022-01-21 |
Family
ID=64011528
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810367597.1A Expired - Fee Related CN108769118B (en) | 2018-04-23 | 2018-04-23 | Method and device for selecting master nodes in distributed system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108769118B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110048898A (en) * | 2019-05-14 | 2019-07-23 | 威创集团股份有限公司 | A kind of distribution joined screen system method for realizing redundancy and device |
| CN111694657A (en) * | 2020-04-29 | 2020-09-22 | 五八有限公司 | Load balancing processing method and device, electronic equipment and storage medium |
| CN112596893B (en) * | 2020-11-23 | 2021-10-08 | 中标慧安信息技术股份有限公司 | Monitoring method and system for multi-node edge computing device |
| CN114301927B (en) * | 2021-12-28 | 2024-04-26 | 杭州安恒信息安全技术有限公司 | Main node selection method, device and medium in distributed system |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651691A (en) * | 2009-08-31 | 2010-02-17 | 中兴通讯股份有限公司 | Network system, access equipment and application layer service assess method |
| CN104468163A (en) * | 2013-09-18 | 2015-03-25 | 腾讯科技（北京）有限公司 | Method and device for disaster tolerant network construction, and disaster tolerant network |
| CN104580338A (en) * | 2013-10-29 | 2015-04-29 | 华为技术有限公司 | Service processing method, system and equipment |
| CN104601365A (en) * | 2014-12-05 | 2015-05-06 | 杭州华三通信技术有限公司 | Monitoring method and device for node device |
| CN106878382A (en) * | 2016-12-29 | 2017-06-20 | 北京华为数字技术有限公司 | Dynamically change the method and device of cluster scale in a kind of distributed arbitration program cluster |
| CN106911728A (en) * | 2015-12-22 | 2017-06-30 | 华为技术服务有限公司 | The choosing method and device of host node in distributed system |
| WO2017131783A1 (en) * | 2016-01-29 | 2017-08-03 | Hewlett Packard Enterprise Development Lp | Managing groups of servers |
| CN107247729A (en) * | 2017-05-03 | 2017-10-13 | 中国银联股份有限公司 | A kind of document handling method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10298461B2 (en) * | 2016-05-10 | 2019-05-21 | Motorola Mobility Llc | System and method for determining a master device in a neighborhood aware network |
-
2018
- 2018-04-23 CN CN201810367597.1A patent/CN108769118B/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651691A (en) * | 2009-08-31 | 2010-02-17 | 中兴通讯股份有限公司 | Network system, access equipment and application layer service assess method |
| CN104468163A (en) * | 2013-09-18 | 2015-03-25 | 腾讯科技（北京）有限公司 | Method and device for disaster tolerant network construction, and disaster tolerant network |
| CN104580338A (en) * | 2013-10-29 | 2015-04-29 | 华为技术有限公司 | Service processing method, system and equipment |
| CN104601365A (en) * | 2014-12-05 | 2015-05-06 | 杭州华三通信技术有限公司 | Monitoring method and device for node device |
| CN106911728A (en) * | 2015-12-22 | 2017-06-30 | 华为技术服务有限公司 | The choosing method and device of host node in distributed system |
| WO2017131783A1 (en) * | 2016-01-29 | 2017-08-03 | Hewlett Packard Enterprise Development Lp | Managing groups of servers |
| CN106878382A (en) * | 2016-12-29 | 2017-06-20 | 北京华为数字技术有限公司 | Dynamically change the method and device of cluster scale in a kind of distributed arbitration program cluster |
| CN107247729A (en) * | 2017-05-03 | 2017-10-13 | 中国银联股份有限公司 | A kind of document handling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108769118A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108769118B (en) | Method and device for selecting master nodes in distributed system | |
| CN106982236B (en) | Information processing method, device and system | |
| JP6435398B2 (en) | Method and system for facilitating terminal identifiers | |
| US9225586B2 (en) | Automatic expansion method, management device, management system | |
| US20160105323A1 (en) | Node identification using clusters | |
| CN110730250B (en) | Information processing method and device, service system and storage medium | |
| CN107547635B (en) | Method and device for modifying IP address of large data cluster host | |
| CN111163173A (en) | Cluster configuration method and device, server and readable storage medium | |
| CN108509296B (en) | Method and system for processing equipment fault | |
| CN113535262A (en) | Method, device, equipment and storage medium for controlling starting of proxy node | |
| CN111092956A (en) | Resource synchronization method, device, storage medium and equipment | |
| CN110798492B (en) | Data storage method and device and data processing system | |
| CN109344202B (en) | Data synchronization method and management node | |
| CN111147226B (en) | Data storage method, device and storage medium | |
| CN111625264A (en) | Method, device, equipment and medium for upgrading multi-level management system | |
| CN115981670A (en) | Container cluster service deployment method, device, server and storage medium | |
| CN115118635A (en) | Time delay detection method, device, equipment and storage medium | |
| CN110661655B (en) | Cluster deployment method and system, electronic device and storage medium | |
| CN112306962B (en) | File copying method, device and storage medium in computer cluster system | |
| CN112905699A (en) | Full data comparison method, device, equipment and storage medium | |
| CN111400250B (en) | Resource acquisition method, device, equipment and storage medium | |
| CN110868340A (en) | Testing method and device, reconfigurable tester and controller | |
| CN111464395A (en) | Method and device for creating block chain and readable storage medium | |
| US8825901B2 (en) | Distributed parallel discovery | |
| CN105978865B (en) | application package name verification method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20220121 |