CN111538763B - Method for determining master node in cluster, electronic equipment and storage medium - Google Patents

Abstract

The embodiment of the application provides a method, electronic equipment and storage medium for determining a master node in a cluster, wherein any target node in the cluster interacts with a database, whether the target node is used as the master node is determined from node information corresponding to each node in the database, and if so, first information for marking the target node as the master node is sent to the database. And when the master node does not exist, the master node is determined according to the node information every time, so that the existence of multiple master nodes is avoided, and the disorder of service order and the waste of resources are avoided. Meanwhile, node information is stored through the database, and special hardware equipment is not needed to be newly added in the determining process of the master node.

Description

A method, electronic device and storage medium for determining a master node in a cluster

technical field

The invention relates to the field of computer technology, in particular to a method for determining a master node in a cluster, an electronic device and a storage medium.

Background technique

With the development of the Internet, the number of users has become larger and larger, and ordinary stand-alone applications can no longer meet high-concurrency applications. In order to solve high-concurrency and high-availability scenarios, general applications use clusters to provide external services. However, a master host usually needs to be elected in the cluster to perform some specific tasks.

Existing methods are generally based on a heavyweight third party like zookeeper or using the traditional method of master and backup machines to achieve master election. Among them, Figure 1 is a schematic diagram of the election process of master election for the master and backup machines. ) periodically sends Ping packets to the current host node. After receiving the ping packet, the master node will send a response ack message to the standby node. It is considered that the host is down, and I will start to exercise the responsibility of the master node and act as the master role.

However, for the traditional active-standby master mode, there are mainly the following hidden dangers: when there is a problem with the network between the master and the standby machine, and the standby machine cannot receive the ack reply message from the master machine, the standby machine will think that the master node is down, and then the standby machine will automatically Start your own master instance. This will cause two master nodes in the system, that is, double masters, and the entire service will be messed up. At the same time, the traditional two machine nodes, the slave node is generally used as a backup machine, that is, it does not provide services, and only when the host machine goes down, it will take over the service, which causes a waste of system resources and leaves a machine idle.

For traditional applications, adding a zookeeper cluster is equivalent to adding a piece of heavy equipment, and at the same time it is necessary to maintain and monitor the zookeeper cluster. Moreover, zookeeper-based elections basically rely on preemption and registration of the minimum serial number to achieve master election. The elected hosts are random and poorly controllable.

It can be seen that the existing master node determination process either has hidden dangers of multiple master nodes, resulting in disordered service order and waste of resources, or needs to increase corresponding hardware devices.

Contents of the invention

Embodiments of the present invention provide a method for determining a master node in a cluster, an electronic device, and a storage medium, to solve the problem of multiple master nodes in the existing master node determination process, resulting in disordered service order and waste of resources, or requiring Increase the problem of corresponding hardware devices.

In view of the above technical problems, in the first aspect, the embodiment of the present invention provides a method for determining the master node in the cluster, including:

If any target node in the cluster determines that there is currently no master node, then determine whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database;

If the target node is used as the master node, sending first information marking the target node as the master node to the database.

In a second aspect, an embodiment of the present invention provides a method for determining a master node in a cluster, including:

If the first information marking the target node in the cluster as the master node is received, the mark of the master node is added to the node information of the target node.

In a third aspect, an embodiment of the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and operable on the processor, and the processor implements the above-mentioned determination when executing the program The steps of the method of the master node in the cluster.

In a fourth aspect, an embodiment of the present invention provides a non-transitory readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method for determining the master node in the cluster described in any one of the above items is implemented. step.

Embodiments of the present invention provide a method for determining the master node in the cluster, electronic equipment, and a storage medium. Any target node in the cluster interacts with the database, and determines whether to use itself as the node information corresponding to each node in the cluster in the database. If so, the master node sends first information marking the target node as the master node to the database. Every time the master node does not exist, the master node is determined according to the node information, which will not lead to the existence of multiple master nodes, and avoid service disorder and resource waste. At the same time, the node information is stored in the database, and the determination process of the master node does not need to add special hardware equipment.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description These are some embodiments of the present invention. Those skilled in the art can also obtain other drawings based on these drawings without creative work.

