CN114221863B - Intelligent node election method for distributed cluster - Google Patents

Intelligent node election method for distributed cluster Download PDF

Info

Publication number
CN114221863B
CN114221863B CN202210162014.8A CN202210162014A CN114221863B CN 114221863 B CN114221863 B CN 114221863B CN 202210162014 A CN202210162014 A CN 202210162014A CN 114221863 B CN114221863 B CN 114221863B
Authority
CN
China
Prior art keywords
node
execution
information
service
election
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.)
Active
Application number
CN202210162014.8A
Other languages
Chinese (zh)
Other versions
CN114221863A (en
Inventor
胡艳平
蔡鑫莹
舒展
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hunan Yunchang Network Technology Co ltd
Original Assignee
Hunan Yunchang Network Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hunan Yunchang Network Technology Co ltd filed Critical Hunan Yunchang Network Technology Co ltd
Priority to CN202210162014.8A priority Critical patent/CN114221863B/en
Publication of CN114221863A publication Critical patent/CN114221863A/en
Application granted granted Critical
Publication of CN114221863B publication Critical patent/CN114221863B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network

Abstract

The embodiment of the invention relates to the technical field of distributed clusters, and particularly discloses an intelligent node election method for a distributed cluster. The embodiment of the invention automatically loads the node election service when the application is started, regularly inquires the execution node information from the cache center through the node election service, and runs the node election strategy according to the execution node information; acquiring a designated method and a mark annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, and executing processing according to a judgment result. The role of an executor can be added in the multi-application copy of the cluster so as to distinguish the execution authority of the node with the role from other nodes, and the repeated execution of the method is controlled, so that the service scene which can be executed in a single-instance mode can be used in the cluster, the cost is not increased, the occupation of server resources is not increased, and long-time and time-consuming execution service abnormity is not caused.

Description

Intelligent node election method for distributed cluster
Technical Field
The invention belongs to the technical field of distributed clusters, and particularly relates to an intelligent node election method for a distributed cluster.
Background
After the company technology stack is upgraded to Docker + Kubernets, a large number of new functions and new characteristics are used, and especially multi-container cluster deployment is applied. The cluster deployment technology has the advantages of improving the utilization rate of the server, dynamically and transversely expanding the service cluster and the like. However, in a cluster environment, if the design is not correct, non-idempotent services such as timing and snoop services are caused, and the cluster environment is repeatedly executed by a plurality of containers, which causes repeated writing of data, generation of abnormal data, and the like.
At present, an industry method for solving the problems needs to perform secondary design on an original system, divide a timing task or a monitoring service into independent services, deploy independent nodes and call the original service in a micro-service mode. Such processing leads to new problems, such as: the design, research and development and deployment cost is increased, the occupation of server resources is improved, the execution is long, the time-consuming service is abnormal, and the like, and the disaster recovery is not facilitated.
Disclosure of Invention
The embodiment of the invention aims to provide an intelligent node election method for a distributed cluster, and aims to solve the problems in the background art.
In order to achieve the above purpose, the embodiments of the present invention provide the following technical solutions:
an intelligent node election method for a distributed cluster specifically comprises the following steps:
automatically loading a node election service when an application is started, regularly inquiring execution node information from a cache center through the node election service, and operating a node election strategy according to the execution node information;
acquiring a designated method and a mark annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, generating a judgment result, and executing processing according to the judgment result.
As a further limitation of the technical solution of the embodiment of the present invention, automatically loading a node election service when the application is started, periodically querying a cache center for executing node information through the node election service, and running a node election policy according to the executing node information specifically includes the following steps:
automatically loading node election service when the application is started;
inquiring the information of the execution node from the cache center at regular time according to the node election service;
and operating a node election strategy according to the execution node information.
As a further limitation of the technical solution of the embodiment of the present invention, the periodically querying and executing node information from the cache center according to the node election service specifically includes the following steps:
acquiring a synchronous lock according to the node election service;
through the synchronous lock, only the execution node is ensured to process at the same time in the cluster;
and acquiring the execution node information of the execution node from a cache center.
As a further limitation of the technical solution of the embodiment of the present invention, the synchronous lock includes a distributed lock and a plurality of waiting locks.
As a further limitation of the technical solution of the embodiment of the present invention, the running a node election policy according to the executive node information specifically includes the following steps:
if no executing node exists at present, registering the current node as the executing node and updating the reporting time;
if the current node is the main node, only the time for reporting is required to be updated;
and if the current node is not the master node and the reported time exceeds the threshold value, updating the current node as an execution node and updating the reported time, otherwise, not processing.
As a further limitation of the technical solution of the embodiment of the present invention, the acquiring a designation method and a tag annotation executed by an execution node during development, sending execution information to the designation method, calling an execution policy service according to the execution information to determine whether a current node is an execution node, generating a determination result, and performing execution processing according to the determination result specifically includes the following steps:
acquiring a specified method containing a mark annotation during development;
sending execution information to the specified method;
calling an execution policy service according to the execution information to judge whether the current node is an execution node or not and generating a judgment result;
and executing processing according to the judgment result.
As a further limitation of the technical solution of the embodiment of the present invention, the invoking an execution policy service according to the execution information to determine whether the current node is an execution node, and generating a determination result specifically includes the following steps:
calling an execution policy service according to the execution information;
and judging whether the current node is an execution node or not through the execution policy service, and generating a judgment result.
As a further limitation of the technical solution of the embodiment of the present invention, the determining, by the policy enforcement service, whether the current node is an enforcement node, and generating a determination result specifically includes the following steps:
sending information to a cache center to acquire execution node information;
judging whether the current node is an execution node or not according to the node information;
if the current node is an execution node, judging to return yes successfully;
if the current node is not the execution node, continuously judging whether the time for reporting activity exceeds the threshold value, if so, judging that the return is successful, otherwise, judging that the return is failed, and if not, returning no.
As a further limitation of the technical solution of the embodiment of the present invention, the executing process according to the determination result specifically includes the following steps:
if the judgment result is yes, continuing to execute the specified method;
if the judgment result is negative, the designated method is ignored to be executed, log information is generated, and the log information is sent to log service.
As a further limitation of the technical solution of the embodiment of the present invention, the cache center may be replaced with a distributed middleware.
Compared with the prior art, the invention has the beneficial effects that:
the embodiment of the invention automatically loads the node election service when the application is started, regularly inquires the execution node information from the cache center through the node election service, and runs the node election strategy according to the execution node information; acquiring a designated method and a mark annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, and executing processing according to a judgment result. The role of an executor can be added in the multi-application copy of the cluster so as to distinguish the execution authority of the node with the role from other nodes, and the repeated execution of the method is controlled, so that the service scene which can be executed in a single-instance mode can be used in the cluster, the cost is not increased, the occupation of server resources is not increased, and long-time and time-consuming execution service abnormity is not caused.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the embodiments or the description of 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.
Fig. 1 shows a flow chart of a method provided by an embodiment of the invention.
Fig. 2 shows a flowchart of node election in the method provided by the embodiment of the present invention.
Fig. 3 shows a flowchart of performing node information query in the method provided by the embodiment of the present invention.
Fig. 4 shows a flowchart of node election policy operation in the method provided by the embodiment of the present invention.
Fig. 5 shows a flowchart of the control executed in the method provided by the embodiment of the invention.
Fig. 6 shows a flowchart of performing node judgment in the method provided by the embodiment of the present invention.
Fig. 7 is a flowchart illustrating the generation of the determination result in the method according to the embodiment of the present invention.
Fig. 8 is a flowchart illustrating an execution process in the method according to the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It can be understood that, in the prior art, secondary design needs to be performed on the original system, the timing task or the monitoring service and the like are split into separate services, and independent node deployment is adopted to invoke the original service in a micro-service mode. Such processing leads to new problems, such as: the design, research and development and deployment cost is increased, the occupation of server resources is improved, the execution is long, the time-consuming service is abnormal, and the like, and the disaster recovery is not facilitated.
In order to solve the above problems, in the embodiments of the present invention, a node election service is automatically loaded when an application is started, execution node information is regularly queried in a cache center through the node election service, and a node election policy is run according to the execution node information; acquiring a designated method and a mark annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, and executing processing according to a judgment result. The role of an executor can be added in the multi-application copy of the cluster so as to distinguish the execution authority of the node with the role from other nodes, and the repeated execution of the method is controlled, so that the service scene which can be executed in a single-instance mode can be used in the cluster, the cost is not increased, the occupation of server resources is not increased, and long-time and time-consuming execution service abnormity is not caused.
Fig. 1 shows a flow chart of a method provided by an embodiment of the invention.
Specifically, a method for intelligently electing nodes of a distributed cluster includes the following steps:
step S101, automatically loading node election service when an application is started, regularly inquiring executing node information from a cache center through the node election service, and operating a node election strategy according to the executing node information.
In the embodiment of the invention, when the application is started, the node election service is automatically loaded, the permission of the execution node is contended from the Redis cache center through a similar keepalive mechanism, the priority principle of the original execution node is adopted in the contention of the permission of the execution node, and when the time of the original execution node is over a threshold value, the next node obtaining the Redis distributed lock is replaced to be a new execution node.
The node election algorithm is as follows:
voteMethod begin:
service initiation spring lifecycle management evokes init
Define flag variable flag = uuid
try {
Locking identity registration service
Push (flag + current timestamp) to centService
} catch {
Recording error information
} finally {
De-identification registration service lock
}
end。
Specifically, fig. 2 shows a flowchart of node election in the method provided by the embodiment of the present invention.
In a preferred embodiment of the present invention, the automatically loading a node election service when the application is started, periodically querying, by the node election service, execution node information from a cache center, and running a node election policy according to the execution node information specifically includes the following steps:
step S1011, automatically loading a node election service when the application is started.
Step S1012, according to the node election service, periodically querying the cache center for executing node information.
In the embodiment of the invention, only the execution node in the cluster is ensured to process at the same time by acquiring the synchronization lock, and then the execution node information of the execution node is acquired from the cache center. Specifically, the synchronization lock includes a distributed lock and a plurality of wait locks, and the application node corresponding to the distributed lock is an execution node.
Specifically, fig. 3 shows a flowchart for executing a node information query in the method provided by the embodiment of the present invention.
In an embodiment of the present invention, the running a node election policy according to the executing node information specifically includes the following steps:
and step S10121, acquiring the synchronous lock according to the node election service.
Step S10122, ensuring that only executing nodes in the cluster process at the same time through the synchronization lock.
Step S10123, obtaining the execution node information of the execution node from the cache center.
Further, the automatic loading of the node election service when the application is started, the regular query of the node election service to the cache center for executing node information, and the running of the node election policy according to the executing node information further includes the following steps:
and step S1013, operating a node election strategy according to the executive node information.
Specifically, fig. 4 shows a flowchart of node election policy operation in the method provided by the embodiment of the present invention.
In an embodiment of the present invention, the running a node election policy according to the executing node information specifically includes the following steps:
step S10131, when there is no executing node currently, the current node is registered as the executing node and the expiration time is updated.
And step S10132, when the current node is the main node, only the time of reporting alive needs to be updated.
And step S10133, when the current node is not the master node and the time of reporting alive exceeds the threshold, updating the current node as the execution node and updating the time of reporting alive at the same time, otherwise, not processing.
Further, the intelligent node election method for the distributed cluster further comprises the following steps:
step S102, obtaining a designated method executed by an execution node during development and a mark annotation, sending execution information to the designated method, calling an execution strategy service according to the execution information to judge whether the current node is the execution node, generating a judgment result, and executing processing according to the judgment result.
In the embodiment of the invention, when the application node executes the specified method, whether the method is executed or not is controlled by executing the strategy unit, so that repeated execution is avoided.
Specifically, the execution control algorithm is as follows:
executeMethod begin:
if executeCheckMethod (task execution judgment) is successful
then execute the task
else record election results
end if
end。
Specifically, fig. 5 shows a flowchart of execution control in the method provided by the embodiment of the present invention.
In a preferred embodiment of the present invention, the acquiring a designation method and a tag annotation executed by an execution node during development, sending execution information to the designation method, calling an execution policy service according to the execution information to determine whether a current node is an execution node, generating a determination result, and performing execution processing according to the determination result specifically includes the following steps:
step S1021, acquiring a specified method containing a mark annotation during development.
Step S1022, sending execution information to the specified method.
Step S1023, the execution strategy service is called according to the execution information to judge whether the current node is an execution node or not, and a judgment result is generated.
In the embodiment of the invention, the execution policy service is called according to the execution information, whether the current node is an execution node or not is judged through the called execution policy service, and a judgment result is generated.
Specifically, the task execution judgment algorithm is as follows:
executeCheckMethod begin:
obtaining value from Redis
if value valid the great
Calculating a service identification redisServiceFlag by a value
if native flag! = redISServiceFlag the last pocket
Calculating the time of the timestamp by the value
if current timestamp-time < threshold then returns failure
else returns a resetserviceflag method result
end if
}
end if
}
else returns success
end if
end。
Specifically, fig. 6 shows a flowchart of executing node judgment in the method provided by the embodiment of the present invention.
In an embodiment of the present invention, the invoking an execution policy service according to the execution information to determine whether a current node is an execution node, and generating a determination result specifically includes:
step S10231, the execution policy service is called according to the execution information.
Step S10232, determining whether the current node is an execution node by the execution policy service, and generating a determination result.
Specifically, fig. 7 shows a flowchart of the generation of the determination result in the method provided by the embodiment of the present invention.
In an embodiment of the present invention, the determining, by the policy enforcement service, whether a current node is an enforcement node, and generating a determination result specifically includes:
step S102321, sending information acquisition execution node information to the cache center.
Step S102322, determining whether the current node is an execution node according to the node information.
In step S102323, if the current node is an executing node, it is determined to return yes successfully.
And step S102324, if the current node is not the execution node, continuously judging whether the time for reporting activity exceeds a threshold value, if so, judging to return yes successfully, and if not, judging to return no unsuccessfully.
Further, the acquiring a designated method and a tag annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to determine whether a current node is an execution node, generating a determination result, and performing execution processing according to the determination result further includes the following steps:
and step S1024, executing processing according to the judgment result.
Specifically, fig. 8 shows a flowchart of execution processing performed in the method provided by the embodiment of the present invention.
In a preferred embodiment of the present invention, the executing process according to the determination result specifically includes the following steps:
step S10241, when the determination result is yes, continuing to execute the specifying method.
Step S10242, when the determination result is no, ignoring the execution of the specifying method, generating log information, and sending the log information to a log service.
Further, in another preferred embodiment provided by the present invention, the cache center may be replaced by various databases, file storage, and other distributed middleware.
Further, in another preferred embodiment provided by the present invention, an intelligent node election system for a distributed cluster includes:
and the election strategy unit is used for automatically loading node election service when the application is started, inquiring the execution node information from the cache center at regular time through the node election service, and operating the node election strategy according to the execution node information.
In the embodiment of the invention, the election strategy unit automatically loads the node election service when the application is started, contends for the authority of the execution node from the Redis cache center through a similar keepalive mechanism, adopts the prior principle of the execution node in the contention for the authority of the execution node, and replaces the next node obtaining the Redis distributed lock to be a new execution node when the time of reporting the activity of the prior execution node exceeds the threshold value.
In a preferred embodiment provided by the present invention, the election policy unit specifically includes:
and the node election service loading module is used for automatically loading the node election service when the application is started.
And the execution node information query module is used for regularly querying the execution node information from the cache center according to the node election service.
Specifically, in a preferred embodiment provided by the present invention, the executing node information querying module specifically includes:
and the synchronous lock acquisition module is used for acquiring a synchronous lock according to the node election service.
And the synchronous lock application module is used for ensuring that only the execution node processes the cluster at the same time through the synchronous lock.
And the execution node information acquisition module is used for acquiring the execution node information of the execution node from the cache center.
Further, the node intelligent election system of the distributed cluster further includes:
and the node election strategy operation module is used for operating the node election strategy according to the execution node information.
Further, the node intelligent election system of the distributed cluster further includes:
the execution policy unit is used for acquiring a designated method executed by an execution node during development and a mark annotation, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, generating a judgment result, and executing execution processing according to the judgment result.
In the embodiment of the invention, when the application node executes the specified method, whether the method is executed or not is controlled by executing the strategy unit, so that repeated execution is avoided.
In an embodiment of the present invention, the execution policy unit specifically includes:
and the specified method acquisition module is used for acquiring the specified method containing the mark annotation during development.
And the execution information sending module is used for sending the execution information to the specified method.
And the judgment result generation module is used for calling the execution strategy service according to the execution information to judge whether the current node is an execution node or not and generating a judgment result.
And the execution processing module is used for executing the execution processing according to the judgment result.
In summary, in the embodiments of the present invention, the node election service is automatically loaded when the application is started, the node election service periodically queries the execution node information from the cache center, and the node election policy is run according to the execution node information; acquiring a designated method and a mark note executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, and executing processing according to a judgment result. The role of an executor can be added in the multi-application copy of the cluster so as to distinguish the execution authority of the node with the role from other nodes, and the repeated execution of the method is controlled, so that the service scene which can be executed under a single instance mode can be used in the cluster, the cost cannot be increased, the occupation of server resources cannot be improved, and long-time and time-consuming execution service abnormity cannot be caused.
It should be understood that, although the steps in the flowcharts of the embodiments of the present invention are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in various embodiments may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above may be implemented by a computer program, which may be stored in a non-volatile computer readable storage medium, and when executed, may include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent should be subject to the appended claims.
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 and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (8)

