CN112306664A - Service restarting method, system, equipment and medium - Google Patents
Service restarting method, system, equipment and medium Download PDFInfo
- Publication number
- CN112306664A CN112306664A CN202011270454.2A CN202011270454A CN112306664A CN 112306664 A CN112306664 A CN 112306664A CN 202011270454 A CN202011270454 A CN 202011270454A CN 112306664 A CN112306664 A CN 112306664A
- Authority
- CN
- China
- Prior art keywords
- service
- restart
- nodes
- running
- node
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000004590 computer program Methods 0.000 claims description 8
- 230000004044 response Effects 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 7
- 230000009467 reduction Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
- G06F9/44505—Configuring for program initiating, e.g. using registry, configuration files
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Hardware Redundancy (AREA)
Abstract
The invention discloses a service restarting method, which comprises the following steps: acquiring the total number of nodes, the first number of nodes running the service, the second number of redundant nodes and a third number corresponding to the type of the running service; comparing the value of the second quantity to the total quantity, wherein the value is obtained by dividing the first quantity by the third quantity and adding the second quantity; and selecting a corresponding restart strategy according to the comparison result so as to restart the service of each node according to the restart strategy. The invention also discloses a system, a computer device and a readable storage medium. The proposal provided by the invention can restart the service by adopting different methods aiming at different conditions under the condition of not influencing the cluster service, thereby improving the efficiency of service setting to a certain extent and reducing the influence of service reduction caused by long service setting time and service restarting in the setting process.
Description
Technical Field
The present invention relates to the field of service restart, and in particular, to a service restart method, system, device, and storage medium.
Background
In a large-scale distributed storage cluster, service configuration is often involved, and in the process of configuring a service, synchronization of a configuration file and restarting of the service are usually involved, and if services of nodes in the cluster are restarted at the same time, service interruption is caused, so in order to ensure that the service is not interrupted and service performance is not reduced beyond a certain limit, it is a common practice to restart the service node by node after synchronization of the configuration file is completed. However, the large-scale distributed storage cluster often has a large number of nodes, so the serial restart of the CTDB often takes a long time, and a user is in a waiting state for a long time, which results in poor experience.
Disclosure of Invention
In view of the above, in order to overcome at least one aspect of the above problems, an embodiment of the present invention provides a service restart method, including the following steps:
acquiring the total number of nodes, the first number of nodes running the service, the second number of redundant nodes and a third number corresponding to the type of the running service;
comparing the value of the second quantity to the total quantity, wherein the value is obtained by dividing the first quantity by the third quantity and adding the second quantity;
and selecting a corresponding restart strategy according to the comparison result so as to restart the service of each node according to the restart strategy.
In some embodiments, selecting, according to the comparison result, a corresponding restart policy to restart the service of each node according to the restart policy, further includes:
in response to the obtained value being less than the total number, dividing the nodes running the services into a plurality of sets, wherein the types of the services running by the nodes in each set are different;
issuing a restart command to all nodes not running a service and nodes in one of the sets to restart the service;
and issuing a restart command to the nodes in each residual set in turn to restart the service.
In some embodiments, issuing a restart command to all nodes not running traffic to restart the service further comprises:
issuing a restart command to all nodes not operating traffic except the second number of redundant nodes.
In some embodiments, after issuing a restart command to the nodes in each of the remaining sets in turn to restart the service, the method further includes:
and issuing a restart command to the redundant nodes in sequence to enable the redundant nodes to restart the service.
In some embodiments, selecting, according to the comparison result, a corresponding restart policy to restart each node according to the restart policy, further includes:
and responding to the obtained value being larger than the total number, and issuing a restart command to each node in sequence so that each node restarts the service in sequence.
In some embodiments, further comprising:
and responding to the received configuration file after the service update, and sending the updated configuration file to each node.
In some embodiments, restarting the services of each node according to the restart policy further comprises:
restarting the service of each node according to the restart strategy and the updated configuration file.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a service restart system, including:
an acquisition module configured to acquire a total number of nodes, a first number of nodes running a service, a second number of redundant nodes, and a third number corresponding to a type of the running service;
a comparison module configured to compare a value obtained by dividing the first quantity by a quotient of a third quantity plus a second quantity with the total quantity;
and the restarting module is configured to select a corresponding restarting strategy according to the comparison result so as to restart the service of each node according to the restarting strategy.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a computer apparatus, including:
at least one processor; and
a memory storing a computer program operable on the processor, wherein the processor executes the program to perform any of the steps of the service restart method as described above.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a computer-readable storage medium storing a computer program which, when executed by a processor, performs the steps of any one of the service restart methods described above.
The invention has one of the following beneficial technical effects: the proposal provided by the invention can restart the service by adopting different methods aiming at different conditions under the condition of not influencing the cluster service, thereby improving the efficiency of service setting to a certain extent and reducing the influence of service reduction caused by long service setting time and service restarting in the setting process.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art 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 that other embodiments can be obtained by using the drawings without creative efforts.
Fig. 1 is a flowchart illustrating a service restart method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a service restart system according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a computer device provided in an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a computer-readable storage medium 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, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
In an embodiment of the present invention, the service may be a CTDB service (storage high available service).
According to an aspect of the present invention, an embodiment of the present invention provides a service restart method, as shown in fig. 1, which may include the steps of:
s1, acquiring the total number of nodes, the first number of nodes running the service, the second number of redundant nodes and the third number corresponding to the type of the running service;
s2, comparing the value obtained by dividing the first quantity by the third quantity and adding the second quantity with the total quantity;
and S3, selecting a corresponding restart strategy according to the comparison result to restart the service of each node according to the restart strategy.
The proposal provided by the invention can restart the service by adopting different methods aiming at different conditions under the condition of not influencing the cluster service, thereby improving the efficiency of service setting to a certain extent and reducing the influence of service reduction caused by long service setting time and service restarting in the setting process.
In some embodiments, in step S1, the total number of nodes, the first number of nodes running the service, the second number of redundant nodes, and the third number corresponding to the type of the running service are obtained, specifically, all the nodes in the cluster may be classified into 2 types, one type is used as a storage node, and the type of node only provides storage service to the outside and does not provide specific service; the other class is used as a node for providing service to the outside. The nodes which do not provide the service also comprise redundant nodes, and the nodes can ensure that the nodes which provide the service to the outside take over the failed nodes to continue to provide the service to the outside when the nodes which provide the service to the outside fail. The nodes providing the service to the outside may provide different service, and the service provided to the outside by each node may be the same or different. Therefore, the same traffic service can be provided by a plurality of nodes, respectively.
In some embodiments, step S3, according to the comparison result, selecting a corresponding restart policy to restart the service of each node according to the restart policy, further includes:
in response to the obtained value being less than the total number, dividing the nodes running the services into a plurality of sets, wherein the types of the services running by the nodes in each set are different;
issuing a restart command to all nodes not running a service and nodes in one of the sets to restart the service;
and issuing a restart command to the nodes in each residual set in turn to restart the service.
Specifically, when the value obtained by dividing the first number by the third number and adding the second number is smaller than the total number of all the nodes, the nodes capable of running the services are divided into a plurality of sets according to the types of the running services, and the types of the services run by the nodes in each set are different. When restarting, firstly, a restart command is issued to all nodes which do not run the service, namely, the nodes which only provide the storage service to the outside, so as to perform the parallel restart service, and simultaneously, the restart command is issued to the nodes in one set, namely, the nodes of the first batch of restart service comprise all the nodes which do not run the service and a part of the nodes which run the service. If it takes x seconds to restart the service of one node, the same x seconds are taken to restart the service of the first group of nodes at the same time.
And then restarting the service of the rest nodes running the service, namely issuing a restart command to the nodes in each set in sequence to ensure that all the nodes running the service restart the service. Namely, the serial restart service is carried out between the nodes in the same class, and the parallel restart service is carried out between the nodes in different service classes.
In some embodiments, issuing a restart command to all nodes not running traffic to restart the service further comprises:
issuing a restart command to all nodes not operating traffic except the second number of redundant nodes.
In some embodiments, after issuing a restart command to the nodes in each of the remaining sets in turn to restart the service, the method further includes:
and issuing a restart command to the redundant nodes in sequence to enable the redundant nodes to restart the service.
Specifically, when restarting the service of a node that does not run a service, a second number of redundant nodes need to be excluded, and when restarting the service of all the other nodes, the service of the redundant nodes is restarted. Therefore, in the restarting process, when the node providing the service to the outside fails, the node taking over the failure continues to provide the service to the outside.
For example, a cluster includes N nodes in total, the number of nodes running a service is M, the number of nodes not running a service is N, and there are a redundant nodes in the N nodes not running a service. The method comprises the steps that P nodes among M nodes running services can affect an A service, Q nodes can affect a B service, one of the P nodes can be selected, one of the Q nodes is selected to form a set, then one of the P nodes is selected, then one of the Q nodes is selected to form another set, and so on, so that a plurality of sets are obtained. If it takes x seconds to restart the service of one node, the service time taken to restart all the nodes running the traffic remaining may be (M/y-1) × seconds, where y is the number of traffic classes. And finally, restarting the redundant nodes in sequence, wherein if the time for restarting the service of one node is x seconds, the time for restarting all the redundant nodes is a x, so that the total time for restarting is x + a x + (M/y-1) x ═ M/y + a x, namely the time for restarting the service of one node is multiplied by the value obtained by dividing the first number by the third number and adding the second number. Since the value of the first number divided by the third number plus the second number is less than the total number of all nodes, it takes less time than restarting the service node by node.
In some embodiments, selecting, according to the comparison result, a corresponding restart policy to restart each node according to the restart policy, further includes:
and responding to the obtained value being larger than the total number, and issuing a restart command to each node in sequence so that each node restarts the service in sequence.
Specifically, when the value obtained by dividing the first number by the third number and adding the second number is greater than the total number of all nodes, that is, (M/y + a) × is greater than N × x, the service of each node is restarted in a manner of restarting the service node by node.
In some embodiments, further comprising:
and responding to the received configuration file after the service update, and sending the updated configuration file to each node.
In some embodiments, restarting the services of each node according to the restart policy further comprises:
restarting the service of each node according to the restart strategy and the updated configuration file.
Specifically, after the configuration file of the service is updated, the service needs to be restarted, so that the updated configuration file can be sent to each node on the management node, and then after the completion of synchronization is detected, a service restarting mode is selected according to the total number of the nodes, the first number of the nodes running the service, the second number of the redundant nodes and the third number corresponding to the type of the running service, so that the service restarting of each node is completed.
The proposal provided by the invention can restart the service by adopting different methods aiming at different conditions under the condition of not influencing the cluster service, thereby improving the efficiency of service setting to a certain extent and reducing the influence of service reduction caused by long service setting time and service restarting in the setting process.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a service restart system 400, as shown in fig. 2, including:
an obtaining module 401, where the obtaining module 401 is configured to obtain a total number of nodes, a first number of nodes running a service, a second number of redundant nodes, and a third number corresponding to a type of the running service;
a comparison module 402, wherein the comparison module 402 is configured to compare a value obtained by dividing the first number by a quotient of a third number and adding a second number with the total number;
a restarting module 403, wherein the restarting module 403 is configured to select a corresponding restarting policy according to the comparison result to restart the service of each node according to the restarting policy.
Based on the same inventive concept, according to another aspect of the present invention, as shown in fig. 3, an embodiment of the present invention further provides a computer apparatus 501, comprising:
at least one processor 520; and
a memory 510, the memory 510 storing a computer program 511 executable on the processor, the processor 520 executing the program to perform the steps of any of the above-described service restart methods.
Based on the same inventive concept, according to another aspect of the present invention, as shown in fig. 4, an embodiment of the present invention further provides a computer-readable storage medium 601, where the computer-readable storage medium 601 stores computer program instructions 610, and the computer program instructions 610, when executed by a processor, perform the steps of any one of the above service restart methods.
Finally, it should be noted that, as will be understood by those skilled in the art, all or part of the processes of the methods of the above embodiments may be implemented by a computer program to instruct related hardware to implement the methods.
Further, it should be appreciated that the computer-readable storage media (e.g., memory) herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps of implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and 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.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A method for restarting a service, comprising the steps of:
acquiring the total number of nodes, the first number of nodes running the service, the second number of redundant nodes and a third number corresponding to the type of the running service;
comparing the value of the second quantity to the total quantity, wherein the value is obtained by dividing the first quantity by the third quantity and adding the second quantity;
and selecting a corresponding restart strategy according to the comparison result so as to restart the service of each node according to the restart strategy.
2. The method of claim 1, wherein, based on the comparison, selecting a corresponding restart policy to restart the services of each node based on the restart policy, further comprising:
in response to the obtained value being less than the total number, dividing the nodes running the services into a plurality of sets, wherein the types of the services running by the nodes in each set are different;
issuing a restart command to all nodes not running a service and nodes in one of the sets to restart the service;
and issuing a restart command to the nodes in each residual set in turn to restart the service.
3. The method of claim 2, wherein issuing a restart command to all nodes that are not running traffic to restart the service, further comprises:
issuing a restart command to all nodes not operating traffic except the second number of redundant nodes.
4. The method of claim 3, wherein after issuing a restart command to each of the remaining nodes in the set in turn to restart the service, further comprising:
and issuing a restart command to the redundant nodes in sequence to enable the redundant nodes to restart the service.
5. The method of claim 1, wherein, based on the comparison, selecting a corresponding restart policy to restart each node based on the restart policy, further comprising:
and responding to the obtained value being larger than the total number, and issuing a restart command to each node in sequence so that each node restarts the service in sequence.
6. The method of claim 1, further comprising:
and responding to the received configuration file after the service update, and sending the updated configuration file to each node.
7. The method of claim 6, wherein restarting the services of each node according to the restart policy further comprises:
restarting the service of each node according to the restart strategy and the updated configuration file.
8. A service restart system, comprising:
an acquisition module configured to acquire a total number of nodes, a first number of nodes running a service, a second number of redundant nodes, and a third number corresponding to a type of the running service;
a comparison module configured to compare a value obtained by dividing the first quantity by a quotient of a third quantity plus a second quantity with the total quantity;
and the restarting module is configured to select a corresponding restarting strategy according to the comparison result so as to restart the service of each node according to the restarting strategy.
9. A computer device, comprising:
at least one processor; and
memory storing a computer program operable on the processor, wherein the processor executes the program to perform the steps of the method according to any of claims 1-7.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, is adapted to carry out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011270454.2A CN112306664B (en) | 2020-11-13 | 2020-11-13 | Service restarting method, system, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011270454.2A CN112306664B (en) | 2020-11-13 | 2020-11-13 | Service restarting method, system, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112306664A true CN112306664A (en) | 2021-02-02 |
| CN112306664B CN112306664B (en) | 2022-07-08 |
Family
ID=74334924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011270454.2A Active CN112306664B (en) | 2020-11-13 | 2020-11-13 | Service restarting method, system, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112306664B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883004A (en) * | 2009-05-04 | 2010-11-10 | 华为技术有限公司 | Method, device and system for synthesizing service data |
| JP2012108651A (en) * | 2010-11-16 | 2012-06-07 | Hitachi Ltd | Cluster system |
| CN103840955A (en) * | 2012-11-22 | 2014-06-04 | 中国银联股份有限公司 | Operation maintenance system of distributed IT system, and operation maintenance management method thereof |
| CN108009050A (en) * | 2017-11-29 | 2018-05-08 | 郑州云海信息技术有限公司 | A kind of memory node failure restart after service reliability test method and device |
| CN108733466A (en) * | 2017-04-19 | 2018-11-02 | 北京京东尚科信息技术有限公司 | Restart the method, apparatus and equipment of the application system example in distributed system |
-
2020
- 2020-11-13 CN CN202011270454.2A patent/CN112306664B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101883004A (en) * | 2009-05-04 | 2010-11-10 | 华为技术有限公司 | Method, device and system for synthesizing service data |
| JP2012108651A (en) * | 2010-11-16 | 2012-06-07 | Hitachi Ltd | Cluster system |
| CN103840955A (en) * | 2012-11-22 | 2014-06-04 | 中国银联股份有限公司 | Operation maintenance system of distributed IT system, and operation maintenance management method thereof |
| CN108733466A (en) * | 2017-04-19 | 2018-11-02 | 北京京东尚科信息技术有限公司 | Restart the method, apparatus and equipment of the application system example in distributed system |
| CN108009050A (en) * | 2017-11-29 | 2018-05-08 | 郑州云海信息技术有限公司 | A kind of memory node failure restart after service reliability test method and device |
Non-Patent Citations (1)
| Title |
|---|
| 程睿等: "CDCLSAT求解器的重启策略分析", 《计算机辅助设计与图形学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112306664B (en) | 2022-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20140376362A1 (en) | Dynamic client fail-over during a rolling patch installation based on temporal server conditions | |
| US20190173739A1 (en) | Method, device and computer program product for managing distributed system | |
| US7620845B2 (en) | Distributed system and redundancy control method | |
| CN111124289B (en) | Method, device and medium for selecting homing group members of distributed storage system | |
| CN112422320B (en) | Master-slave switching method and device of server and server | |
| WO2009033248A1 (en) | A method for efficient thread usage for hierarchically structured tasks | |
| WO2022134797A1 (en) | Data fragmentation storage method and apparatus, a computer device, and a storage medium | |
| CN109697078B (en) | Repairing method of non-high-availability component, big data cluster and container service platform | |
| US20060282831A1 (en) | Method and hardware node for customized upgrade control | |
| CN104394016A (en) | ISSU (In-Service Software Upgrade) method and system | |
| WO2023071999A1 (en) | User matching method and apparatus, and device and storage medium | |
| CN110941666A (en) | Database multi-activity method and device | |
| WO2023055405A1 (en) | Static and dynamic non-deterministic finite automata tree structure application apparatus and method | |
| CN112306664B (en) | Service restarting method, system, equipment and medium | |
| CN111813606A (en) | Fault-tolerant method, system, equipment and medium for double-node virtual machine | |
| CN109587218B (en) | Cluster election method and device | |
| CN114546978A (en) | Bitmap management method, system, equipment and medium for storage cluster | |
| CN112131201B (en) | Method, system, equipment and medium for high availability of network additional storage | |
| CN114840495A (en) | Database cluster split-brain prevention method, storage medium and device | |
| CN110673793B (en) | Storage device node event management method and system, electronic device and storage medium | |
| CN114090211A (en) | Method and device for coordinating single-task master-slave program and related multi-server system | |
| CN114610545A (en) | Method, system, device and medium for reducing single point of failure of private cloud computing | |
| CN113515357A (en) | Batch task execution method and device in cluster environment | |
| CN111966680A (en) | Database storage expansion method and device | |
| CN111741102A (en) | Upgrading method and device for distributed micro-service application |
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 |