Fig. 1 is a schematic diagram of the election process of master and standby machine election master provided by the embodiment of the present invention;

Fig. 2 is a schematic flowchart of a method for determining a master node in a cluster applicable to any host in the cluster provided by another embodiment of the present invention;

Fig. 3 is a schematic diagram of the implementation process of the queue-jumping mechanism in the master node election process provided by another embodiment of the present invention;

Fig. 4 is a schematic flow diagram of master node election provided by another embodiment of the present invention;

FIG. 5 is a schematic flowchart of a method for determining a master node in a cluster applicable to a database provided by another embodiment of the present invention;

FIG. 6 is a structural block diagram of a device for determining the master node in the cluster corresponding to any node in the cluster provided by another embodiment of the present invention;

FIG. 7 is a structural block diagram of a device for determining a master node in a cluster corresponding to a database provided by another embodiment of the present invention;

Fig. 8 is a schematic diagram of the physical structure of an electronic device provided by another embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments It is a part of embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

This embodiment provides a method for determining the master node in the cluster, which is implemented by any host and database configuration of the cluster. Figure 2 is a schematic flow chart of the method for determining the master node in the cluster applicable to any host in the cluster provided by this implementation, referring to Figure 2, the method includes:

Step 201: If any target node in the cluster determines that there is currently no master node, it determines whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database.

A cluster is a network composed of multiple nodes, and each node is a host, server or computer, which is not specifically limited in this embodiment.

The node information includes the time point when each node executes the preset command, and the basic information of the node; wherein, the basic information of the node includes the node's machine IP, machine name, primary key, operating system type, operating system installation time, refresh update time, etc. Wherein, the preset instruction includes an instruction for the node to implement a certain function execution, for example, the preset instruction includes storing the node information corresponding to the node in the database (that is, registering in the database), initializing the node, and starting a certain application program by the node , the node sends a certain message, etc., which are not specifically limited in this embodiment.

The database is any relational database, for example, mysql, sqlserver, oracle, and the like. To facilitate data reading and storage through a relational database, it is only necessary to apply the storage function of the relational database to the technical solution of the present application, and no additional hardware devices are required.

Step 202: If the target node is used as the master node, send first information marking the target node as the master node to the database.

Wherein, it also includes: performing setting tasks through the master node, or coordinating each node in the cluster.

This embodiment provides a method for determining the master node in the cluster. Any target node in the cluster interacts with the database, and determines whether to use itself as the master node according to the node information corresponding to each node in the cluster in the database. If so, send the First information marking the target node as a master node. Every time the master node does not exist, the master node is determined according to the node information, which will not lead to the existence of multiple master nodes, and avoid service disorder and resource waste. At the same time, the node information is stored in the database, and the determination process of the master node does not need to add special hardware equipment.

Further, on the basis of the above embodiments, the determining whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database includes:

Determine the election time point corresponding to each node according to the node information, and determine the target election time point according to the first time interval between each election time point and the current time point;

If the node corresponding to the target election time point is the target node, use the target node as the master node;

Wherein, the election time point is a time point when a node executes a preset instruction, and the preset instruction includes storing node information corresponding to the node in the database or initializing the node.

It should be noted that the election time point is determined from numerous time points stored in the node information, and is used for the time point of master node election. After the election time point is determined for each node, the master node can be determined according to the election time point corresponding to each node. After each judgment that there is currently no master node, the time point when the node executes the same preset instruction can be used as the election time point (for example, the time point when the node is initialized is used as the election time point each time), The time point when the node executes different preset instructions can also be used as the election time point (for example, when it is judged that there is no master node for the first time or the first few times, the time point when the node information corresponding to the node is stored in the database is used as the election time point When it is not the first time or after the first few times it is judged that there is currently no master node, the time point when the node is initialized is used as the election time point).

