WO2025190012A1 - Task management method and apparatus, and computer program product - Google Patents

Abstract

The present disclosure provides a task management method and apparatus and a computer program product, and belongs to the technical field of task scheduling. The task management method comprises: in response to an operating instruction for a timed task, executing a target operation on the timed task, the target operation comprising at least one of the following: adding the timed task to a service system; deleting the timed task from the service system; and changing the timed task in the service system. The technical solution of the present disclosure can dynamically start and stop timed tasks.

Description

Task management method and device, and computer program product

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to Chinese patent application No. 202410288761.5 filed in China on March 13, 2024, the entire contents of which are incorporated herein by reference.

Technical Field

The present disclosure relates to the technical field of task scheduling, and in particular to a task management method and device, and a computer program product.

Background Art

Scheduled tasks are primarily used in business systems to automatically execute repetitive tasks, such as data backup, log cleanup, and data synchronization, or to periodically execute specific operations based on business needs, such as generating reports, sending emails, and updating data. Scheduled tasks can also be used to execute resource-intensive operations, such as data statistics and index rebuilds, during off-peak hours, minimizing impact on business system performance and saving costs.

In related technologies, the relevant information of scheduled tasks is statically configured in the code, and scheduled tasks cannot be added or deleted dynamically.

Summary of the Invention

The technical problem to be solved by the present disclosure is to provide a task management method and device, and a computer program product, which can realize the dynamic start and stop of scheduled tasks.

To solve the above technical problems, the embodiments of the present disclosure provide the following technical solutions:

In one aspect, a task management method is provided, comprising:

In response to an operation instruction for a scheduled task, a target operation is performed on the scheduled task, where the target operation includes at least one of the following:

Add scheduled tasks in the business system;

Delete scheduled tasks in the business system;

Modify the scheduled tasks in the business system.

In some embodiments, adding a scheduled task in the business system includes:

Storing the task information and execution period of the scheduled task in the database of the business system;

Call addCronTask to load the scheduled task into the memory of the business system.

In some embodiments, deleting a scheduled task in the business system includes:

Modify the execution status of the scheduled task in the database of the business system to be disabled or invalid; or delete the task information and execution cycle of the scheduled task in the database of the business system;

Call cancelCronTask to delete the scheduled task in the memory of the business system.

In some embodiments, modifying a scheduled task in a business system includes:

Modify the execution period of the scheduled task in the database of the business system; or delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system;

Call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system.

In some embodiments, after performing the target operation on the scheduled task, the method further includes:

When the business system is started, query whether there is a valid scheduled task in the business system;

If there is a valid scheduled task, call addCronTask to load the valid scheduled task into the memory of the business system;

The scheduled task is executed regularly according to the execution cycle of the scheduled task.

In some embodiments, after executing the scheduled task, the method further includes:

Execute subsequent business tasks based on the execution results of the scheduled task, including any of the following:

Execute multiple business tasks in sequence according to the preset task order;

After all predecessor tasks of the business task are executed, executing the business task, wherein the execution of the business task depends on the execution results of the predecessor tasks;

After any preceding task of the business task is executed, the business task is executed, wherein the execution of the business task depends on the execution result of the preceding task.

In some embodiments, after executing the scheduled task, the method further includes:

Execute subsequent business tasks based on the execution results of the scheduled tasks, including:

Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship;

Step b: traverse the business tasks in the association condition set;

Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d;

Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e;

Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a.

Step f: executing the business tasks in the order of tasks in the task output list.

The present disclosure also provides a task management device, including:

The task processor is configured to, in response to an operation instruction for a scheduled task, perform a target operation on the scheduled task, where the target operation includes at least one of the following:

Add scheduled tasks in the business system;

Delete scheduled tasks in the business system;

Modify the scheduled tasks in the business system.

In some embodiments, the task processor includes:

The adding unit is used to store the task information and execution cycle of the scheduled task in the database of the business system; and call addCronTask to load the scheduled task into the memory of the business system.