1. An intelligent node election method for a distributed cluster is characterized by specifically comprising the following steps:
automatically loading a node election service when an application is started, regularly inquiring execution node information from a cache center through the node election service, and operating a node election strategy according to the execution node information;
automatically loading a node election service when an application is started, contending for an execution node authority from a Redis cache center through a keepalive mechanism, adopting an original execution node priority principle in the contending for the execution node authority, and replacing a next node obtaining a Redis distributed lock with a new execution node when the reporting time of the original execution node exceeds a threshold value;
acquiring a designated method and a mark annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to judge whether the current node is the execution node, generating a judgment result, and executing processing according to the judgment result;
the step of regularly inquiring and executing the node information from the cache center according to the node election service specifically comprises the following steps:
acquiring a synchronous lock according to the node election service;
through the synchronous lock, only the execution node is ensured to process at the same time in the cluster;
and acquiring the execution node information of the execution node from a cache center.
2. The method of claim 1, wherein the synchronization lock comprises a distributed lock and a plurality of wait locks.
3. The method according to claim 1, wherein said operating a node election strategy according to said executing node information specifically comprises the steps of:
if no executing node exists currently, registering the current node as the executing node and updating the reporting time;
if the current node is the main node, only the active reporting time needs to be updated;
and if the current node is not the master node and the reported time exceeds the threshold value, updating the current node as an execution node and updating the reported time, otherwise, not processing.
4. The method according to claim 1, wherein the acquiring a designated method and a tag annotation executed by an execution node during development, sending execution information to the designated method, calling an execution policy service according to the execution information to determine whether a current node is an execution node, generating a determination result, and executing processing according to the determination result specifically includes the following steps:
acquiring a specified method containing a mark annotation during development;
sending execution information to the specified method;
calling an execution policy service according to the execution information to judge whether the current node is an execution node or not and generating a judgment result;
and executing processing according to the judgment result.
5. The method according to claim 4, wherein the step of calling an execution policy service to determine whether the current node is an execution node according to the execution information and generating a determination result specifically includes the steps of:
calling an execution policy service according to the execution information;
and judging whether the current node is an execution node or not through the execution policy service, and generating a judgment result.
6. The method according to claim 5, wherein the determining whether the current node is an executing node by the executing policy service and generating the determination result specifically includes the following steps:
sending information to a cache center to acquire execution node information;
judging whether the current node is an execution node or not according to the node information;
if the current node is an execution node, judging to return yes successfully;
if the current node is not the execution node, continuously judging whether the time for reporting activity exceeds the threshold value, if so, judging that the return is successful, otherwise, judging that the return is failed, and if not, returning no.
7. The method according to claim 6, wherein the performing processing according to the determination result specifically includes the following steps:
if the judgment result is yes, continuing to execute the specified method;
if the judgment result is negative, the designated method is ignored to be executed, log information is generated, and the log information is sent to log service.
8. The method of claim 1, wherein the cache center is replaced with distributed middleware.
CN202210162014.8A 2022-02-22 2022-02-22 Intelligent node election method for distributed cluster Active CN114221863B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210162014.8A CN114221863B (en) 2022-02-22 2022-02-22 Intelligent node election method for distributed cluster

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210162014.8A CN114221863B (en) 2022-02-22 2022-02-22 Intelligent node election method for distributed cluster