Among them, the target election time point is determined according to the first time interval between each election time point and the current time point, including:

According to the first time interval between each election time point and the current time point, the election time point corresponding to the longest first time length or the shortest first time length is obtained as the target election time point;

Wherein, if there are multiple election time points for the longest first duration or the shortest first duration, an election time point is randomly selected from the plurality of election time points as the target election time point.

In this embodiment, after judging that there is currently no master node, the election of the master node is implemented according to the election time point determined through the node information. The election of the master node is uniquely determined based on the election time of each node, which avoids the generation of multiple master nodes and improves the rationality of the master node election.

In this embodiment, the time point at which a node executes a different preset instruction can be used as the election time point each time. Further, on the basis of the above-mentioned embodiments, the determination of the node corresponding to each node according to the node information Election time point, the target election time point is determined according to the first time interval between each election time point and the current time point, including:

According to the preset corresponding relationship, determine the preset command corresponding to the number of times that the master node is currently judged not to exist as the target preset command;

According to the target preset instruction and the node information, the election time point corresponding to each node is determined according to the first time interval between each election time point and the current time point.

Wherein, the preset corresponding relationship is a pre-stored preset instruction corresponding to the number of times it is currently judged that there is no master node. The preset corresponding relationship can be set as needed, for example, when it is judged for the first time that there is currently no master node, the time point when the preset instruction "store the node information corresponding to the node into the database" is executed as the election time point . When it is not judged for the first time that there is no master node at present, the time point when the preset instruction "initialize the node" is executed is taken as the election time point.

Specifically, when it is judged for the first time that there is currently no master node, the time point at which each node stores the node information in the database is obtained according to the node information as the election time point, and according to the first interval between each election time point and the current time point The duration determines the target election time point;

When it is not judged for the first time that there is currently no master node, the time point at which each node initializes the node is obtained according to the node information as the election time point, and the target election time point is determined according to the first time interval between each election time point and the current time point .

In this embodiment, the election time point is determined from the node information according to the preset instructions corresponding to the number of times that no master node is currently judged.

In some scenarios, it is necessary to make a specific node elected as the master node, that is, to realize the "queue jumping" of the node. In order to realize the "queue jumping" of the node, further, on the basis of the above-mentioned embodiments, it also includes:

Generate a time modification instruction, the time modification instruction is used to modify the election time point corresponding to the node in the database;

The time modification instruction is sent to the database, so that the database modifies the election time point corresponding to the node according to the time modification instruction.

Wherein, the target node generates the time modification instruction after receiving a modification request for modifying the election time point corresponding to the nodes in the cluster. The modification request may be a request input by the user to the target node through an interactive interface, which is not specifically limited in this embodiment.

Wherein, the time modification instruction generated by the target node is used to request modification of the election time point corresponding to the target node, or to request modification of the election time point corresponding to nodes in the cluster nodes other than the target node.

For example, when the target node needs to be selected as the master node, a time modification command can be sent to the database to modify the election time point corresponding to the target node, so that the election time point and the first duration of the current time point can be Determine the target node as the primary node. For example, when the node corresponding to the shortest first duration needs to be selected as the master node, the election time point of a certain node can be modified through the time modification command, so that the first duration corresponding to the target node is the shortest after modification, so that the The target node is elected as the master node.

In this embodiment, the election time point of each node of the cluster is modified through a time modification instruction, so that during the master node election process, a specific node is "jumped in the queue", so that the specific node is elected as the master node. The "queue jumping" mechanism increases the controllability of the master node election.

Specifically, this embodiment uses the database to record node information, and uses the election time point for the election process (the election time point is the time point when the preset instruction is executed or the time point set for the node according to the time setting instruction) and increases the reasonable and effective time point. The sequential "queue jumping" mechanism (that is, modifying the election time point through time modification instructions) ensures that the master is acted by a reasonable host, which optimizes the entire mechanism and no longer changes the master randomly or sequentially. At the same time, the priority can be changed according to Each host is configured.