In some embodiments, the task processor includes:

The deletion unit is used to modify the execution status of the scheduled task in the database of the business system to disabled or invalid; or, delete the task information and execution cycle of the scheduled task in the database of the business system; call cancelCronTask to delete the scheduled task in the memory of the business system.

In some embodiments, the task processor includes:

A changing unit is used to change the execution period of the scheduled task in the database of the business system; or to delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system; call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system.

In some embodiments, the apparatus further comprises:

A query module is used to query whether there is a valid scheduled task in the business system when the business system is started;

A loading module is used to call addCronTask to load a valid scheduled task into the memory of the business system if there is one;

The execution module is used to execute the scheduled task regularly according to the execution cycle of the scheduled task.

In some embodiments, the apparatus further comprises:

The business task execution module is used to execute subsequent business tasks according to the execution result of the scheduled task, including any of the following:

Execute multiple business tasks in sequence according to the preset task order;

After all predecessor tasks of the business task are executed, executing the business task, wherein the execution of the business task depends on the execution results of the predecessor tasks;

After any preceding task of the business task is executed, the business task is executed, wherein the execution of the business task depends on the execution result of the preceding task.

In some embodiments, the apparatus further comprises:

The business task execution module is used to execute subsequent business tasks according to the execution results of the scheduled tasks, including:

Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship;

Step b: traverse the business tasks in the association condition set;

Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d;

Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e;

Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a.

Step f: executing the business tasks in the order of tasks in the task output list.

An embodiment of the present disclosure further provides a computer program product, comprising computer instructions, which implement the steps of the above method when executed by a processor.

The embodiments of the present disclosure have the following beneficial effects:

In the above solution, after receiving the operation instruction for the scheduled task, the scheduled task can be added, deleted or modified in the business system, thereby realizing the dynamic start and stop of the scheduled task, and further realizing the addition of an efficient and flexible business system.

BRIEF DESCRIPTION OF THE DRAWINGS

Figures 1 and 2 are schematic diagrams of the structure of the task management device disclosed herein;

FIG3 is a schematic diagram of adding a scheduled task according to an embodiment of the present disclosure;

FIG4 is a schematic diagram of deleting a scheduled task according to an embodiment of the present disclosure;

FIG5 is a schematic diagram of changing a scheduled task according to an embodiment of the present disclosure;

FIG6 is a schematic diagram of a process for executing a scheduled task according to an embodiment of the present disclosure;

7-9 are schematic diagrams of the execution logic of business tasks according to an embodiment of the present disclosure;

FIG10 is a schematic diagram of a process for performing task scheduling according to an embodiment of the present disclosure.

DETAILED DESCRIPTION

In order to make the technical problems, technical solutions and advantages to be solved by the embodiments of the present disclosure more clear, they will be described in detail below with reference to the accompanying drawings and specific embodiments.

In related technologies, the open source job scheduling framework Quartz can be used for scheduled task management, and job scheduling and task management can be implemented in Java applications. However, there are the following problems: 1) Complex configuration: The configuration of Quartz is relatively complex, and you need to be familiar with the framework's configuration files and properties, as well as related application programming interfaces (APIs) and concepts. 2) It is impossible to flexibly adjust scheduled tasks according to needs. In addition, the execution time of scheduled tasks can also be written into the code, that is, the configuration of scheduled tasks is static and cannot be dynamically modified at runtime. If you need to dynamically adjust the execution time or execution cycle of the scheduled task, you need to restart the application.

The embodiments of the present disclosure provide a task management method and apparatus, and a computer program product, which can realize dynamic start and stop of scheduled tasks.

The present disclosure provides a task management method, including:

In response to an operation instruction for a scheduled task, a target operation is performed on the scheduled task, where the target operation includes at least one of the following:

Add scheduled tasks in the business system;

Delete scheduled tasks in the business system;