Publications (2)

Publication Number Publication Date
CN114221863A CN114221863A (en) 2022-03-22
CN114221863B true CN114221863B (en) 2022-05-24

Family

ID=80709261

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210162014.8A Active CN114221863B (en) 2022-02-22 2022-02-22 Intelligent node election method for distributed cluster

Country Status (1)

Country Link
CN (1) CN114221863B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111722934B (en) * 2020-06-12 2022-08-16 南京甄视智能科技有限公司 Distributed timing task processing method and system

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10171629B2 (en) * 2015-09-08 2019-01-01 International Business Machines Corporation Client-initiated leader election in distributed client-server systems
CN108733459B (en) * 2017-04-13 2023-07-14 腾讯科技(深圳)有限公司 Distributed timing method, server and system
CN112910937B (en) * 2019-11-19 2022-12-23 北京金山云网络技术有限公司 Object scheduling method and device in container cluster, server and container cluster
CN111416839B (en) * 2020-02-26 2022-09-23 平安科技(深圳)有限公司 Cluster environment timing task processing method, system, device and storage medium
CN112579267A (en) * 2020-09-28 2021-03-30 京信数据科技有限公司 Decentralized big data job flow scheduling method and device
CN114048265A (en) * 2021-11-11 2022-02-15 北京知道创宇信息技术股份有限公司 Task processing method and device, electronic equipment and computer readable storage medium

