CN117041182A - Main server node selection method, device, equipment and medium of distributed component - Google Patents
Main server node selection method, device, equipment and medium of distributed component Download PDFInfo
- Publication number
- CN117041182A CN117041182A CN202311050373.5A CN202311050373A CN117041182A CN 117041182 A CN117041182 A CN 117041182A CN 202311050373 A CN202311050373 A CN 202311050373A CN 117041182 A CN117041182 A CN 117041182A
- Authority
- CN
- China
- Prior art keywords
- server node
- node
- slave server
- time period
- historical time
- 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.)
- Pending
Links
- 238000010187 selection method Methods 0.000 title claims description 7
- 230000004044 response Effects 0.000 claims abstract description 164
- 238000000034 method Methods 0.000 claims abstract description 43
- 230000002159 abnormal effect Effects 0.000 claims abstract description 28
- 238000013480 data collection Methods 0.000 claims abstract description 14
- 230000000737 periodic effect Effects 0.000 claims description 26
- 238000004590 computer program Methods 0.000 claims description 16
- 238000004422 calculation algorithm Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 abstract description 10
- 230000006870 function Effects 0.000 description 8
- 238000012545 processing Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/02—Standardisation; Integration
- H04L41/0246—Exchanging or transporting network management information using the Internet; Embedding network management web servers in network elements; Web-services-based protocols
- H04L41/0273—Exchanging or transporting network management information using the Internet; Embedding network management web servers in network elements; Web-services-based protocols using web services for network management, e.g. simple object access protocol [SOAP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a method, a device, equipment and a medium for selecting a main server node of a distributed component, belonging to the technical field of communication, wherein the method comprises the following steps: under the condition that an original master server node in a target service group is abnormal, sending a data collection request to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes; determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information; and selecting a new main server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node. The invention reduces the randomness of the selection of the new main server node, and improves the stability of the new main server node for providing external service, thereby improving the performance of the whole service group.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, a device, and a medium for selecting a node of a main server of a distributed component.
Background
In a large-scale distributed database product, a management server node and a service group are included, wherein one service group generally includes a master server node and a plurality of slave server nodes, an external service function is provided by the master server node, a data backup function is provided by the slave server nodes, and when the master server node is abnormal, the function of providing external service is taken over by the master server node as a candidate server node. When a normal main server node is absent in the service group, the management server node needs to select a new main server node from all the slave server nodes in the service group to replace the original main server node to provide external service.
However, the existing method for selecting the main server node is generally strong in randomness, and the selected new main server node has poor stability for providing external service, so that the performance of the whole service group is affected.
Disclosure of Invention
The invention provides a method, a device, equipment and a medium for selecting a main server node of a distributed component, which are used for reducing the randomness of the selection of a new main server node and improving the stability of the new main server node for providing external service, thereby improving the performance of the whole service group.
According to an aspect of the present invention, there is provided a method of selecting a primary server node of a distributed component, the method comprising:
under the condition that an original master server node in a target service group is abnormal, sending a data collection request to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes;
determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information;
and selecting a new main server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node.
According to another aspect of the present invention, there is provided a primary server node selection apparatus of a distributed component, the apparatus comprising:
the operation identification information acquisition module is used for sending data collection requests to at least two slave server nodes in the target service group under the condition that the original master server node in the target service group is abnormal so as to acquire operation identification information corresponding to the slave server nodes;
The candidate slave server node determining module is used for determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information;
and the new main server node selection module is used for selecting the new main server node from the at least one candidate slave server node according to the operation response time delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node.
According to another aspect of the present invention, there is provided an electronic apparatus including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of master server node selection of a distributed component of any of the embodiments of the present invention.
According to another aspect of the invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to execute a method of host server node selection for a distributed component embodying any one of the embodiments of the present invention.
According to the technical scheme, under the condition that an original main server node in a target service group is abnormal, a data collection request is sent to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes; determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information; and selecting a new main server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node. According to the technical scheme, under the condition that the original main server node in the target service group is abnormal, according to the running state of the slave server node in the target service group in a certain historical time period, namely by analyzing the operation response time delay ratio and the operation response success rate of the slave server node in the target service group in the historical time period, the new main server node is selected from the slave server nodes in the target service group, the selection randomness of the new main server node is reduced, the stability of the new main server node for providing external service is improved, and therefore the performance of the whole service group is improved.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method for primary server node selection for a distributed component according to a first embodiment of the present invention;
FIG. 2A is a flow chart of a method for primary server node selection for a distributed component according to a second embodiment of the present invention;
FIG. 2B is a flowchart of a method for determining an operation response delay ratio and an operation response success rate of at least two slave server nodes in a target service group in a historical time period according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a primary server node selection apparatus of a distributed component according to a third embodiment of the present invention;
Fig. 4 is a schematic structural diagram of an electronic device implementing a method for selecting a node of a main server of a distributed component according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "target" and "original" and the like in the description of the present invention and the claims and the above-described drawings are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In addition, it should be noted that, in the technical solution of the present invention, the related historical time period and the processes of collection, storage, use, processing, transmission, provision, disclosure, etc. of the request operation in the historical time period all conform to the regulations of the related laws and regulations, and do not violate the public welfare.
Example 1
Fig. 1 is a flowchart of a method for selecting a primary server node of a distributed component according to a first embodiment of the present invention, where the method may be performed by a primary server node selecting device of a distributed component, and the device may be implemented in hardware and/or software, and may be configured in an electronic device, and the electronic device may be a management server. As shown in fig. 1, the method includes:
s101, under the condition that an original master server node in a target service group is abnormal, sending a data collection request to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes.
Wherein the target service group refers to a service group requiring reselection of the primary server node. It should be noted that the target service group includes one master server node and at least two slave server nodes. The master server node is a server node in the target service group that provides an external service function. The slave server node is a server node which provides a data backup function in the target service group and can serve as a candidate server node when the master server node is abnormal and takes over the master server node to provide an external service function. The original main server node refers to the original main server node in the target server. The data collection request refers to a request sent by the management server node to the server node within the target service group to collect historical data from the server node. The operation identification information refers to identification information for responding to a request operation from the server node for uniquely identifying the request operation. Alternatively, the operation identification information may include response time information of responding to the request operation from the server node, content of the request operation, time period identification information in which the request operation is located, broadcasting time of the request operation, and the like. The request operation may be preset according to an actual service requirement, for example, the request operation may be a query operation performed on the database, for example, the request operation may be a rollback operation on data in the database, which is not specifically limited in the embodiment of the present invention. The time period identification information is used to uniquely identify the time period. Alternatively, the time period identification information may be in the form of numbers, letters, or numbers plus letters, etc.
Specifically, under the condition that an original master server node in a target service group is abnormal, a management server node sends a data collection request to at least two slave server nodes in the target service group; each slave server node in the target service group responds to the data collection request sent by the management server node and sends the operation identification information corresponding to the slave server node to the management server node; the management server node receives operation identification information corresponding to each slave server node. It should be noted that one slave server node corresponds to one operation identification information.
S102, determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information.
The candidate slave server node refers to a slave server node which possibly becomes a new master server node instead of the original master server node.
Specifically, the management server node may select, from at least two slave server nodes, the slave server node having a response time within a preset period of time as a candidate slave server node according to response time information of the slave server node in response to the request operation in the operation identification information. It should be noted that, the preset time period may be preset according to an actual service requirement, for example, the preset time period is 5 minutes before the original primary server node in the target service group is abnormal, for example, the preset time period is 10 minutes before the original primary server node in the target service group is abnormal, which is not specifically limited in the embodiment of the present invention.
For example, if the preset time period is 5 minutes before the node of the original main server in the target service group is abnormal, the abnormal time of the node of the original main server in the target service group is 9:00; the management server node may select, from at least two slave server nodes, slave server nodes having response times greater than or equal to 8:55 and less than 9:00 as candidate slave server nodes according to response time information of the slave server nodes responding to the request operation in the respective operation identification information.
S103, selecting a new main server node from the at least one candidate slave server node according to the operation response time delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node.
The historical time period refers to a time period before an original main server node in the target service group is abnormal. Optionally, the duration of the historical time period may be preset according to the actual service requirement, for example, the duration of the historical time period may be 5 minutes, for example, the duration of the historical time period may be 10 minutes, which is not specifically limited in the embodiment of the present invention. Optionally, the number of historical time periods is at least 4, in order to subsequently select the new primary server node more accurately.
The operation response time delay ratio refers to the ratio between the total time delay of node response in the historical time period and the total time delay of successful operation in the historical time period of the slave server node. The total node response delay refers to the total delay of successfully responding to the request operation in the historical time period from the server node. The total time delay for successful periodic operations refers to the total time delay for successful execution of the requested operation during the historical time period.
The operation response success rate refers to the ratio of the total number of node response operations in the historical time period to the total number of period successful operations in the historical time period of the slave server node. The total number of node response operations refers to the total number of successful response request operations from the server node in the historical time period. The total number of successful operations of a cycle refers to the total number of successful execution of the requested operation in a historical time period.
Specifically, the management server node may calculate the sum between the operation response delay ratio and the operation response success rate of each candidate slave server node in the history time period as a candidate sum result; and selecting the largest candidate addition result from the candidate addition results, and taking the candidate slave server node corresponding to the largest candidate addition result as a new master server node so as to enable the new master server node to work in place of the original master server node.
Optionally, the management server node may determine, for each candidate slave server node, a cycle node score of the candidate slave server node in each history time period according to an operation response delay ratio and an operation response success rate of the candidate slave server node in each history time period; determining a target node score corresponding to the candidate slave server node according to the cycle node score of the candidate slave server node in each history time cycle; and selecting a new master server node from at least one candidate slave server node according to the target node score corresponding to each candidate slave server node.
Wherein the cycle node score refers to the score of the candidate slave server node in the historical time cycle. The target node score refers to the sum of the cycle node scores of the candidate slave server nodes in each history time period.
Exemplary, if there are 4 historical time periods, T 1 、T 2 、T 3 And T 4 The method comprises the steps of carrying out a first treatment on the surface of the The management server node uses T for each candidate slave server node 1 For example, if the candidate slave service node is at T 1 The operation response time delay ratio in the method is D, the operation response success rate is R, and the candidate slave service node can be determined at T through the following formula 1 The periodic node score of (a):
S 1 ＝W D ×(1-D)+W R ×R
wherein S is 1 At T for the candidate slave service node 1 Periodic node score, W D To preset time delay ratio weight, W R The success rate weight is preset. It should be noted that the preset time delay ratio weight is smaller than the preset success rate weight; the preset time delay ratio weight and the preset success rate weight can be preset according to actual service requirements, and the embodiment of the invention does not limit the time delay ratio weight and the preset success rate weight specifically, but the sum of the preset time delay ratio weight and the preset success rate weight is required to be ensured to be 1 or 100. Similarly, the candidate slave serving node can be obtained at T 2 Periodic node score S in (1) 2 At T 3 Periodic node score S in (1) 3 At T 4 Periodic node score S in (1) 4 。
It will be appreciated that, for each candidate slave server node, determining the cycle node score of the candidate slave server node in each historical time period according to the operation response delay ratio and the operation response success rate of the candidate slave server node in each historical time period may enable the cycle node score to better reflect the operation state of the candidate slave server node in each historical time period.
Then, the management server node may perform weighted summation on the cycle node scores of the candidate slave server node in each history time period based on a preset weighting algorithm, and use the summation result as a target node score corresponding to the candidate slave server node.
The preset weighting algorithm may be preset according to actual service requirements, which is not specifically limited in the embodiment of the present invention.
Specifically, based on the above example, the management server node determines from the candidate slave server node at T 1 The first preset score weight W in (2) 1 At T 2 The second preset score weight W in (2) 2 At T 3 The third preset score weight W in (2) 3 And at T 4 The fourth preset score weight W 4 And the candidate server node is at T 1 Periodic node score S in (1) 1 At T 2 Periodic node score S in (1) 2 At T 3 Periodic node score S in (1) 3 And at T 4 Periodic node score S in (1) 4 At T for the candidate slave server node 1 、T 2 、T 3 And T 4 The cycle node scores in the 4 historical time periods are weighted and summed, and the summation result is used as the target node score corresponding to the candidate slave server node. Specifically, the target node score corresponding to the candidate slave server node can be determined by the following formula:
score＝W 1 ×S 1 +W 2 ×S 2 +W 3 ×S 3 +W 4 ×S 4
and the score is a target node score corresponding to the candidate slave server node. It should be noted that, the weight values of the first preset score weight, the second preset score weight, the third preset score weight and the fourth preset score weight may be determined according to the distances between the corresponding historical time periods and the current time, or may be set randomly, which is not particularly limited in the embodiment of the present invention, but the sum of the weight values of the first preset score weight, the second preset score weight, the third preset score weight and the fourth preset score weight needs to be 1 or 100. The current time refers to the time when the original main server node in the target service group is abnormal. For example, if the distances from the current time of the historical time period corresponding to the first preset score weight, the second preset score weight, the third preset score weight and the fourth preset score weight are sequentially decreased, i.e., T 1 >T 2 >T 3 >T 4 The weight values of the first preset score weight, the second preset score weight, the third preset score weight and the fourth preset score weight are sequentially increased, namely W 1 <W 2 <W 3 <W 4 . Similarly, the management server node can obtain the target node score corresponding to each candidate slave server node.
Further, the management server node extracts the highest target node score from the target node scores corresponding to the candidate slave server nodes; and taking the candidate slave server node corresponding to the highest target node score as a new master server node.
It should be noted that, if the highest target node score corresponds to at least two candidate slave server nodes, the management server node may randomly select one candidate slave server node from the candidate slave server nodes as the new master server node.
Optionally, if the highest target node score corresponds to at least two candidate slave server nodes, the management server node may further select, from the candidate slave server nodes, the candidate slave server node with the highest period node score as the new master server node according to the period node scores of the candidate slave server nodes in the last historical time period. The latest historical time period refers to the historical time period closest to the current time among all the historical time periods. The current time refers to the time when the original main server node in the target service group is abnormal.
Optionally, after the management server node selects a new master server node from the slave server nodes in the target service group, the management server node may also broadcast information of the new master server node to other slave server nodes in the target service group except the new master server node.
According to the technical scheme, under the condition that an original main server node in a target service group is abnormal, a data collection request is sent to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes; determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information; and selecting a new main server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node. According to the technical scheme, under the condition that the original main server node in the target service group is abnormal, according to the running state of the slave server node in the target service group in a certain historical time period, namely by analyzing the operation response time delay ratio and the operation response success rate of the slave server node in the target service group in the historical time period, the new main server node is selected from the slave server nodes in the target service group, the selection randomness of the new main server node is reduced, the stability of the new main server node for providing external service is improved, and therefore the performance of the whole service group is improved.
Example two
Fig. 2A is a flowchart of a method for selecting a master server node of a distributed component according to a second embodiment of the present invention, where the embodiment provides an implementation manner of determining an operation response delay ratio and an operation response success rate of at least two slave server nodes in a target service group in a historical time period according to response operation conditions of the slave server nodes in the historical time period before an abnormality of an original master server node in the target service group based on the above embodiment. In the embodiments of the present invention, parts not described in detail may be referred to for related expressions of other embodiments. As shown in fig. 2A, the method includes:
s201, according to response operation conditions of the slave server nodes in the historical time period, determining operation response time delay ratio and operation response success rate of at least two slave server nodes in the target service group in the historical time period.
The historical time period refers to a time period before an original main server node in the target service group is abnormal. Optionally, the duration of the historical time period may be preset according to the actual service requirement, for example, the duration of the historical time period may be 5 minutes, for example, the duration of the historical time period may be 10 minutes, which is not specifically limited in the embodiment of the present invention. Optionally, the number of historical time periods is at least 4, in order to subsequently select the new primary server node more accurately.
Wherein, the response operation condition refers to the condition of responding to the request operation from the server node in the historical time period; the response operation condition may include a case where the slave server node successfully responds to the request operation and a case where the slave server node does not respond to the request operation.
The operation response time delay ratio refers to the ratio between the total time delay of node response in the historical time period and the total time delay of successful operation in the historical time period of the slave server node. The total node response delay refers to the total delay of successfully responding to the request operation in the historical time period from the server node. The total time delay for successful periodic operations refers to the total time delay for successful execution of the requested operation during the historical time period.
The operation response success rate refers to the ratio of the total number of node response operations in the historical time period to the total number of period successful operations in the historical time period of the slave server node. The total number of node response operations refers to the total number of successful response request operations from the server node in the historical time period. The total number of successful operations of a cycle refers to the total number of successful execution of the requested operation in a historical time period.
Optionally, the operation response delay ratio and the operation response success rate of at least two slave server nodes in the target service group in the historical time period can be determined according to the response operation condition of the slave server nodes in the historical time period by the following steps (see fig. 2B):
S1, for each request operation of each historical time period, determining the operation state of the request operation according to the target number of at least two slave server nodes in a target service group responding to the request operation.
The request operation may be preset according to an actual service requirement, for example, the request operation may be a query operation performed on the database, for example, the request operation may be a rollback operation on data in the database, which is not specifically limited in the embodiment of the present invention. For each request operation per historical time period, the target number refers to the number of slave server nodes within the target service group that responded to the request operation. The operation state refers to a state of requesting an operation, and may include an unexecuted state, an executing state, an execution success state, and an execution failure state.
Alternatively, for each request operation of each historical time period, the target number of at least two slave server nodes in the target service group responding to the request operation may be compared with the total number of nodes of the slave server nodes in the target service group, and the operation state of the request operation may be determined according to the comparison result.
Specifically, for each request operation of each historical time period, the target number of slave server nodes in the target service group responding to the request operation in the preset time can be compared with the total number of nodes of the slave server nodes in the target service group; if the target number is greater than the preset proportional number of the total number of the nodes, determining that the operation state of the request operation is an execution success state, otherwise, determining that the operation state of the request operation is an execution failure state. It should be noted that, the preset time may be preset according to an actual service requirement, for example, the preset time may be 1 second, which is not specifically limited in the embodiment of the present invention. The preset proportion number may be preset according to the actual service requirement, for example, the preset proportion number may be one half of the total number of nodes, for example, the preset proportion number may be two thirds of the total number of nodes, which is not specifically limited in the embodiment of the present invention.
Exemplary, if the historical time period is T 1 The preset time is 1 second, aiming at T 1 In request operation p 1 If response p within 1 second 1 The target number of the slave server nodes in the target service group is 8, the total number of the slave server nodes in the target service group is 10, and the preset proportion number is half of the total number of the nodes, namely the preset proportion number is 5; comparing the target number with the total number of nodes, determining T if the target number is greater than the preset proportional number 1 Request for operation p 1 Is an execution success state.
It can be understood that, for each request operation of each historical time period, the operation state of the request operation is determined according to the number of slave server nodes responding to the request operation in the target service group within a preset time, so that the obtained operation state of the request operation is more accurate and reliable.
S2, determining the total node response time delay and the total node response operation times of at least two slave server nodes in the historical time period according to the operation state of each request operation in the historical time period, and determining the total period successful operation time delay and the total period successful operation times of the historical time period.
The total node response delay refers to the total delay of successfully responding to the request operation in the historical time period from the server node. The total number of node response operations refers to the total number of successful response request operations from the server node in the historical time period. The total time delay for successful periodic operations refers to the total time delay for successful execution of the requested operation during the historical time period. The total number of successful operations of a cycle refers to the total number of successful execution of the requested operation in a historical time period.
Specifically, according to the execution success state of each request operation in the historical time period, the total node response time delay and the total node response operation times of at least two slave server nodes in the historical time period can be determined, and the total period success operation time delay and the total period success operation times of the historical time period can be determined.
Optionally, for each request operation in the historical time period, when the operation state of the request operation is the successful execution state, determining node response time delay of the slave server node for responding to the request operation according to response time of at least two slave server nodes for responding to the request operation and broadcasting time of the request operation, and updating total times of node response operations of the slave server node in the historical time period; determining the node response total time delay of at least two slave server nodes in the historical time period according to the node response time delay and the node response historical time delay of the slave server nodes; determining the total number of successful periodic operation in the historical time period according to the operation state of the request operation and the historical number of successful periodic operation in the historical time period, and recording the successful operation time when the operation state is the successful execution state; determining the operation time delay of the request operation according to the successful operation time and the broadcasting time; and determining the total time delay of the successful periodic operation of the historical time period according to the historical time delay and the operation time delay of the successful periodic operation of the historical time period.
The response time refers to the time from the server node to the request operation. The broadcast time refers to the time at which the request operation is broadcast to the slave server node. The node response delay refers to a response delay from the server node to the request operation. The node response history delay refers to the total response delay from the server node before responding to the request operation in the history time period. The cycle successful operation history number refers to the number of operations of the history time period before the request operation is successfully executed. The operation success time refers to the time when the request operation is successfully executed. The operation delay refers to the time period that it takes for the requested operation to execute successfully. The cycle successful operation history latency refers to the total latency of the history time period before the request operation is successfully performed.
Specifically, for each request operation in the historical time period, taking a certain slave server node as an example, calculating a difference between a response time of the slave server node responding to the request operation and a broadcast time of the request operation under the condition that the operation state of the request operation is an execution success state, taking the difference as a node response time delay of the slave server node responding to the request operation, and adding one to the total number of node response operations of the slave server node in the historical time period; and carrying out summation operation on the node response time delay and the node response history time delay of the slave server node, and taking the summation result as the node response total time delay of the slave server node in the history time period. And similarly, the total times of node response operation and the total time delay of node response of each slave server node in the target service group in the historical time period can be obtained.
Meanwhile, aiming at each request operation in the historical time period, under the condition that the operation state of the request operation is the execution success state, the historical times of the period success operation in the historical time period are increased by one to obtain the total times of the period success operation in the historical time period, and the operation success time of the request operation in the execution success state is recorded; and when the operation state of the request operation is the execution failure state, the history number of successful operations of the history time period is used as the total number of successful operations of the history time period.
Then, calculating a difference value between the successful operation time and the broadcasting time, and taking the difference value as the operation time delay of the request operation; and taking the summation result between the period successful operation historical time delay and the operation time delay of the historical time period as the period successful operation total time delay of the historical time period.
It can be understood that, for each historical time period, the total node response time delay and the total node response operation times of at least two slave server nodes in the target service group in each historical time period are determined only according to the data when the request operation is successfully executed in the historical time period, and the total period successful operation time delay and the total period successful operation times of each historical time period are determined, so that the analysis amount of the data in each historical time period is reduced, and the calculation efficiency is improved.
S3, aiming at each slave server node, determining the operation response time delay ratio of the slave server node in each historical time period according to the node response total time delay of the slave server node in each historical time period and the period successful operation total time delay of each historical time period.
Specifically, taking a certain historical time period as an example for each slave server node, taking the ratio of the total node response time delay of the slave server node in the historical time period to the total period successful operation time delay of the historical time period as the operation response time delay ratio of the slave server node in the historical time period; the operation response delay ratio of the slave server node in the historical time period is determined by the following formula:
wherein d is the operation response delay ratio of the slave server node in the history time period, d 1 At the historical time for the slave server nodeThe node response total time delay of period d 2 The total delay is successfully operated for the period of the historical time period. Similarly, the operation response time delay ratio of the slave server node in each historical time period can be obtained. Further, the operation response time delay ratio of each slave server node in each history time period can be obtained.
S4, determining the operation response success rate of the slave server node in each historical time period according to the total number of node response operations of the slave server node in each historical time period and the total number of period successful operations of each historical time period.
Specifically, taking a certain historical time period as an example for each slave server node, taking the ratio of the total number of node response operations of the slave server node in the historical time period to the total number of period successful operations of the historical time period as the operation response success rate of the slave server node in the historical time period; the operation response success rate of the slave server node in the historical time period can be determined by the following formula:
wherein r is the operation response success rate of the slave server node in the history time period, r 1 A total number of node response operations for the slave server node in the history time period, r 2 A total number of successful operations for a period of the historical time period. Similarly, the operation response success rate of the slave server node in each historical time period can be obtained. Further, the operation response success rate of each slave server node in each history time period can be obtained.
S202, under the condition that an original master server node in a target service group is abnormal, sending a data collection request to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes.
S203, determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information.
S204, selecting a new main server node from the at least one candidate slave server node according to the operation response time delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node.
The technical scheme of the embodiment of the invention provides a technical scheme for determining the operation response time delay ratio and the operation response success rate of at least two slave server nodes in a target service group in the history time period according to the response operation condition of the slave server nodes in the history time period before the original master server nodes in the target service group are abnormal, and the accuracy of the preparation data for selecting a new master server node for the target service group by periodically counting the operation response time delay ratio and the operation response success rate of each slave server node in the target service group is ensured, and the accuracy of the subsequent selection of the new master server node is improved by managing the server nodes under the condition that the original master server nodes in the target service group are abnormal.
Example III
Fig. 3 is a schematic structural diagram of a device for selecting a main server node of a distributed component according to a third embodiment of the present invention, where the device may be implemented in hardware and/or software and may be configured in an electronic device, and the electronic device may be a management server, where the device is applicable to a case that the distributed component in a large-scale distributed database reselects the main server node. As shown in fig. 3, the apparatus includes:
the operation identification information obtaining module 301 is configured to send a data collection request to at least two slave server nodes in the target service group to obtain operation identification information corresponding to the slave server nodes in the case that the original master server node in the target service group is abnormal;
a candidate slave server node determining module 302, configured to determine at least one candidate slave server node from at least two slave server nodes according to the operation identification information;
the new master server node selection module 303 is configured to select a new master server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period, so that the new master server node works in place of the original master server node.
According to the technical scheme, under the condition that an original main server node in a target service group is abnormal, a data collection request is sent to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes; determining at least one candidate slave server node from at least two slave server nodes according to the operation identification information; and selecting a new main server node from the at least one candidate slave server node according to the operation response delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node. According to the technical scheme, under the condition that the original main server node in the target service group is abnormal, according to the running state of the slave server node in the target service group in a certain historical time period, namely by analyzing the operation response time delay ratio and the operation response success rate of the slave server node in the target service group in the historical time period, the new main server node is selected from the slave server nodes in the target service group, the selection randomness of the new main server node is reduced, the stability of the new main server node for providing external service is improved, and therefore the performance of the whole service group is improved.
Optionally, the new primary server node selection module 303 includes:
a period node score determining unit, configured to determine, for each candidate slave server node, a period node score of the candidate slave server node in each historical time period according to an operation response delay ratio and an operation response success rate of the candidate slave server node in each historical time period;
a target node score determining unit, configured to determine a target node score corresponding to the candidate slave server node according to the cycle node score of the candidate slave server node in each history time cycle;
and the new main server node selection unit is used for selecting the new main server node from at least one candidate slave server node according to the target node score corresponding to each candidate slave server node.
Optionally, the target node score determining unit is specifically configured to:
and carrying out weighted summation on the periodic node scores of the candidate slave server nodes in each historical time period based on a preset weighting algorithm, and taking the summation result as a target node score corresponding to the candidate slave server node.
Optionally, the apparatus further comprises:
and the delay ratio and success rate determining module is used for determining the operation response delay ratio and the operation response success rate of at least two slave server nodes in the target service group in the historical time period according to the response operation condition of the slave server nodes in the historical time period before the original master server node in the target service group is abnormal.
Optionally, the delay ratio and success rate determining module includes:
an operation state determining unit, configured to determine, for each request operation of each historical time period, an operation state of the request operation according to a target number of at least two slave server nodes in a target service group responding to the request operation;
the data determining unit is used for determining the total node response time delay and the total node response operation times of at least two slave server nodes in the historical time period according to the operation state of each request operation in the historical time period, and determining the total period successful operation time delay and the total period successful operation times of the historical time period;
an operation response time delay ratio determining unit, configured to determine, for each slave server node, an operation response time delay ratio of the slave server node in each historical time period according to a total node response time delay of the slave server node in each historical time period and a total period successful operation time delay of each historical time period;
and the operation response success rate determining unit is used for determining the operation response success rate of the slave server node in each historical time period according to the total number of node response operations of the slave server node in each historical time period and the total number of period successful operations of each historical time period.
Optionally, the operation state determining unit is specifically configured to:
for each request operation of each historical time period, comparing the target number of at least two slave server nodes in a target service group responding to the request operation with the total number of the slave server nodes in the target service group, and determining the operation state of the request operation according to the comparison result.
Optionally, the data determining unit is specifically configured to:
for each request operation in the historical time period, under the condition that the operation state of the request operation is the successful execution state, determining node response time delay of the slave server node for responding to the request operation according to response time of at least two slave server nodes for responding to the request operation and broadcasting time of the request operation, and updating total times of node response operation of the slave server node in the historical time period;
determining the node response total time delay of at least two slave server nodes in the historical time period according to the node response time delay and the node response historical time delay of the slave server nodes;
determining the total number of successful periodic operation in the historical time period according to the operation state of the request operation and the historical number of successful periodic operation in the historical time period, and recording the successful operation time when the operation state is the successful execution state;
Determining the operation time delay of the request operation according to the successful operation time and the broadcasting time;
and determining the total time delay of the successful periodic operation of the historical time period according to the historical time delay and the operation time delay of the successful periodic operation of the historical time period.
The device for selecting the main server node of the distributed component provided by the embodiment of the invention can execute the method for selecting the main server node of the distributed component provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of executing the method for selecting the main server node of each distributed component.
Example IV
Fig. 4 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 4, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM12 and the RAM13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.
Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as the main server node selection method of the distributed component.
In some embodiments, the primary server node selection method of the distributed component may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM12 and/or the communication unit 19. When the computer program is loaded into RAM13 and executed by processor 11, one or more steps of the main server node selection method of the distributed component described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the primary server node selection method of the distributed component in any other suitable manner (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.
The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method of master server node selection for a distributed component, applied to a management server node that is a third party server node independent of a target service group, the method comprising:
under the condition that an original master server node in the target service group is abnormal, sending a data collection request to at least two slave server nodes in the target service group so as to acquire operation identification information corresponding to the slave server nodes;
Determining at least one candidate slave server node from the at least two slave server nodes according to the operation identification information;
and selecting a new main server node from the at least one candidate slave server node according to the operation response time delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work in place of the original main server node.
2. The method of claim 1, wherein selecting a new master server node from the at least one candidate slave server node based on the operational response delay ratio and the operational response success rate of the at least one candidate slave server node over the historical time period comprises:
determining, for each candidate slave server node, a cycle node score of the candidate slave server node in each historical time period according to the operation response delay ratio and the operation response success rate of the candidate slave server node in each historical time period;
determining a target node score corresponding to the candidate slave server node according to the cycle node score of the candidate slave server node in each history time cycle;
And selecting a new master server node from the at least one candidate slave server node according to the target node score corresponding to each candidate slave server node.
3. The method according to claim 2, wherein determining the target node score corresponding to the candidate slave server node according to the cycle node score of the candidate slave server node in each history time period comprises:
and carrying out weighted summation on the periodic node scores of the candidate slave server nodes in each historical time period based on a preset weighting algorithm, and taking the summation result as a target node score corresponding to the candidate slave server node.
4. The method of claim 1, further comprising, prior to the anomaly of the original primary server node within the target service group:
and determining the operation response time delay ratio and the operation response success rate of at least two slave server nodes in the target service group in the historical time period according to the response operation condition of the slave server nodes in the historical time period.
5. The method of claim 4, wherein determining the operational response delay ratio and the operational response success rate of at least two slave server nodes in the target service group in the historical time period according to the response operation condition of the slave server nodes in the historical time period comprises:
For each request operation of each historical time period, determining the operation state of the request operation according to the target number of at least two slave server nodes in the target service group responding to the request operation;
determining the total node response time delay and the total node response operation times of the at least two slave server nodes in the historical time period according to the operation state of each request operation in the historical time period, and determining the total period successful operation time delay and the total period successful operation times of the historical time period;
for each slave server node, determining the operation response time delay ratio of the slave server node in each historical time period according to the node response total time delay of the slave server node in each historical time period and the period successful operation total time delay of each historical time period;
and determining the operation response success rate of the slave server node in each historical time period according to the total number of node response operations of the slave server node in each historical time period and the total number of period successful operations of each historical time period.
6. The method of claim 5, wherein for each requested operation per historical time period, determining the operational status of the requested operation based on the target number of at least two slave server nodes within the target service group that responded to the requested operation comprises:
For each request operation of each historical time period, comparing the target number of at least two slave server nodes in the target service group responding to the request operation with the total number of the slave server nodes in the target service group, and determining the operation state of the request operation according to the comparison result.
7. The method of claim 5, wherein determining the total node response delay and the total number of node response operations for the at least two slave server nodes in the historical time period and determining the total period successful operation delay and the total number of period successful operations for the historical time period based on the operational status of each requested operation in the historical time period comprises:
for each request operation in the historical time period, under the condition that the operation state of the request operation is the successful execution state, determining node response time delay of the slave server node responding to the request operation according to response time of the at least two slave server nodes responding to the request operation and broadcasting time of the request operation, and updating total times of node response operation of the slave server node in the historical time period;
Determining the node response total delay of the at least two slave server nodes in the history time period according to the node response delay and the node response history delay of the slave server nodes;
determining the total number of successful periodic operation in the historical time period according to the operation state of the request operation and the historical number of successful periodic operation in the historical time period, and recording the successful operation time when the operation state is the successful execution state;
determining the operation time delay of the request operation according to the operation success time and the broadcasting time;
and determining the total time delay of the successful periodic operation of the historical time period according to the historical time delay of the successful periodic operation of the historical time period and the operation time delay.
8. A primary server node selection apparatus of a distributed component, performed by a management server node, the management server node being a third party server node independent of a target service group, comprising:
the operation identification information acquisition module is used for sending data collection requests to at least two slave server nodes in the target service group under the condition that the original master server node in the target service group is abnormal so as to acquire operation identification information corresponding to the slave server nodes;
A candidate slave server node determining module, configured to determine at least one candidate slave server node from the at least two slave server nodes according to the operation identification information;
and the new main server node selection module is used for selecting a new main server node from the at least one candidate slave server node according to the operation response time delay ratio and the operation response success rate of the at least one candidate slave server node in the historical time period so as to enable the new main server node to work instead of the original main server node.
9. An electronic device, the electronic device comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the primary server node selection method of the distributed component of any one of claims 1-7.
10. A computer readable storage medium storing computer instructions for causing a processor to perform the method of primary server node selection of a distributed component according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311050373.5A CN117041182A (en) | 2023-08-21 | 2023-08-21 | Main server node selection method, device, equipment and medium of distributed component |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311050373.5A CN117041182A (en) | 2023-08-21 | 2023-08-21 | Main server node selection method, device, equipment and medium of distributed component |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117041182A true CN117041182A (en) | 2023-11-10 |
Family
ID=88629747
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311050373.5A Pending CN117041182A (en) | 2023-08-21 | 2023-08-21 | Main server node selection method, device, equipment and medium of distributed component |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117041182A (en) |
-
2023
- 2023-08-21 CN CN202311050373.5A patent/CN117041182A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114500339B (en) | Node bandwidth monitoring method and device, electronic equipment and storage medium | |
| CN115373888A (en) | Fault positioning method and device, electronic equipment and storage medium | |
| CN116049146A (en) | Database fault processing method, device, equipment and storage medium | |
| CN114547069A (en) | Data query method and device, electronic equipment and storage medium | |
| CN116567077A (en) | Bare metal instruction sending method, device, equipment and storage medium | |
| CN116661960A (en) | Batch task processing method, device, equipment and storage medium | |
| CN117041182A (en) | Main server node selection method, device, equipment and medium of distributed component | |
| CN115794473A (en) | Root cause alarm positioning method, device, equipment and medium | |
| CN114999665A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN114500443A (en) | Message pushing method, device, system, electronic equipment and storage medium | |
| CN114186123A (en) | Processing method, device and equipment for hotspot event and storage medium | |
| CN116719621B (en) | Data write-back method, device, equipment and medium for mass tasks | |
| CN117640521A (en) | Transaction flow determination method, device, equipment and storage medium | |
| CN117076185B (en) | Server inspection method, device, equipment and medium | |
| CN116662788B (en) | Vehicle track processing method, device, equipment and storage medium | |
| CN115563015B (en) | Code heat statistics method, device, equipment and storage medium | |
| CN117493342B (en) | Commodity data updating method, commodity data updating device, electronic equipment and storage medium | |
| CN113225228B (en) | Data processing method and device | |
| CN117806969A (en) | Service testing method, device, equipment and medium | |
| CN117667938A (en) | Database index updating method, device, equipment and storage medium | |
| CN117608879A (en) | Message queue processing method and device, electronic equipment and storage medium | |
| CN118132533A (en) | Data processing method, device, equipment and storage medium | |
| CN117611139A (en) | Method and device for determining equipment operation and maintenance strategy, electronic equipment and storage medium | |
| CN117573436A (en) | Backup method, device, equipment and storage medium | |
| CN117592618A (en) | Active user prediction method, device, server 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 |