Modify the scheduled tasks in the business system.

In this embodiment, after receiving an operation instruction for a scheduled task, the scheduled task can be added, deleted or modified in the business system, thereby realizing dynamic start and stop of the scheduled task, and further realizing the addition of an efficient and flexible business system.

In this embodiment, as shown in Figures 1 and 2, the task manager can receive operation instructions and add, delete, or modify scheduled tasks according to the operation instructions. The task manager can save task information of scheduled tasks, update the execution period of scheduled tasks, start scheduled tasks, and stop scheduled tasks.

In some embodiments, as shown in FIG3 , adding a scheduled task in the business system includes:

Storing the task information and execution period of the scheduled task in the database of the business system;

Call addCronTask to load the scheduled task into the memory of the business system.

Among them, the task information of the scheduled task includes but is not limited to the task name, task content, execution time, etc. of the scheduled task. The task manager can store the task information and execution cycle of the scheduled task in the database of the business system, and store the scheduled task in the memory of the business system, that is, the Map container, so that the specific logic in the scheduled task can be executed regularly according to the set execution cycle. Among them, the role of the Map container is to control the dynamic start and stop of the scheduled task under the running state of the business system and modify the execution cycle of the scheduled task.

When adding a scheduled task, you can first search the business system database based on the scheduled task name to determine whether the scheduled task name already exists in the database. If the scheduled task name already exists, an error message will be returned. If the scheduled task name does not exist in the database, the scheduled task name, execution time, execution cycle and other information will be stored in the database and loaded into the Map container.

In related technologies, after statically configuring scheduled tasks, adding scheduled tasks requires code modifications and recompilation, which is inflexible. Static configuration also requires consideration of various exceptions, making management and maintenance difficult. In this embodiment, scheduled tasks can be added flexibly and at any time based on actual needs. Furthermore, added scheduled tasks can take effect immediately during operation, providing real-time performance. The technical solution of this embodiment allows scheduled tasks to be monitored and managed during operation, ensuring their stability and reliability.

In some embodiments, as shown in FIG4 , deleting a scheduled task in the business system includes:

Modify the execution status of the scheduled task in the database of the business system to be disabled or invalid; or delete the task information and execution cycle of the scheduled task in the database of the business system;

Call cancelCronTask to delete the scheduled task in the memory of the business system.

In this embodiment, when deleting a scheduled task, all relevant information of the scheduled task in the database of the business system may be deleted, or only the execution status of the scheduled task in the database may be changed.

In related technologies, after statically configuring a scheduled task, deleting it requires code modification and recompilation, which is inflexible. Static configuration also requires consideration of various exceptions, making management and maintenance difficult. In this embodiment, scheduled tasks can be deleted flexibly and at any time based on actual needs. Furthermore, deletion of a scheduled task takes effect immediately during operation, providing real-time performance. The technical solution of this embodiment allows for monitoring and management of scheduled tasks during operation, ensuring their stability and reliability.

In some embodiments, as shown in FIG5 , modifying a scheduled task in a business system includes:

Modify the execution period of the scheduled task in the database of the business system; or delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system;

Call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system.

In this embodiment, when modifying a scheduled task, the relevant information of the old scheduled task in the business system database can be deleted and the relevant information of the new scheduled task can be rewritten, or the execution cycle of the scheduled task can be directly changed in the business system database.

In related technologies, after statically configuring a scheduled task, if the scheduled task needs to be modified, it is necessary to modify the code and recompile it, which is not flexible enough. The scheduled task also needs to be recompiled and deployed before it takes effect, which is slow to take effect. When statically configuring tasks, various abnormal situations need to be considered, making management and maintenance more difficult. In this embodiment, scheduled tasks can be modified at any time and flexibly according to actual needs. Modifications to scheduled tasks can take effect immediately during operation, which is real-time. The technical solution of this embodiment can monitor and manage scheduled tasks during operation, ensuring the stability and reliability of scheduled tasks.