Also Published As

Publication number Publication date
CN114221863A (en) 2022-03-22

Similar Documents

Publication Publication Date Title
EP3739845B1 (en) Borrowing data storage resources in a distributed file system
CN108959385B (en) Database deployment method, device, computer equipment and storage medium
CN110781214A (en) Database reading and writing method and device, computer equipment and storage medium
CN114221863B (en) Intelligent node election method for distributed cluster
CN111026767B (en) Block chain data storage method and device and hardware equipment
CN112597202B (en) Data query method and device, computer equipment and storage medium
CN110727698A (en) Database access method and device, computer equipment and storage medium
CN109325026B (en) Data processing method, device, equipment and medium based on big data platform
CN106897345B (en) Data storage method and device
EP2416526B1 (en) Task switching method, server node and cluster system
CN111884834A (en) Zookeeper-based distributed system upgrading method and system and computer equipment
CN109697112B (en) Distributed intensive one-stop operating system and implementation method
CN110543465B (en) Directory operation method and device, computer equipment and storage medium
CN113946427A (en) Task processing method, processor and storage medium for multi-operating system
CA3130314A1 (en) Order state unified management method and device, computer equipment and storage medium
CN111291063B (en) Master and backup copy election method, system, computer equipment and storage medium
CN112632375A (en) Session information processing method, server and storage medium
CN114564153B (en) Volume mapping relieving method, device, equipment and storage medium
CN114237989B (en) Database service deployment and disaster tolerance method and device
CN114443223B (en) Bare computer disk management method, device and medium
CN115729702A (en) Application program memory configuration method, electronic device and computer storage medium
CN115237885A (en) Parameter adjusting method and device of data storage system
CN112711606A (en) Database access method and device, computer equipment and storage medium
CN114840219B (en) Distributed event processing system
CN115499394B (en) Message theme processing method, device, equipment and storage medium

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