Figure 3 is a schematic diagram of the implementation process of the "queue jumping" mechanism in the master node election process provided by this embodiment. Referring to Figure 3, the implementation process of the "queue jumping" mechanism includes the following contents:

(1) Get the operating system initialization time of the machine.

(2) After judging that the master host is down, delete the record information of the original master.

(3) According to the value of init_time in the server_info table (that is, the operating system initialization time, that is, the time to initialize the node), select the latest machine to modify the registration time to be the minimum registration time of all machines.

(4) The system will re-elect the host, and judge the machine with the minimum registration time as the master.

Further, on the basis of the above-mentioned embodiments, it also includes:

According to the heartbeat time point periodically reported by each node in the database, it is judged whether there is an abnormal node, wherein the abnormal node is a node whose second time interval between the heartbeat time point reported last time and the current time point is greater than the preset time length;

If there is an abnormal node, sending second information to the database to delete the node information of the abnormal node.

Wherein, the preset duration is 1 minute.

Wherein, each node reports the current time point every 30 seconds as the heartbeat time point.

In this embodiment, the heartbeat time point is used to identify whether each host is down, and the downtime node can be excluded in time to participate in the election of the master node, effectively avoiding the occurrence of multiple master nodes.

Further, on the basis of the above-mentioned embodiments, it also includes:

According to the node information of each node currently stored in the database, it is judged whether there is node information marked as a master node, and if not, there is no master node in each node of the cluster.

Wherein, if it is judged that there is node information marked as the master node, no election of the master node is required.

In this embodiment, it is realized whether a master node currently exists in the cluster is judged by marking the master node.

Fig. 4 is a schematic flow diagram of the master node election provided in this embodiment, referring to Fig. 4, the flow specifically includes the following contents:

(1) Each host starts, obtains its own business IP, and writes the IP into the database table server_master, register_time is the current software startup time, the refresh time is the same as the registration time, and the is_master field is marked as No.

(2) Each machine checks the initial installation time of the operating system at the same time when starting, and can detect according to the modification time of the system file, and obtain the type of the operating system and the machine name at the same time. Write this information into the server_info host information table.

(3) Each host updates the refresh_time field of the server_master table of the database every 30 seconds, indicating the heartbeat of the host.

(4) When each host updates its heartbeat for the first time, judge whether it can become a master; traverse all records in the server_master table, obtain the record of the machine with the earliest registration time register_time, and check whether the IP of the record and its own machine IP are Match, if it matches, identify yourself as the master role, and update the is_master field in the record to true.

(5) The machine that obtains the master authority executes the tasks belonging to the master.

(6) In the subsequent heartbeat detection, if there is a host whose refresh_time minus the current time is greater than 1 minute and has not been updated, the record will be deleted, indicating that the host has been disconnected. If it is the master role that is down, it will also release its own master permissions when the heartbeat fails, and the corresponding master tasks will be released.

(7) After the master host is released, the system needs to re-elect the master. At this time, each host will read the server_info information, and judge the use time of the machine according to the init_time (system installation initialization time). If the init_time is from the current time The shortest means that the host is up-to-date, then the machine with the same IP as its own will take the registration time of updating the server_master table (modified according to the IP), and update it to the smallest of all registration times.

(8) In the subsequent heartbeat, when all machines detect the registration time, the machine with the smallest registration time, that is, the latest machine just now, will be successfully elected as the master host.

Fig. 5 is a schematic flow chart of the method for determining the master node in the cluster applicable to the database provided by this implementation. Referring to Fig. 5, the method includes:

Step 501: If the first information marking the target node in the cluster as the master node is received, add the mark of the master node to the node information of the target node.

The first information is information sent by any node (for example, the target node) in the cluster to indicate that the target node is marked as the master node.

This embodiment provides a method for determining the master node in the cluster. Any target node in the cluster interacts with the database, and determines whether to use itself as the master node according to the node information corresponding to each node in the cluster in the database. If so, send the First information marking the target node as a master node. Every time the master node does not exist, the master node is determined according to the node information, which will not lead to the existence of multiple master nodes, and avoid service disorder and resource waste. At the same time, the node information is stored in the database, and the determination process of the master node does not need to add special hardware equipment.