In some embodiments, as shown in FIG6 , after executing the target operation on the scheduled task, the method further includes:

When the business system is started, query whether there is a valid scheduled task in the business system;

If there is a valid scheduled task, call addCronTask to load the valid scheduled task into the memory of the business system;

The scheduled task is executed regularly according to the execution cycle of the scheduled task.

In this embodiment, when the business system starts, it first queries whether there is a valid scheduled task in the database. If so, the addCronTask method is executed to write the scheduled task into the memory, and then the scheduled task is executed according to the execution cycle of the scheduled task; if not, the loading is completed directly.

In a specific example, the visualization screen can communicate with the server through websocket. When the visualization screen is open, the page of the visualization screen communicates with the server through websocket. According to the configuration page of the visualization screen, the scheduled task information of each component in the page can be configured and changed, and the scheduled task can be started; the execution time can be set by the page to perform periodic execution of the scheduled task; when the page is closed, the websocket connection between the page and the server is disconnected, and the scheduled task can be canceled to avoid executing invalid tasks and consuming memory; in this embodiment, the page of the visualization screen supports online modification of scheduled tasks and takes effect immediately.

After executing a scheduled task, the technical solution of this embodiment can also perform task scheduling. Task scheduling is to execute different subsequent business tasks based on the execution results of the scheduled task after the scheduled task is completed. Task scheduling can be divided into three types of execution logic, including any of the following:

After all predecessor tasks of the business task are executed, the business task is executed, wherein the execution of the business task depends on the execution results of the predecessor tasks. As shown in Figure 7, Task A and Task B are predecessor tasks of Task C. After Task A and Task B are executed, Task C is executed according to the execution results of Task A and Task B;

After completing any of the predecessor tasks of the business task, execute the business task, where the execution of the business task depends on the execution result of the predecessor task. For example, as shown in FIG8 , if Task A and Task B are predecessor tasks of Task C, then after completing Task A or Task B, execute Task C based on the execution result of Task A or Task B.

According to the preset task order, multiple business tasks are executed sequentially. The execution of all business tasks depends on the completion of the previous business task. As shown in Figure 9, task A is executed first. After the completion of task A, task B is triggered to be executed. After the completion of task B, task C is triggered to be executed.

In a specific example, there is an association relationship between business tasks A, B, C, D, E, F, and G as conditional data: business task A is a predecessor task of business task C, and the execution of business task C depends on the execution result of business task A. When the data of business task A changes, the data in business task C will also change synchronously; business task A is a predecessor task of business task D, and the execution of business task D depends on the execution result of business task A. When the data of business task A changes, the data in business task D will also change synchronously; business task A is a predecessor task of business task G, and the execution of business task G depends on the execution result of business task A. When the data of business task A changes, the data in business task G will also change synchronously; business task B is a predecessor task of business task C, and the execution of business task C depends on the execution result of business task B. When the data of business task B changes, the data in business task C will also change synchronously; business task D is a predecessor task of business task B. Tasks, the execution of business task B depends on the execution result of business task D. When the data of business task D changes, the data in business task B will also change synchronously; business task D is the predecessor task of business task E. The execution of business task E depends on the execution result of business task D. When the data of business task D changes, the data in business task E will also change synchronously; business task F is the predecessor task of business task E. The execution of business task E depends on the execution result of business task F. When the data of business task F changes, the data in business task E will also change synchronously; business task G is the predecessor task of business task F. The execution of business task F depends on the execution result of business task G. When the data of business task G changes, the data in business task F will also change synchronously; business task B is the predecessor task of business task G. The execution of business task G depends on the execution result of business task B. When the data of business task B changes, the data in business task G will also change synchronously. In the prior art, the execution logic output according to the above association relationship is as follows:

Execute pre-task A and business task C;

Execute pre-task A and business task D;

Execute pre-task D and business task B;

Execute pre-task B and business task C;

