CN110908776A - Timed task execution method, related device and computer readable storage medium - Google Patents
Timed task execution method, related device and computer readable storage medium Download PDFInfo
- Publication number
- CN110908776A CN110908776A CN201811081486.0A CN201811081486A CN110908776A CN 110908776 A CN110908776 A CN 110908776A CN 201811081486 A CN201811081486 A CN 201811081486A CN 110908776 A CN110908776 A CN 110908776A
- Authority
- CN
- China
- Prior art keywords
- database
- timing task
- task
- node
- execution
- 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
- 238000000034 method Methods 0.000 title claims abstract description 84
- 230000008569 process Effects 0.000 claims abstract description 34
- 238000012544 monitoring process Methods 0.000 claims abstract description 12
- 238000004590 computer program Methods 0.000 claims description 3
- 239000000126 substance Substances 0.000 claims 1
- 230000002159 abnormal effect Effects 0.000 abstract description 3
- 230000007547 defect Effects 0.000 abstract 1
- 230000006870 function Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 4
- 238000004140 cleaning Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/485—Task life-cycle, e.g. stopping, restarting, resuming execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention relates to the field of cloud computing, and discloses a method and a device for executing a timing task, electronic equipment and a computer-readable storage medium. The embodiment of the invention provides a method for executing a timing task, which comprises the following steps: determining that the overtime happens in the process of monitoring the timing task of the database executed by the second node, and preempting the execution right of the timing task of the database; and executing the timing task of the database after determining the execution right of the timing task of the database. By using the technical scheme provided by the invention, under the condition that the state of one node is abnormal, other nodes can preempt the execution right of the timing task of the database, thereby ensuring that the timing task of the database can be normally and reliably executed. Therefore, the defects caused by abnormal node states are effectively avoided, and the user experience is greatly improved.
Description
Technical Field
The embodiment of the invention relates to the field of cloud computing, in particular to a timing task execution method, a related device and a computer readable storage medium.
Background
The cloud computing platform can provide the following four services: computing services, network and storage services, DataBase services (DBaaS). Among them, the reliability, convenience and rapidness of DBaaS are more and more important, and have become an important service for creating value for customers by a cloud computing platform. For the Openstack of the open source cloud computing platform, DBaaS is added and named as a Trove database management component.
At present, the open source cloud computing platform Openstack Trove database management component has become one of Openstack official selectable core service components. The normal and stable operation of the Trove database management component is the basis for ensuring the good experience of the user.
The inventor finds that at least the following problems exist in the prior art: the reliable execution of the timing function of the Trove database management component depends on the parameters in the configuration file of the Trove database management component, only the node configured with the TRUE parameters can execute the timing task of the database, and if the node is abnormal in state, the timing task of the database cannot be executed normally and reliably.
Disclosure of Invention
The invention aims to provide a timing task execution method, a related device and a computer readable storage medium, which are used for ensuring that a timing task of a database is normally and reliably executed.
In order to solve the above technical problem, an embodiment of the present invention provides a method for executing a timing task, where the method includes: determining that the overtime happens in the process of monitoring the timing task of the database executed by the second node, and preempting the execution right of the timing task of the database; and executing the timing task of the database after determining the execution right of the timing task of the database.
An embodiment of the present invention further provides an apparatus for executing a timed task, including: the preemption module is used for determining that the overtime happens in the process of monitoring the timing task of the database executed by the second node and preempting the execution right of the timing task of the database; and the execution module is used for executing the timing task of the database after determining the execution right of the timing task of the database.
One embodiment of the present application provides a server, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the above-described method of performing timed tasks.
One embodiment of the present application provides a computer-readable storage medium storing computer instructions for causing a computer to perform the above-described method for timing task execution.
Compared with the prior art, the method and the device have the advantages that the first node monitors whether the timed task of the database is overtime in the process of being executed by the second node, so that the overtime condition of the timed task of the database can be found in time, the execution right of the timed task of the database is preempted under the condition that the overtime condition is determined, and the timed task of the database is executed after the execution right is determined, so that the condition that the timed task of the database cannot be normally executed when the node executing the timed task of the database fails is avoided, and the timed task of the database is ensured to be normally and reliably executed.
In addition, determining that the timed task monitoring the database has timed out in the process of being executed by the second node comprises: monitoring the time when the timing task of the database is updated last time in the process that the timing task of the database is executed by a second node; calculating the difference value between the latest updated time and the current time; and if the difference value is determined to exceed the preset threshold value, determining that the timing task of the database is overtime in the process of being executed by the second node. By monitoring the latest update time of the timing task of the database, the overtime condition of the timing task of the database can be timely found.
Additionally, monitoring the time at which the database's timed task was last updated includes: and reading the latest updated time of the timing task of the database every a first preset time interval, wherein the first preset time interval is less than the preset threshold.
In addition, preempting the execution right of the timing task of the database includes: modifying the identifier of the execution node corresponding to the timing task of the database into the identifier of the first node; determining to obtain execution rights for timed tasks of the database, comprising:
and determining that the identifier of the execution node corresponding to the timing task of the database is the identifier of the first node. By setting the identifier of the execution node corresponding to the timing task of the database, all nodes with execution capacity in the system can know the attribution of the execution authority of the timing task with the database at present.
In addition, after determining that the execution right of the timing task of the database is obtained and before executing the timing task of the database, the method further includes: and modifying the state of the timing task of the database into a preparation execution state, wherein the preparation execution state indicates that the timing task of the database has obtained the execution right. In the method, after the execution right of the timing task of the database is determined to be obtained, the state of the timing task of the database is updated to a pre-execution state, so that preparation is made for the subsequent execution of the timing task of the database, and other nodes can acquire the state of the timing task of the database.
In addition, after determining to obtain the execution right of the timing task of the database, the method further includes: and updating the time of the timing task of the database every interval of a second preset time. The node which obtains the execution right of the timing task of the database updates the time of the timing task of the database regularly, so that other nodes can know whether the timing task of the data is normally executed or not in time according to the time of updating the timing task of the database, and the timing task of the database is preempted in time under the condition that the timing task is not normally executed.
Additionally, performing timed tasks of the database includes: and modifying the state of the timing task of the database into an execution state, and running the timing task of the database.
In addition, in the process of running the timed task of the database, if it is detected that the identifier of the executing node corresponding to the timed task of the database is not the identifier of the first node and it is determined that the timed task of the database is included in the task list of the first node, the running of the timed task of the database is stopped. And after the execution right of the timing task of the database is determined to be lost in the running process, the timing task of the database is cleared from the task list in time, and the resources occupied by executing the timing task of the database are released in time, so that the reasonable utilization of the resources is ensured.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the figures in which like reference numerals refer to similar elements and which are not to scale unless otherwise specified.
FIG. 1 is a flow chart illustrating a method for executing a timed task according to a first embodiment of the present invention;
FIG. 2 is a flow chart illustrating a method for executing a timed task according to a second embodiment of the present invention;
FIG. 3 is a schematic diagram of a device for executing a timed task according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments.
The first embodiment of the invention relates to a method for executing a timing task, and a first node and a second node are control nodes with functions of executing the timing task of a database, for example, the first node and the second node are both control nodes with deployed trove database management components. The second node is a node that is performing the timing task of the database, and the first node may be any control node other than the second node and having a function of performing the timing task of the database. It should be noted that, only one first node is taken as an example for description, in an application, all nodes except the second node may be configured to execute the execution method of the timing task, or some nodes except the second node may be configured to execute the execution method of the timing task.
As shown in fig. 1, the execution process of the timing task is specifically as follows:
in step 101, the first node monitors that the second node times out in the process of executing the timed task of the database, and then preempts the execution right of the timed task of the database.
Wherein, the timing task of the database refers to: creating database backup at regular time, cleaning backup exceeding the storage time at regular time, cleaning log files of the database at regular time, checking the state of the instance at regular time and the like. It should be noted that, the present invention is only for illustration, and the timing task of other un-listed databases is also within the scope of the present invention, and the present invention is not limited herein.
In a specific implementation, the first node monitors whether the second node is overtime in the process of executing the timed task of the database, and the specific judgment process of whether the second node is overtime is as follows: in the process that the timing task of the database is executed by the second node, the first node monitors the latest time when the timing task of the database is updated, calculates the difference between the latest time and the current time, and determines that the timing task of the database is overtime in the process of being executed by the second node if the difference is determined to exceed a preset threshold.
And reading the latest updated time of the timing task of the database every time a first preset time interval is formed by the first node, wherein the first preset time interval is less than a preset threshold value used for judging whether the time is overtime. For example: the method comprises the steps of defining a first preset time length as 10 seconds in advance, and defining a preset threshold value as 60 seconds, namely reading the latest updated time of a timing task of the database every 10 seconds, calculating the difference value between the latest updated time and the current time, and judging whether the difference value exceeds 60 seconds. And if the difference exceeds a preset threshold, determining that the timing task of the database is overtime in the process of being executed by the second node. It should be noted that other values of the first preset time period and the preset threshold may also be adopted, which are only for illustration, and other values not listed are also within the scope of the present invention, and are not used to limit the scope of the present invention.
And the second node updates the time of the timing task of the database once every second preset time interval in the process of executing the timing task of the database, and stores the latest updated time of the timing task of the database in the database table. The significance of the update time is heartbeat detection, and when the second node updates the time of the timing task of the database, the timing task of the database can be executed by the second node normally and reliably.
For example: under an Openstack database cloud platform, on a control node of a database with a Trove component, updating the time of a timing task of the database once every second preset time interval by the control node, and storing the latest updated time of the timing task of the database into a crontabs table of the database.
The second preset duration may be equal to or different from the first preset duration. The second preset duration is less than a preset threshold for judging whether the time is out. In a preferred implementation, the second preset time period is less than or equal to the first preset time period. For example: the first preset time is defined in advance to be 10 seconds, the second preset time is defined to be 10 seconds, and the time is the time that the second node updates the timing task of the database every 10 seconds. Of course, the first preset time period may be an integral multiple of the second preset time period, for example, the first preset time period is defined as 10 seconds, and the second preset time period is defined as 5 seconds. It should be noted that the above-mentioned embodiments are merely examples, and other values not listed are within the scope of the present invention, and are not limited herein.
The process that the first node occupies the execution right of the timing task of the database comprises the following steps: and the first node modifies the identifier of the execution node corresponding to the timing task of the database into the identifier of the first node. And if the first node determines that the executing node identifier corresponding to the timing task of the database is changed to the identifier of the first node, determining that the executing right of the timing task of the database is preempted.
The preemption protection mechanism is used for ensuring that only one control node can successfully modify the identifier of the execution node corresponding to the timing task of the database in a preemption process. The preemption protection mechanism may be implemented in a variety of ways, and a specific form of the preemption protection mechanism is described below by way of example.
For example, the preemption protection mechanism is implemented as follows: if it is determined that the first node firstly modifies the identifier of the executing node corresponding to the timing task of the database into the identifier of the first node, other control nodes are not allowed to modify the identifier of the executing node corresponding to the timing task of the database in the preemption process, and other control nodes can only monitor the preemption process of the next time. Assuming that the identifier of the first node is 10011, the identifier of the third node is 10033, and when it is determined that the first node first modifies the identifier of the executing node corresponding to the timing task of the database to 10011, in the process of this preemption, the third node is not allowed to modify the identifier of the executing node corresponding to the timing task of the database, which means that the executing right of the timing task of the database is preempted by the first node.
For another example, in a preemption process, the identifier of each control node participating in preemption is saved according to the sequence of writing identifiers by each control node participating in preemption in the identifier list corresponding to the timing task in the database, and assuming that the identifier 10011 of the first node and the identifier 10033 of the third node are written in the identifier list corresponding to the timing task in the database according to the sequence, only the identifier of the control node written first in the identifier list is reserved, that is, the identifier of the first node written first in the identifier list is reserved, and the identifier of the third node is deleted. The identifier of the control node finally retained in the identifier list is the identifier of the control node that preempts the execution right of the timing task in the database, i.e. the identifier of the execution node of the timing task in the database is 10011. It should be noted that, this is only an example, and other methods for setting the identifier of the timing task of the non-listed database are also within the scope of the present invention, and this is not used to limit the scope of the present invention.
In step 102, after determining that the execution right of the timing task of the database is obtained, the first node executes the timing task of the database.
In one specific implementation, after the first node determines to obtain the execution right of the timing task of the database, the state of the timing task of the database is modified to a preparation execution state, which indicates that the first node has obtained the execution right of the timing task of the database at this time, and the timing task of the database can be executed.
In one specific implementation, the timing task of the database is defined into three states, which are respectively: a ready state, a ready-to-execute state, and an execute state.
When the state of the timing task of the database is the preparation state, all the control nodes with the function of executing the timing task of the database can preempt the execution right of the timing task of the database. By setting the identifier of the execution node corresponding to the timing task of the database, all nodes with execution capacity in the system can acquire the attribution of the execution authority of the timing task of the database.
When the state of the timing task of the database is a preparation execution state, and the identifier of the execution node corresponding to the timing task of the database is the identifier of the first node, indicating that the first node is ready to execute the timing task of the database, the timing task of the database can be started to be executed. In this way, it can be ensured that each surviving node can detect the status of the timed tasks of the database.
When the state of the timing task of the database is the execution state, the first node indicates that the first node has successfully preempted the execution right of the timing task of the database and is in the process of executing the timing task of the database.
It should be noted that, the definition of the state of the timed task of the database is only an example, and in an application, the state of the timed task of the database may be defined according to needs, and this is not used to limit the scope of the present invention.
In the embodiment of the application, the first node monitors whether the timed task of the database is overtime in the process of being executed by the second node, so that the overtime condition of the timed task of the database can be found in time, and the execution right of the timed task of the database is preempted under the condition that the overtime condition is determined. The timing task of the database is executed after the execution right is determined, so that the condition that the timing task of the database cannot be normally executed when a node executing the timing task of the database fails is avoided, and the timing task of the database is ensured to be normally and reliably executed. It should be noted that the first node is any control node except the second node and having a function of executing the timing task of the database, that is, the control nodes except the second node and having a function of executing the timing task of the database monitor the execution condition of the timing task of the database, so that in case that the execution node of the timing task of the database fails, there is enough spare control nodes to take over the failed node and re-execute the timing task of the database, thereby ensuring that the timing task of the database is executed normally and reliably.
A second embodiment of the present invention relates to a method for executing a timed task, and the second embodiment is substantially the same as the first embodiment, and the present embodiment is mainly a further refinement of the first embodiment: and in the process that the first node runs the timed task of the database, if the fact that the identifier of the execution node corresponding to the timed task of the database is not the identifier of the first node is detected and it is determined that the timed task of the database is contained in the task list of the first node, the running of the timed task of the database is stopped.
As shown in fig. 2, in the present embodiment, the method for executing the timing task includes steps 201 to 206, where steps 201 to 202 are the same as steps 101 to 102 in the first embodiment, and are not described herein again; the following specifically describes steps 203 to 206 in this embodiment:
in step 203, the first node determines whether the identifier of the executing node corresponding to the timing task of the database is the identifier of the first node, if so, the step 204 is executed, otherwise, the step 205 is executed;
in step 204, the first node continues to perform the timed task of the database;
in step 205, the first node determines whether the task list of the first node includes the timing task of the database, if yes, go to step 206, otherwise, go to step 201;
in step 206, the first node stops performing timed tasks for the database.
The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.
The third embodiment of the present invention relates to a timing task execution device, and for specific implementation of the timing task execution device, reference may be made to the related description of the first embodiment, and repeated descriptions are omitted. As shown in fig. 3, the apparatus mainly includes:
a preemption module 301, configured to determine that it is monitored that a timing task of a database is overtime in a process of being executed by a second node, and preempt an execution right of the timing task of the database; an executing module 301, configured to execute the timing task of the database after determining that the execution right of the timing task of the database is obtained.
It should be understood that this embodiment is a system example corresponding to the first embodiment, and may be implemented in cooperation with the first embodiment. The related technical details mentioned in the first embodiment are still valid in this embodiment, and are not described herein again in order to reduce repetition. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the first embodiment.
It should be noted that each module referred to in this embodiment is a logical module, and in practical applications, one logical unit may be one physical unit, may be a part of one physical unit, and may be implemented by a combination of multiple physical units. In addition, in order to highlight the innovative part of the present invention, elements that are not so closely related to solving the technical problems proposed by the present invention are not introduced in the present embodiment, but this does not indicate that other elements are not present in the present embodiment.
A fourth embodiment of the present application provides an electronic device, and a specific structure of the electronic device is shown in fig. 4. Comprises at least one processor 401; and a memory 402 communicatively coupled to the at least one processor 401. The memory 402 stores instructions executable by the at least one processor 401, and the instructions are executed by the at least one processor 401, so that the at least one processor 401 can execute the execution method of the timing task described in the first or second embodiment.
In this embodiment, the processor 401 is exemplified by a Central Processing Unit (CPU), and the Memory 402 is exemplified by a Random Access Memory (RAM). The processor 401 and the memory 402 may be connected by a bus or other means, and fig. 4 illustrates the connection by a bus as an example. The memory 402 is a non-volatile computer-readable storage medium for storing a non-volatile software program, a non-volatile computer-executable program, and a module, such as a program for implementing the environment information determining method in the embodiment of the present application, stored in the memory 402. The processor 401 executes various functional applications of the device and data processing, i.e., an execution method of the above-described timing task, by executing nonvolatile software programs, instructions, and modules stored in the memory 402.
The memory 402 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store a list of options, etc. Further, the memory may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 402 may optionally include memory located remotely from processor 401, which may be connected to an external device via a network.
One or more program modules are stored in the memory 402 and, when executed by the one or more processors 401, perform the method of performing timed tasks in any of the method embodiments described above.
The product can execute the method provided by the embodiment of the application, has corresponding functional modules and beneficial effects of the execution method, and can refer to the method provided by the embodiment of the application without detailed technical details in the embodiment.
A fifth embodiment of the present application relates to a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, is capable of implementing a method of executing a timed task as referred to in any of the method embodiments of the present application.
Those skilled in the art will understand that all or part of the steps in the method according to the above embodiments may be implemented by a program instructing related hardware to complete, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, etc.) or a processor (processor) to execute all or part of the steps in the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific examples for carrying out the present application, and that various changes in form and details may be made therein without departing from the spirit and scope of the present invention in practice.
Claims (11)
1. A method for executing a timing task, applied to a first node, the method comprising:
determining that the overtime happens in the process of monitoring the timing task of the database executed by the second node, and preempting the execution right of the timing task of the database;
and executing the timing task of the database after determining the execution right of the timing task of the database.
2. The method of claim 1, wherein determining that the timed task monitoring the database has timed out during execution by the second node comprises:
monitoring the time when the timing task of the database is updated last time in the process that the timing task of the database is executed by a second node;
calculating the difference value between the latest updated time and the current time;
and if the difference value is determined to exceed the preset threshold value, determining that the timing task of the database is overtime in the process of being executed by the second node.
3. The method of claim 2, wherein monitoring the database when the timed task was last updated comprises:
and reading the latest updated time of the timing task of the database every a first preset time interval, wherein the first preset time interval is less than the preset threshold.
4. The method for executing the timed task according to claim 1, wherein preempting the execution right of the timed task of the database comprises:
modifying the identifier of the execution node corresponding to the timing task of the database into the identifier of the first node;
determining to obtain execution rights for timed tasks of the database, comprising:
and determining that the identifier of the execution node corresponding to the timing task of the database is the identifier of the first node.
5. The method for executing the timed task according to claim 4, wherein after determining to obtain the execution right of the timed task of the database, before executing the timed task of the database, the method further comprises:
and modifying the state of the timing task of the database into a preparation execution state, wherein the preparation execution state indicates that the timing task of the database has obtained the execution right.
6. The method for executing the timed task according to any one of claims 1 to 5, wherein after determining to obtain the execution right of the timed task of the database, the method further comprises:
and updating the time of the timing task of the database every interval of a second preset time.
7. The method for executing the timed task according to claim 6, wherein the step of executing the timed task of the database comprises the following steps:
and modifying the state of the timing task of the database into an execution state, and running the timing task of the database.
8. The method of claim 7, wherein the method further comprises:
and in the process of running the timing task of the database, if the fact that the identifier of the execution node corresponding to the timing task of the database is not the identifier of the first node is detected and it is determined that the timing task of the database is contained in the task list of the first node, stopping running the timing task of the database.
9. An apparatus for performing timed tasks, comprising:
the preemption module is used for determining that the overtime happens in the process of monitoring the timing task of the database executed by the second node and preempting the execution right of the timing task of the database;
and the execution module is used for executing the timing task of the database after determining the execution right of the timing task of the database.
10. A server, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a method of performing timed tasks according to any one of claims 1 to 8.
11. A computer-readable storage medium, storing a computer program, wherein the computer program, when executed by a processor, implements a method of performing the timed task of any of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811081486.0A CN110908776A (en) | 2018-09-17 | 2018-09-17 | Timed task execution method, related device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811081486.0A CN110908776A (en) | 2018-09-17 | 2018-09-17 | Timed task execution method, related device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110908776A true CN110908776A (en) | 2020-03-24 |
Family
ID=69812574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811081486.0A Pending CN110908776A (en) | 2018-09-17 | 2018-09-17 | Timed task execution method, related device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110908776A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113342499A (en) * | 2021-06-29 | 2021-09-03 | 中国农业银行股份有限公司 | Distributed task calling method, device, equipment, storage medium and program product |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103197969A (en) * | 2013-03-27 | 2013-07-10 | 百度在线网络技术（北京）有限公司 | Distributed timed task control device and method |
| CN105100259A (en) * | 2015-08-18 | 2015-11-25 | 北京京东尚科信息技术有限公司 | Distributed timed task execution method and system |
| CN107092521A (en) * | 2016-12-30 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of distributed task dispatching method, apparatus and system |
| CN107483601A (en) * | 2017-08-28 | 2017-12-15 | 郑州云海信息技术有限公司 | A kind of implementation method and execution system of distributed timing task |
| CN107566460A (en) * | 2017-08-16 | 2018-01-09 | 微梦创科网络科技（中国）有限公司 | The method and system of distributed deployment plan target |
| CN107766140A (en) * | 2017-10-30 | 2018-03-06 | 华中科技大学 | A kind of Schedulability Analysis method with preemption point real-time task |
-
2018
- 2018-09-17 CN CN201811081486.0A patent/CN110908776A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103197969A (en) * | 2013-03-27 | 2013-07-10 | 百度在线网络技术（北京）有限公司 | Distributed timed task control device and method |
| CN105100259A (en) * | 2015-08-18 | 2015-11-25 | 北京京东尚科信息技术有限公司 | Distributed timed task execution method and system |
| CN107092521A (en) * | 2016-12-30 | 2017-08-25 | 北京小度信息科技有限公司 | A kind of distributed task dispatching method, apparatus and system |
| CN107566460A (en) * | 2017-08-16 | 2018-01-09 | 微梦创科网络科技（中国）有限公司 | The method and system of distributed deployment plan target |
| CN107483601A (en) * | 2017-08-28 | 2017-12-15 | 郑州云海信息技术有限公司 | A kind of implementation method and execution system of distributed timing task |
| CN107766140A (en) * | 2017-10-30 | 2018-03-06 | 华中科技大学 | A kind of Schedulability Analysis method with preemption point real-time task |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113342499A (en) * | 2021-06-29 | 2021-09-03 | 中国农业银行股份有限公司 | Distributed task calling method, device, equipment, storage medium and program product |
| CN113342499B (en) * | 2021-06-29 | 2024-04-30 | 中国农业银行股份有限公司 | Distributed task calling method, device, equipment, storage medium and program product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109582466B (en) | Timed task execution method, distributed server cluster and electronic equipment | |
| US10108502B1 (en) | Data protection using checkpoint restart for cluster shared resources | |
| US9372908B2 (en) | Merging an out of synchronization indicator and a change recording indicator in response to a failure in consistency group formation | |
| US8495618B1 (en) | Updating firmware in a high availability enabled computer system | |
| CN107844343B (en) | Upgrading system and method for complex server application system | |
| CN108123851B (en) | Survival detection method and device for master-slave node synchronous link in distributed system | |
| CN111897558A (en) | Kubernets upgrading method and device for container cluster management system | |
| CN109788068B (en) | Heartbeat state information reporting method, device and equipment and computer storage medium | |
| CN111324423B (en) | Method and device for monitoring processes in container, storage medium and computer equipment | |
| CN106844055B (en) | Task execution method and device | |
| CN109445927B (en) | Task management method and device for storage cluster | |
| CN107656705B (en) | Computer storage medium and data migration method, device and system | |
| US11675622B2 (en) | Leader election with lifetime term | |
| CN109361542A (en) | The fault handling method of client, device, system, terminal and server | |
| CN106484542B (en) | Method and device for processing overlapping node event in distributed system | |
| WO2018024076A1 (en) | Flow velocity control method and device | |
| CN110908776A (en) | Timed task execution method, related device and computer readable storage medium | |
| CN107707395B (en) | Data transmission method, device and system | |
| CN108121514B (en) | Meta information updating method and device, computing equipment and computer storage medium | |
| CN106407016B (en) | Method and device for simulating multithreading contention and robbery of resources | |
| US20230123350A1 (en) | Containerized workload management in container computing environment | |
| CN111090491B (en) | Virtual machine task state recovery method and device and electronic equipment | |
| US10102052B2 (en) | Dumping resources | |
| CN112068935A (en) | Method, device and equipment for monitoring deployment of kubernets program | |
| CN110750503A (en) | File deletion speed control method, device, equipment and readable 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200324 |