Further, on the basis of the above-mentioned embodiments, it also includes:

If the time modification instruction is received, the election time point corresponding to the node is modified according to the time modification instruction.

Among them, also include;

If the node information sent by the node and/or the heartbeat time point periodically reported by each node is received, the received node information and/or heartbeat time point are stored;

If the second information for deleting the node information of the abnormal node is received, the node information of the abnormal node is deleted.

It should be noted that, in the method provided in this embodiment, there are two lists for each node in the database in the database, one list is used to access the node information of each node, and the other list is used to access the heartbeat time of the node point. Two tables are created in the database, one of which accesses the basic information of each node and the election time point. In the list of maintenance node information, the election time point corresponding to each node is included. When the database receives a request for a node The time modification instruction for modifying the election time point of the node will modify the election time point corresponding to the node.

The method for determining the master node in the cluster provided by this embodiment uses a relational database to store the networking information of the host, and elects the master according to the registration time and the installation and initialization time of the operating system. By being able to modify the installation and initialization time of the operating system, It enables queue jumping during the election and increases the controllability of the election. The advantages are as follows: Compared with the traditional master-standby mode, it eliminates the hidden danger of dual masters. Use the database to register information without installing zookeeper heavyweight software. Fully consider the master elections in various situations, such as elections in chronological order, and adjust the time mechanism for queue-jumping elections.

In the methods provided in the foregoing embodiments, the database is used to store node information and heartbeat time points sent by the nodes, and send information required by the nodes to the nodes. In this process, the node performs the operation of reading node information from the database, electing the master node, and sending time modification instructions to the database. The database does not actively participate in the election process of the master node and the active modification process of the election time point. Therefore, for this process, developers only need to develop on the node side and directly call the access function of the database. However, in fact, for some databases that are convenient for developers to develop, the election of the master node can also be achieved through the following process:

The database judges whether there is currently a node marked as the master node. If not, the master node is determined according to the election time point corresponding to each node, and the node identifier corresponding to the determined master node is sent to each node of the cluster.

The method further includes: after receiving a modification request for modifying the election time point corresponding to the target node, modifying the election time point corresponding to the target node according to the modification request.

It also includes: receiving the heartbeat time point periodically reported by each node of the cluster, and storing the heartbeat time point corresponding to the node.

It also includes: judging whether there is an abnormal node according to the heartbeat time point corresponding to each node, and if so, deleting the node information corresponding to the abnormal node.

Wherein, the abnormal node is a node whose second time interval between the last reported heartbeat time point and the current time point is longer than the preset time length.

Fig. 6 is a structural block diagram of the device for determining the master node in the cluster corresponding to any node in the cluster provided by this embodiment. Referring to Fig. 6, the device for determining the master node in the cluster includes a determination module 601 and a sending module 602, wherein ,

The determining module 601 is configured to determine whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database if it is judged that there is currently no master node;

The sending module 602 is configured to send first information marking the target node as the master node to the database if the target node is used as the master node.

The apparatus for determining the master node in the cluster provided in this embodiment is applicable to the methods for determining the master node in the cluster corresponding to any node in the cluster provided in the above embodiments, and details are not repeated here.

The embodiment of the present invention provides a device for determining the master node in the cluster. Any target node in the cluster interacts with the database, and determines whether to use itself as the master node according to the node information corresponding to each node in the cluster in the database. If so, send The database sends first information marking the target node as a master node. Every time the master node does not exist, the master node is determined according to the node information, which will not lead to the existence of multiple master nodes, and avoid service disorder and waste of resources. At the same time, the node information is stored in the database, and the determination process of the master node does not need to add special hardware equipment.

Optionally, the determining whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database includes:

Determine the election time point corresponding to each node according to the node information, and determine the target election time point according to the first time interval between each election time point and the current time point;

If the node corresponding to the target election time point is the target node, use the target node as the master node;