Execute the pre-task B and the business task G;

Execute the pre-task G and the business task F;

Execute pre-task F and business task E;

Execute pre-task D and business task E;

Execute pre-task A and business task G;

Execute the pre-task G and the business task F;

Execute pre-task F and business task E;

Execute pre-task B and business task C;

Execute the pre-task B and the business task G;

Execute the pre-task G and the business task F;

Execute pre-task F and business task E;

Execute pre-task D and business task B;

Execute pre-task B and business task C;

Execute the pre-task B and the business task G;

Execute the pre-task G and the business task F;

Execute pre-task F and business task E;

Execute pre-task D and business task E;

Execute pre-task F and business task E;

Execute the pre-task G and the business task F;

Execute the prerequisite task F and the business task E.

From the execution results, it can be seen that a total of 24 executions are required, that is, one conditional query requires querying the database 24 times, which is inefficient and consumes a lot of resources. To save resources and improve the efficiency of task execution, this embodiment can arrange tasks and implement more complex system functions by scheduling and executing different tasks.

In some embodiments, after executing the scheduled task, the method further includes:

Executing subsequent business tasks according to the execution result of the scheduled task, as shown in FIG10 , includes:

Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship;

Step b: traverse the business tasks in the association condition set;

Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d;

Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e;

Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a.

Step f: executing the business tasks in the order of tasks in the task output list.

In a specific example, there is an association relationship between business tasks A, B, C, D, E, F, and G as conditional data: business task A is a predecessor task of business task C, and the execution of business task C depends on the execution result of business task A. When the data of business task A changes, the data in business task C will also change synchronously; business task A is a predecessor task of business task D, and the execution of business task D depends on the execution result of business task A. When the data of business task A changes, the data in business task D will also change synchronously; business task A is a predecessor task of business task G, and the execution of business task G depends on the execution result of business task A. When the data of business task A changes, the data in business task G will also change synchronously; business task B is a predecessor task of business task C, and the execution of business task C depends on the execution result of business task B. When the data of business task B changes, the data in business task C will also change synchronously; business task D is a predecessor task of business task B. Tasks, the execution of business task B depends on the execution result of business task D. When the data of business task D changes, the data in business task B will also change synchronously; business task D is the predecessor task of business task E. The execution of business task E depends on the execution result of business task D. When the data of business task D changes, the data in business task E will also change synchronously; business task F is the predecessor task of business task E. The execution of business task E depends on the execution result of business task F. When the data of business task F changes, the data in business task E will also change synchronously; business task G is the predecessor task of business task F. The execution of business task F depends on the execution result of business task G. When the data of business task G changes, the data in business task F will also change synchronously; business task B is the predecessor task of business task G. The execution of business task G depends on the execution result of business task B. When the data of business task B changes, the data in business task G will also change synchronously.

In this embodiment, the execution logic output according to the method shown in Figure 10 is as follows: execute business tasks A, D, B, C, G, F, and E in sequence, that is, only a total of 7 executions are required to obtain the required data, that is, one conditional query requires querying the database 7 times.

With a data volume of millions, it takes about 15 seconds to obtain the required data using related technologies, while it takes about 4 seconds to obtain the required data using the technical solution of this embodiment, which greatly improves the efficiency of task execution. In addition, the technical solution of this embodiment can also reduce the amount of query data returned.

The present disclosure also provides a task management device, including:

The task processor is configured to, in response to an operation instruction for a scheduled task, perform a target operation on the scheduled task, where the target operation includes at least one of the following:

Add scheduled tasks in the business system;

Delete scheduled tasks in the business system;

Modify the scheduled tasks in the business system.

In this embodiment, after receiving an operation instruction for a scheduled task, the scheduled task can be added, deleted or modified in the business system, thereby realizing dynamic start and stop of the scheduled task, and further realizing the addition of an efficient and flexible business system.

In this embodiment, as shown in Figures 1 and 2, the task manager can receive operation instructions and add, delete, or modify scheduled tasks according to the operation instructions. The task manager can save task information of scheduled tasks, update the execution period of scheduled tasks, start scheduled tasks, and stop scheduled tasks.

In some embodiments, the task processor includes:

The adding unit is used to store the task information and execution cycle of the scheduled task in the database of the business system; and call addCronTask to load the scheduled task into the memory of the business system.

Among them, the task information of the scheduled task includes but is not limited to the task name, task content, execution time, etc. of the scheduled task. The task manager can store the task information and execution cycle of the scheduled task in the database of the business system, and store the scheduled task in the memory of the business system, that is, the Map container, so that the specific logic in the scheduled task can be executed regularly according to the set execution cycle. Among them, the role of the Map container is to control the dynamic start and stop of the scheduled task under the running state of the business system and modify the execution cycle of the scheduled task.

When adding a scheduled task, you can first search the business system database based on the scheduled task name to determine whether the scheduled task name already exists in the database. If the scheduled task name already exists, an error message will be returned. If the scheduled task name does not exist in the database, the scheduled task name, execution time, execution cycle and other information will be stored in the database and loaded into the Map container.

In related technologies, after statically configuring scheduled tasks, adding scheduled tasks requires code modifications and recompilation, which is inflexible. Static configuration also requires consideration of various exceptions, making management and maintenance difficult. In this embodiment, scheduled tasks can be added flexibly and at any time based on actual needs. Furthermore, added scheduled tasks can take effect immediately during operation, providing real-time performance. The technical solution of this embodiment allows scheduled tasks to be monitored and managed during operation, ensuring their stability and reliability.

In some embodiments, the task processor includes:

The deletion unit is used to modify the execution status of the scheduled task in the database of the business system to disabled or invalid; or, delete the task information and execution cycle of the scheduled task in the database of the business system; call cancelCronTask to delete the scheduled task in the memory of the business system.

In this embodiment, when deleting a scheduled task, all relevant information of the scheduled task in the database of the business system may be deleted, or only the execution status of the scheduled task in the database may be changed.

In related technologies, after statically configuring a scheduled task, deleting it requires code modification and recompilation, which is inflexible. Static configuration also requires consideration of various exceptions, making management and maintenance difficult. In this embodiment, scheduled tasks can be deleted flexibly and at any time based on actual needs. Furthermore, deletion of a scheduled task takes effect immediately during operation, providing real-time performance. The technical solution of this embodiment allows for monitoring and management of scheduled tasks during operation, ensuring their stability and reliability.

In some embodiments, the task processor includes:

A changing unit is used to change the execution period of the scheduled task in the database of the business system; or to delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system; call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system.

In this embodiment, when modifying a scheduled task, the relevant information of the old scheduled task in the business system database can be deleted and the relevant information of the new scheduled task can be rewritten, or the execution cycle of the scheduled task can be directly changed in the business system database.

In related technologies, after statically configuring a scheduled task, if the scheduled task needs to be modified, it is necessary to modify the code and recompile it, which is not flexible enough. The scheduled task also needs to be recompiled and deployed before it takes effect, which is slow to take effect. When statically configuring tasks, various abnormal situations need to be considered, making management and maintenance more difficult. In this embodiment, scheduled tasks can be modified at any time and flexibly according to actual needs. Modifications to scheduled tasks can take effect immediately during operation, which is real-time. The technical solution of this embodiment can monitor and manage scheduled tasks during operation, ensuring the stability and reliability of scheduled tasks.

In some embodiments, the apparatus further comprises:

A query module is used to query whether there is a valid scheduled task in the business system when the business system is started;

A loading module is used to call addCronTask to load a valid scheduled task into the memory of the business system if there is one;

The execution module is used to execute the scheduled task regularly according to the execution cycle of the scheduled task.