Wherein, the election time point is a time point when a node executes a preset instruction, and the preset instruction includes storing node information corresponding to the node in the database or initializing the node.

Optionally, also include:

Generate a time modification instruction, the time modification instruction is used to modify the election time point corresponding to the node in the database;

The time modification instruction is sent to the database, so that the database modifies the election time point corresponding to the node according to the time modification instruction.

Optionally, also include:

According to the heartbeat time point periodically reported by each node in the database, it is judged whether there is an abnormal node, wherein the abnormal node is a node whose second time interval between the heartbeat time point reported last time and the current time point is greater than the preset time length;

If there is an abnormal node, sending second information to the database to delete the node information of the abnormal node.

Optionally, also include:

According to the node information of each node currently stored in the database, it is judged whether there is node information marked as a master node, and if not, there is no master node in each node of the cluster.

Optionally, the determining the election time point corresponding to each node according to the node information, and determining the target election time point according to the first time interval between each election time point and the current time point include:

According to the preset corresponding relationship, determine the preset command corresponding to the number of times that the master node is currently judged not to exist as the target preset command;

According to the target preset instruction and the node information, the election time point corresponding to each node is determined according to the first time interval between each election time point and the current time point.

FIG. 7 is a structural block diagram of the device for determining the master node in the cluster corresponding to the database provided in this embodiment. Referring to FIG. 7, the device for determining the master node in the cluster includes a marking module 701, wherein,

The marking module 701 is configured to add the marking of the master node to the node information of the target node if the first information marking the target node in the cluster as the master node is received.

The apparatus for determining the master node in the cluster provided in this embodiment is applicable to the methods for determining the master node in the cluster corresponding to the databases provided in the above embodiments, and will not be repeated here.

The embodiment of the present invention provides a device for determining the master node in the cluster. Any target node in the cluster interacts with the database, and determines whether to use itself as the master node according to the node information corresponding to each node in the cluster in the database. If so, send The database sends first information marking the target node as a master node. Every time the master node does not exist, the master node is determined according to the node information, which will not lead to the existence of multiple master nodes, and avoid service disorder and resource waste. At the same time, the node information is stored in the database, and the determination process of the master node does not need to add special hardware equipment.

Optionally, also include:

If the time modification instruction is received, the election time point corresponding to the node is modified according to the time modification instruction.

FIG. 8 illustrates a schematic diagram of the physical structure of an electronic device. As shown in FIG. 8, the electronic device may include: a processor (processor) 801, a communication interface (Communications Interface) 802, a memory (memory) 803, and a communication bus 804, Wherein, the processor 801 , the communication interface 802 , and the memory 803 communicate with each other through a communication bus 804 . The processor 801 can call the logical instructions in the memory 803 to execute the following method: if any target node in the cluster judges that there is no master node currently, then according to the node information corresponding to each node of the cluster stored in the database, determine whether to use the The target node is used as the master node; if the target node is used as the master node, the first information marking the target node as the master node is sent to the database, or if the target node in the cluster is marked as the master node if received the first information of the target node, add the mark of the master node to the node information of the target node.

In addition, the above logic instructions in the memory 803 may be implemented in the form of software function units and when sold or used as an independent product, may be stored in a computer-readable storage medium. Based on this understanding, the essence of the technical solution of the present invention or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes. .

Furthermore, the embodiment of the present invention discloses a computer program product, the computer program product includes a computer program stored on a non-transitory readable storage medium, the computer program includes program instructions, when the program instructions are executed by the computer , the computer can execute the methods provided by the above method embodiments, for example, including: if any target node in the cluster judges that there is no master node currently, then according to the node information corresponding to each node of the cluster stored in the database, determine whether to use the The target node is used as the master node; if the target node is used as the master node, then the first information to mark the target node as the master node is sent to the database, or if the target node in the cluster is marked as the master node If the first information of the node is the first information of the target node, the mark of the master node is added to the node information of the target node.