In this embodiment, when the business system starts, it first queries whether there is a valid scheduled task in the database. If so, the addCronTask method is executed to write the scheduled task into the memory, and then the scheduled task is executed according to the execution cycle of the scheduled task; if not, the loading is completed directly.

After executing the scheduled task, the technical solution of this embodiment can also perform task scheduling. Task scheduling is to execute different subsequent business tasks according to the execution results of the scheduled task after the scheduled task is completed; task scheduling can be divided into three types of execution logic, and the device also includes:

The business task execution module is used to execute subsequent business tasks according to the execution result of the scheduled task, including any of the following:

Execute multiple business tasks in sequence according to the preset task order. As shown in FIG9 , Task A is executed first. After Task A is completed, Task B is triggered. After Task B is completed, Task C is triggered.

After all predecessor tasks of the business task are executed, the business task is executed, wherein the execution of the business task depends on the execution results of the predecessor tasks. As shown in Figure 7, Task A and Task B are predecessor tasks of Task C. After Task A and Task B are executed, Task C is executed based on the execution results of Task A and Task B;

After executing any predecessor task of the business task, execute the business task, wherein the execution of the business task depends on the execution result of the predecessor task. As shown in Figure 8, Task A and Task B are predecessor tasks of Task C. After executing Task A or Task B, execute Task C according to the execution result of Task A or Task B.

In order to save resources and improve the efficiency of task execution, this embodiment can arrange tasks and realize more complex system functions by scheduling and executing different tasks.

The business task execution module is used to execute subsequent business tasks according to the execution results of the scheduled tasks, including:

Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship;

Step b: traverse the business tasks in the association condition set;

Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d;

Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e;

Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a.

Step f: executing the business tasks in the order of tasks in the task output list.

An embodiment of the present disclosure further provides a computer program product, comprising computer instructions, which implement the steps of the above method when executed by a processor.

In the various method embodiments of the present disclosure, the serial numbers of the steps cannot be used to limit the order of the steps. For ordinary technicians in this field, without paying any creative work, changes to the order of the steps are also within the scope of protection of the present disclosure.

An embodiment of the present application further provides a computer program/program product, which is stored in a storage medium. The computer program/program product is executed by at least one processor to implement the various processes of the above-mentioned method embodiment and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

It should be noted that, in this article, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a..." does not exclude the presence of other identical elements in the process, method, article or device comprising the element. In addition, it should be pointed out that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, but may also include performing functions in a substantially simultaneous manner or in the opposite order according to the functions involved. For example, the described method may be performed in an order different from that described, and various steps may also be added, omitted or combined. In addition, the features described with reference to certain examples may be combined in other examples.

Through the description of the above embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of a computer software product plus a necessary general hardware platform, or of course, by hardware. The computer software product is stored in a storage medium (such as ROM, RAM, magnetic disk, optical disk, etc.) and includes a number of instructions for causing a terminal or network-side device to execute the methods described in each embodiment of the present application.

The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of this application, ordinary technicians in this field can also make many forms of implementation methods without departing from the purpose of this application and the scope of protection of the claims. These implementation methods are all within the protection of this application.

Claims (15)