On the other hand, an embodiment of the present invention also provides a non-transitory readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the transmission method provided by the above-mentioned embodiments is implemented, for example, including: If any target node in the cluster judges that there is currently no master node, then determine whether to use the target node as the master node according to the node information corresponding to each node of the cluster stored in the database; if the target node is used as the master node, then Sending the first information marking the target node as the master node to the database, or if receiving the first information marking the target node in the cluster as the master node, adding the master node to the node information of the target node The label of the node.

The device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in One place, or it can be distributed to multiple network elements. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. It can be understood and implemented by those skilled in the art without any creative efforts.

Through the above description of the implementations, those skilled in the art can clearly understand that each implementation can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the prior art can be embodied in the form of software products, and the computer software products can be stored in readable storage media, such as ROM/RAM, disk , CD, etc., including several instructions to make a computer device (which may be a personal computer, server, or network device, etc.) execute the methods described in each embodiment or some parts of the embodiments.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be Modifications are made to the technical solutions described in the foregoing embodiments, or equivalent replacements are made to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims (9)

1. A method for determining master nodes in a cluster, comprising:

if any target node in the cluster judges that the master node does not exist currently, determining whether the target node is used as the master node according to node information corresponding to each node of the cluster stored in a database; the database is used for storing node information and heartbeat time points sent by the nodes and sending information needed by the nodes to the nodes;

if the target node is used as a main node, first information for marking the target node as the main node is sent to the database;

judging whether an abnormal node exists according to the heartbeat time points periodically reported by all the nodes in the database, wherein the abnormal node is a node with a second time length longer than a preset time length between the latest reported heartbeat time point and the current time point;

and if the abnormal node exists, sending second information for deleting the node information of the abnormal node to the database.

2. The method for determining a master node in a cluster according to claim 1, wherein determining whether to use the target node as the master node according to node information corresponding to each node of the cluster stored in a database includes:

determining election time points corresponding to the nodes according to the node information, and determining target election time points according to first time intervals between the election time points and the current time points;

if the node corresponding to the target election time point is the target node, the target node is used as a main node;

the election time point is a time point when the node executes a preset instruction, and the preset instruction comprises storing node information corresponding to the node into the database or initializing the node.

3. The method of determining a master node in a cluster of claim 2, further comprising:

generating a time modification instruction, wherein the time modification instruction is used for modifying an election time point corresponding to a node in the database;

and sending the time modification instruction to the database so that the database modifies the election time point corresponding to the node according to the time modification instruction.

4. The method of determining a master node in a cluster of claim 1, further comprising:

judging whether node information marked as a master node exists according to the node information of each node currently stored in the database, and if not, judging that the master node does not exist in each node of the cluster currently.

5. The method for determining a master node in a cluster according to claim 2, wherein determining an election time point corresponding to each node according to the node information, and determining a target election time point according to a first time interval between each election time point and a current time point, includes:

determining a preset instruction corresponding to the number of times that the main node does not exist at present according to the preset corresponding relation, and taking the preset instruction as a target preset instruction;

and determining a target election time point according to the target preset instruction and the node information, and the election time point corresponding to each node according to the first time interval between each election time point and the current time point.

6. A method for determining master nodes in a cluster, comprising:

the database is used for storing node information and heartbeat time points sent by the nodes and sending information needed by the nodes to the nodes;

if first information of marking a target node in a cluster as a main node is received, adding the mark of the main node into the node information of the target node;

if node information sent by the nodes and/or heartbeat time points periodically reported by the nodes are received, storing the received node information and/or the heartbeat time points;

and if the second information for deleting the node information of the abnormal node is received, deleting the node information of the abnormal node.

7. The method of determining master nodes in a cluster of claim 6, further comprising:

and if the time modification instruction is received, modifying the election time point corresponding to the node according to the time modification instruction.

8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of determining master nodes in a cluster according to any of claims 1 to 7 when the program is executed.

9. A non-transitory readable storage medium having stored thereon a computer program, which when executed by a processor, implements the steps of the method of determining master nodes in a cluster according to any of claims 1 to 7.