A task management method, comprising: In response to an operation instruction for a scheduled task, a target operation is performed on the scheduled task, where the target operation includes at least one of the following: Add scheduled tasks in the business system; Delete scheduled tasks in the business system; Modify the scheduled tasks in the business system. The task management method according to claim 1, wherein adding a scheduled task to the business system comprises: Storing the task information and execution period of the scheduled task in the database of the business system; Call addCronTask to load the scheduled task into the memory of the business system. The task management method according to claim 1, wherein deleting the scheduled task in the business system comprises: Modify the execution status of the scheduled task in the database of the business system to be disabled or invalid; or delete the task information and execution cycle of the scheduled task in the database of the business system; Call cancelCronTask to delete the scheduled task in the memory of the business system. The task management method according to claim 1, wherein modifying the scheduled task in the business system comprises: Modify the execution period of the scheduled task in the database of the business system; or delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system; Call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system. The task management method according to any one of claims 1 to 4, characterized in that after performing the target operation on the scheduled task, the method further comprises: When the business system is started, query whether there is a valid scheduled task in the business system; If there is a valid scheduled task, call addCronTask to load the valid scheduled task into the memory of the business system; The scheduled task is executed regularly according to the execution cycle of the scheduled task. The task management method according to claim 5, characterized in that after executing the scheduled task, the method further comprises: Execute subsequent business tasks based on the execution results of the scheduled task, including any of the following: Execute multiple business tasks in sequence according to the preset task order; After all predecessor tasks of the business task are executed, executing the business task, wherein the execution of the business task depends on the execution results of the predecessor tasks; After any preceding task of the business task is executed, the business task is executed, wherein the execution of the business task depends on the execution result of the preceding task. The task management method according to claim 5, characterized in that after executing the scheduled task, the method further comprises: Execute subsequent business tasks based on the execution results of the scheduled tasks, including: Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship; Step b: traverse the business tasks in the association condition set; Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d; Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e; Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a. Step f: executing the business tasks in the order of tasks in the task output list. A task management device, comprising: The task processor is configured to, in response to an operation instruction for a scheduled task, perform a target operation on the scheduled task, where the target operation includes at least one of the following: Add scheduled tasks in the business system; Delete scheduled tasks in the business system; Modify the scheduled tasks in the business system. The task management device according to claim 8, wherein the task processor comprises: The adding unit is used to store the task information and execution cycle of the scheduled task in the database of the business system; and call addCronTask to load the scheduled task into the memory of the business system. The task management device according to claim 8, wherein the task processor comprises: The deletion unit is used to modify the execution status of the scheduled task in the database of the business system to disabled or invalid; or, delete the task information and execution cycle of the scheduled task in the database of the business system; call cancelCronTask to delete the scheduled task in the memory of the business system. The task management device according to claim 8, wherein the task processor comprises: A changing unit is used to change the execution period of the scheduled task in the database of the business system; or to delete the task information and execution period of the scheduled task in the database of the business system, and store the modified task information and execution period of the scheduled task in the database of the business system; call updateTaskInfo to change the execution period of the scheduled task in the memory of the business system. The task management device according to any one of claims 8 to 11, characterized in that the device further comprises: A query module is used to query whether there is a valid scheduled task in the business system when the business system is started; A loading module is used to call addCronTask to load a valid scheduled task into the memory of the business system if there is one; The execution module is used to execute the scheduled task regularly according to the execution cycle of the scheduled task. The task management device according to claim 12, characterized in that the device further comprises: The task scheduling module is used to execute subsequent business tasks according to the execution results of the scheduled tasks, including any of the following: Execute multiple business tasks in sequence according to the preset task order; After all predecessor tasks of the business task are executed, executing the business task, wherein the execution of the business task depends on the execution results of the predecessor tasks; After any preceding task of the business task is executed, the business task is executed, wherein the execution of the business task depends on the execution result of the preceding task. The task management device according to claim 12, characterized in that the device further comprises: The task scheduling module is used to execute subsequent business tasks according to the execution results of the scheduled tasks, including: Step a: acquiring all post-tasks according to the association condition set of the business task, wherein the execution of the post-task depends on the execution results of other business tasks in the association condition set, and the association condition set includes a plurality of the business tasks having an association relationship; Step b: traverse the business tasks in the association condition set; Step c: determine whether a business task in the association condition set is included in the post-task; if yes, proceed to step b; if not, proceed to step d; Step d: remove the business task from the association relationship condition set, save the business task in the task output list, and go to step e; Step e: Determine whether the association relationship condition set is empty. If so, go to step f; if not, go to step a. Step f: executing the business tasks in the order of tasks in the task output list. A computer program product, characterized in that it comprises computer instructions, which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 7.