CN116610429A - Processing method and device of delay task, computer equipment and storage medium - Google Patents

Abstract

The present application relates to a processing method, device, computer equipment, storage medium and computer program product for delayed tasks. The method includes: receiving a delayed task, determining a delay time unit of the delayed task; in response to the condition that the delay time unit is the first level, using a message queue to execute the delayed task A processing operation, generating a processing result of the delayed task; in response to the fact that the delayed time unit is the second level, using a timing task to perform a processing operation on the delayed task, and generating the delayed task processing results. By adopting the method, different task processing methods can be flexibly adopted for different levels of delayed tasks, so as to ensure the delay accuracy of the delayed tasks and reduce the polling pressure on the database during the delayed task processing.

Description

Processing method, device, computer equipment, and storage medium for delayed tasks

technical field

The present application relates to the technical field of task processing, and in particular to a processing method, device, computer equipment, storage medium and computer program product for delayed tasks.

Background technique

In some scenarios, newly created tasks in the application system do not need to be executed immediately. Therefore, there is a delayed task. At present, the commonly used delayed task processing method is generally the database polling method: by storing the newly created delayed tasks in the database, polling is regularly initiated to the database to pull the delayed tasks to be executed and add them to the task queue for execution.

However, when the above-mentioned database polling method is used to process delayed tasks, in the case of a large number of database polling tasks in the application system, frequently scanning the database will affect the performance of the database. However, when the number of database polling tasks is reduced by increasing the database polling frequency, it is easy to cause relatively large errors in the execution time of some delayed tasks.

Therefore, there is an urgent need for a processing method that can balance database performance and delay task execution accuracy.

Contents of the invention

Based on this, it is necessary to address the above technical problems and provide a processing method, device, computer equipment, computer readable storage medium and computer program product of a delayed task that does not affect the performance of the database and can perform the delayed task with high precision.

In a first aspect, the present application provides a method for processing delayed tasks. The methods include:

receiving a delayed task, and determining the delay time unit of the delayed task;

In response to the case where the delay time unit is the first level, use a message queue to execute a processing operation on the delay task, and generate a processing result of the delay task;

In response to the condition that the delayed time unit is the second level, the timing task is used to execute the processing operation on the delayed task, and a processing result of the delayed task is generated.

In one of the embodiments, the processing operation on the delayed task is performed by using the message queue, and the processing result of the delayed task is generated, including:

Use the message queue to start a pull thread, and use the pull thread to query tasks to be executed;

When there are multiple to-be-executed tasks, sort according to the execution time corresponding to each of the to-be-executed tasks, and determine the processing sequence corresponding to each of the to-be-executed tasks;

Each of the to-be-executed tasks is sequentially pulled by the pulling thread according to the processing sequence, and each of the to-be-executed tasks is sequentially processed according to the processing sequence to generate the processing result.

In one of the embodiments, before said sequentially processing each of said to-be-executed tasks according to said processing order and generating said processing result, it further includes:

Obtaining a task identifier of each task to be executed;

It is determined that there is no executed record carrying the same task identifier.

In one of the embodiments, using the timing task to execute the processing operation on the delayed task to generate the processing result of the delayed task includes:

Polling the timing task configuration table according to the preset execution frequency of the timing task to periodically pull tasks to be executed;

Execute processing operations on the to-be-executed tasks to generate the processing results.

In one of the embodiments, after performing the processing operation on the to-be-executed task and generating the processing result, it further includes:

updating the processing status of the to-be-executed task in the timing task configuration table to an executed status;

At a preset time, perform a data migration operation on the scheduled task configuration table, so as to migrate the delayed tasks whose processing status is executed in the scheduled task configuration table to the scheduled task configuration history table.

In one of the embodiments, the first level and the second level are determined according to the delay duration of the delayed task;

The delay time corresponding to the first level is shorter than the delay time corresponding to the second level.

In a second aspect, the present application also provides a device for processing delayed tasks. The devices include:

A unit determination module, configured to receive a delayed task and determine the delayed time unit of the delayed task;

A message processing module, configured to use a message queue to perform a processing operation on the delayed task and generate a processing result of the delayed task in response to the delay time unit being the first level;

The timing processing module is configured to use a timing task to perform a processing operation on the delayed task and generate a processing result of the delayed task in response to the condition that the delay time unit is the second level.

In a third aspect, the present application also provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, the method for processing a delayed task described in any one embodiment of the first aspect above is implemented.

In a fourth aspect, the present application also provides a computer-readable storage medium. The computer-readable storage medium has a computer program stored thereon, and when the computer program is executed by a processor, the method for processing a delayed task described in any one embodiment of the first aspect above is implemented.

In a fifth aspect, the present application also provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, implements the delayed task processing method in any one embodiment of the first aspect above.

In the processing method, device, computer equipment, storage medium and computer program product of the above-mentioned delayed task, the delay time unit of the delayed task is determined by receiving the delayed task, and in the case that the response delay time unit is the first level , use the message queue to execute the processing operation on the delayed task, generate the processing result of the delayed task, and use the timing task to execute the processing operation on the delayed task to generate the processing result of the delayed It can flexibly adopt different task processing methods for different levels of delayed tasks, so as to ensure the delay accuracy of delayed tasks and reduce the polling pressure on the database during delayed task processing.

Description of drawings

Fig. 1 is an application scenario diagram of a processing method for a delayed task in an embodiment;

Fig. 2 is a schematic flow chart of a processing method for a delayed task in an embodiment;

Fig. 3 is a schematic flow chart of message queue processing steps in an embodiment;

Fig. 4 is a schematic flow chart of the timing task processing steps in an embodiment;

FIG. 5 is a schematic flow diagram of a processing method for a delayed task in another embodiment;

Fig. 6 is a structural block diagram of a processing device for a delayed task in an embodiment;

Figure 7 is an internal block diagram of a computer device in one embodiment.

Detailed ways

In order to make the purpose, technical solution and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present application, and are not intended to limit the present application.

It should be noted that the user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all Information and data authorized by the user or fully authorized by all parties.

The method for processing a delayed task provided in the embodiment of the present application may be applied to the application scenario shown in FIG. 1 . Wherein, the terminal 110 may communicate with the server 100 through a network. Specifically, the server 100 may receive the delayed task 112 sent by the terminal 110 . The delay time of the delay task 112 is read, so as to determine the delay time unit to which the delay task 112 belongs. In response to the case where the delay time unit is the first level, the delayed task 112 is sent to the message queue 102 for processing, and the message queue 102 is used to execute processing operations on the delayed task 112 to generate a processing result of the delayed task 112 . Or, when the delay time unit is the second level, use the timing task 104 to initiate polling to the database to obtain the delay task 112, and use the timing task 104 to perform processing operations on the delay task 112 to generate a delay The processing result of task 112. Among them, the terminal 110 can be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, Internet of Things devices and portable wearable devices, and the Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart vehicle-mounted devices, etc. . Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, and the like. The server 100 can be implemented by an independent server or a server cluster composed of multiple servers.

In one embodiment, as shown in FIG. 2 , a method for processing a delayed task is provided. The application of the method to the server 100 in FIG. 1 is used as an example for illustration, including the following steps:

Step S202, receiving the delayed task, and determining the delay time unit of the delayed task.

Wherein, the delay time unit may include but not limited to seconds, minutes, hours, days, weeks and so on.

Specifically, after receiving the delayed task submitted by the terminal, the server may analyze the delayed task to obtain the corresponding delayed duration. Check the validity of the delay time, such as checking whether the delay time is a negative number, or checking whether the delay time exceeds the maximum delay threshold, etc., and storing the delayed tasks that pass the legality check in the server's task list middle. Each delayed task in the task list is traversed, and the delay time unit corresponding to the delayed task is determined according to the delay duration of the delayed task.

Step S204, in response to the condition that the delay time unit is the first level, use the message queue to execute the processing operation on the delayed task, and generate a processing result of the delayed task.

Wherein, the first level may be used to represent a level with a smaller delay time unit, such as a level corresponding to seconds.

Specifically, the server may post the delayed task to the delayed topic of the message queue kafka (a high-throughput distributed publish-subscribe message system) when the response delay time unit is the first level. Among them, the delay topic can be used to temporarily store the delay tasks that have not reached the delay time.

Use the message queue kafka to pull the delayed tasks that need to be executed immediately to the task topic in real time. The message queue kafka is used as the message consumer to consume and process the delayed task information under the task topic, and generate the processing result of the delayed task. Wherein, the processing result may include processing success or processing failure.

Step S206, in response to the condition that the delay time unit is the second level, use the timing task to perform processing operations on the delay task, and generate a processing result of the delay task.

Wherein, the second level may be used to represent a level with a larger delay time unit, such as a level corresponding to minutes, hours, or days.

Specifically, the server may store the delayed task in the timing task configuration table in the database in response to the fact that the delay time unit is the second level, and deliver the processing request of the delayed task to the timing task quartz (a A task scheduling framework).

Use the scheduled task quartz to scan the scheduled task configuration table in the database every preset period, that is, initiate a poll to the database every preset period, so as to pull the delayed tasks that need to be executed immediately after reaching the delay time in the database And store it in the task queue of the scheduled task. The timed task quartz is used to process the delayed tasks under the task queue, and generate the processing results of the delayed tasks.

In the above method for processing delayed tasks, the delay time unit of the delayed task is determined by receiving the delayed task, and in the case that the response delay time unit is the first level, the message queue is used to execute the processing of the delayed task Operation, to generate the processing result of the delayed task, in response to the delay time unit being the second level, use the timing task to execute the processing operation on the delayed task, and generate the processing result of the delayed task, which can be used for different levels Delayed tasks flexibly adopt different task processing methods, so as to ensure the delay accuracy of delayed tasks and reduce the polling pressure on the database during delayed task processing.

In one embodiment, as shown in FIG. 3 , in step S204, in response to the fact that the delay time unit is the first level, use the message queue to execute the processing operation on the delayed task, and generate the processing result of the delayed task, include:

Step S302, using the message queue to start a pull thread, and using the pull thread to query tasks to be executed.

Among them, the task to be executed can be used to represent the task whose waiting time has reached the delay time and needs to be executed immediately.

Specifically, the server may start a pull thread in the message queue in response to the delay time unit being the first level. Use the pull thread to query the delay topic in the message queue kafka in real time to determine whether there are tasks to be executed that have reached the delay time in the delay topic.

Step S304, when there are multiple tasks to be executed, sort according to the execution time corresponding to each task to be executed, and determine the processing sequence corresponding to each task to be executed.

Wherein, the execution time may be used to represent the moment when the task to be executed needs to be executed.

Specifically, when the server determines that there are multiple tasks to be executed in the delay topic, it can use the pull thread to sort according to the execution time corresponding to each task to be executed, for example, the delay time with the smallest time difference between the execution time and the current moment can be The task is determined as the first in the sorting, so as to obtain the processing sequence corresponding to each task to be executed.

Step S306, using the pulling thread to sequentially pull each delayed task to be processed according to the processing sequence, and process each pending task according to the processing sequence to generate a processing result.

Specifically, the server may use the pull thread to sequentially pull each pending delayed task into the task topic stored in the pending task according to the processing order. Use the message queue kafka to sequentially execute the processing operations on each pending task according to the processing order, and generate the processing results corresponding to each pending delayed task.

In this embodiment, by using the message queue to process the delayed task in real time, the delay accuracy of the delayed task processing can be improved.

In one embodiment, in step S306, each to-be-executed task is processed sequentially according to the processing order, and before generating the processing result, it further includes: obtaining the task identifier of each to-be-executed task, and determining that there is no executed task carrying the same task identifier. Record.

Specifically, a delayed task information table may be stored in the relational database of the server. The delayed task information table can record the detailed data of the delayed task, such as the delay time, processing status, and the task identification of the delayed task. Before using the message queue to process the pending tasks, the task ID of each pending task can be obtained. According to the task identifier of each task to be executed, query whether there is a delayed task processing record with the same task identifier and the task execution status as executed in the delayed task information table.

When the server determines that there is no executed record carrying the same task identifier, multiple tasks to be executed may be processed sequentially according to the processing order. And after the task to be executed is successfully processed, the execution state of the task corresponding to the task to be executed that is currently successfully processed and recorded in the delayed task information table is updated as executed.

Optionally, in some embodiments, when the server determines that there is an executed record carrying the same task identifier, the currently judged to-be-executed task may be removed, so as to avoid repeated execution of the to-be-executed task.

Optionally, in some embodiments, the server may also configure a retention period for the delayed task on the message queue. When the delayed tasks stored in the message queue expire, they will be cleared automatically. Thereby reducing the amount of data storage in the message queue and ensuring a high processing efficiency of the message queue.

In this embodiment, by querying whether there is an executed record carrying the same task ID as the task to be executed in the delayed task information table, repeated processing of the task to be executed can be avoided.

In one embodiment, as shown in FIG. 4, in step S206, in response to the fact that the delay time unit is the second level, use the timing task to execute the processing operation on the delay task, and generate the processing result of the delay task, include:

Step S402, polling the timing task configuration table according to the preset execution frequency of the timing task, so as to periodically fetch tasks to be executed.

Specifically, a scheduled task configuration table may be stored in the database of the server. The scheduled task configuration table is polled according to the preset execution frequency of the scheduled task to detect whether there is a task to be executed that has reached the delay time in the delayed tasks in the scheduled task configuration table. In this way, periodic fetching of tasks to be executed in the scheduled task configuration table is realized. Optionally, in some embodiments, the preset execution frequency may be polling once a minute, polling once every three hours, or polling once a day.

Step S404, execute the processing operation of the task to be executed, and generate the processing result.

Step S406, updating the processing status of the task to be executed in the scheduled task configuration table to the executed status.

Specifically, the server may use the timed task to perform a processing operation on the fetched task to be executed, and generate a processing result corresponding to the task to be executed. When the processing result is that the processing is successful, the processing status of the task to be executed that is currently processed successfully in the scheduled task configuration table may be updated to the executed state.

Optionally, in some embodiments, when the scheduled task pulls multiple tasks to be executed from the scheduled task configuration table, it can also be sorted according to the execution time corresponding to each task to be executed, and according to the processing obtained after sorting Sequentially execute the processing operations on each task to be executed sequentially.

Step S408, at a preset time, perform a data migration operation on the scheduled task configuration table, so as to migrate the pending tasks whose processing status is executed in the scheduled task configuration table to the scheduled task configuration history table.

Specifically, the server can add a new timed task configuration in the timed task configuration table, so that the timed task performs the data migration operation on the timed task configuration table at a preset time: obtain the processing status in the timed task configuration table as the executed state Delayed tasks in the executed state are migrated from the scheduled task configuration table to the scheduled task configuration history table.

Optionally, in some embodiments, the preset time can be set to twelve o'clock in the morning every day.

In this embodiment, by using the scheduled task to process the second-level delayed task, and executing the data migration operation on the scheduled task configuration table at a preset time, the polling pressure of the database can be reduced, thereby ensuring the performance of the database.

In an embodiment, the first level and the second level may be determined according to the delay time of the delayed task. The delay time corresponding to the first level is shorter than the delay time corresponding to the second level.

Optionally, in some embodiments, when the delay duration of the delayed task is X seconds, it may be determined that the delay time unit of the delayed task is the first level, that is, the first level at this time is the second level. When the delay time of the delayed task is Y minutes or Z hours or D days, it can be determined that the delay time unit of the delayed task is the second level, that is, the second level includes minute level, hour level or day level of any kind.

In this embodiment, by determining whether the delayed task belongs to the first level or the second level according to the delay duration of the delayed task, it is helpful to flexibly adopt different processing methods to execute the delayed task.

In one embodiment, as shown in FIG. 5 , a method for processing delayed tasks is provided, including:

Step S502, receiving the delayed task, and determining the delay time unit of the delayed task.

Specifically, the server may receive the delayed task, and store the delayed task in a corresponding list. Obtain the detailed data of the delayed task, so as to determine the delayed time unit of the delayed task.

When the delay time unit is second level, it is determined that the delay time unit of the delayed task is the first level. In the case that the response delay time unit is the first level, execute steps S504-S506.

When the delay time unit is minute level, hour level or day level, determine the delay time unit of the delayed task as the second level. In the case that the response delay time unit is the second level, execute steps S508-S510.

Step S504, using the message queue to start the pull thread to query the tasks to be executed, and determine the processing sequence corresponding to the tasks to be executed according to the execution time corresponding to the tasks to be executed.

Specifically, the server can use the message queue to start a pull thread to query tasks to be executed under the delay topic that have reached the delay time. When there are multiple tasks to be executed, they can be sorted according to the execution time of each task to be executed to obtain the processing order of each task to be executed.

Step S506, when there is no executed record carrying the same task ID as the task to be executed, each task to be executed is sequentially fetched and processed according to the processing order, and a processing result of each task to be executed is generated.

Specifically, it is queried in the delayed task information table of the server database whether there is an executed record carrying the same task identifier as the currently queried task to be executed. When there is no executed record carrying the same task identifier as the task to be executed, each task to be executed is sequentially pulled and processed according to the processing sequence, and the processing result of each task to be executed is generated. And if the processing result is successful, update the corresponding processing status in the delayed task information table.

Step S508, polling the timing task configuration table in the database according to the preset execution frequency of the timing task, to periodically fetch and process the tasks to be executed, and obtain the processing results of the tasks to be executed.

Specifically, the server may poll the scheduled task configuration table in the database according to the preset execution frequency of the scheduled task, and query whether there is a task to be executed in the scheduled task configuration table. When there are multiple tasks to be executed, the corresponding processing sequence is determined according to the execution time of each task to be executed. According to the processing sequence, the tasks to be executed are pulled and processed sequentially, and the processing results of the tasks to be executed are obtained. And when the processing result is successful, the processing status recorded in the scheduled task configuration table of the task to be executed is updated as executed.

Step S510, using the timed task to migrate the delayed tasks whose processing status is executed in the timed task configuration table to the timed task configuration history table at a preset time.

Specifically, the server may use the scheduled task to query the delayed task whose processing status is in the executed state in the scheduled task configuration table at a preset time. And migrate the queried delayed tasks to the scheduled task configuration history table. Among them, the scheduled task configuration history table does not participate in the database polling process of the scheduled task.

In this embodiment, by using the message queue to perform real-time pull processing on the delayed tasks whose delay duration is at the second level, the delay accuracy of the delayed task processing can be improved. By querying whether there is an executed record of the task to be executed before the message queue processes the task to be executed, repeated processing of the task to be executed can be avoided, thereby reducing the data processing amount of the message queue. By using scheduled tasks for database polling and pulling for delay tasks with a delay time of minutes, hours, or days, the number of polls to the database can be reduced, thereby ensuring the performance of the database. By performing data migration on the scheduled task configuration table at a preset time by the scheduled task, the amount of data in the scheduled task configuration table can be reduced, thereby reducing the database polling pressure.

It should be understood that although the steps in the flow charts involved in the above embodiments are shown sequentially according to the arrows, these steps are not necessarily executed sequentially in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in the flow charts involved in the above-mentioned embodiments may include multiple steps or stages, and these steps or stages are not necessarily executed at the same time, but may be performed at different times For execution, the execution sequence of these steps or stages is not necessarily performed sequentially, but may be performed in turn or alternately with other steps or at least a part of steps or stages in other steps.

Based on the same inventive concept, an embodiment of the present application further provides a delayed task processing apparatus for implementing the above-mentioned delay task processing method. The solution to the problem provided by the device is similar to the implementation described in the above method, so the specific limitations in the embodiment of the processing device for one or more delayed tasks provided below can be referred to above for delayed tasks The limitation of the processing method will not be repeated here.

In one embodiment, as shown in FIG. 6 , a delay task processing device 600 is provided, including: a unit determination module 602, a message processing module 604, and a timing processing module 606, wherein:

The unit determining module 602 is configured to receive a delayed task and determine a delayed time unit of the delayed task.

The message processing module 604 is configured to use the message queue to execute a processing operation on the delayed task and generate a processing result of the delayed task in response to the condition that the delayed time unit is the first level.

The timing processing module 606 is configured to use the timing task to perform a processing operation on the delayed task and generate a processing result of the delayed task in response to the condition that the delay time unit is the second level.

In one embodiment, the message processing module 604 includes: a thread query unit, configured to use a message queue to start a pull thread, and use the pull thread to query tasks to be executed; a sequence determination unit, configured to when there are multiple tasks to be executed , sort according to the execution time corresponding to each to-be-executed task, and determine the processing sequence corresponding to each to-be-executed task; the thread pulling unit is used to use the pulling thread to sequentially pull each to-be-executed task according to the processing order, and according to The processing sequence processes each task to be executed sequentially and generates a processing result.

In one embodiment, the message processing module 604 further includes: a record query unit, configured to obtain a task identifier of each task to be executed, and determine that there is no executed record carrying the same task identifier.

In one embodiment, the timing processing module 606 includes: a database polling unit, configured to poll the timing task configuration table according to the preset execution frequency of the timing task, to periodically pull tasks to be executed, and a task processing unit for Execute the processing operation of the task to be executed, and generate the processing result.

In one embodiment, the timing processing module 606 further includes: a status update unit, configured to update the processing status of the task to be executed in the timing task configuration table to an executed status, and a data migration unit, configured to , perform a data migration operation on the scheduled task configuration table, so as to migrate the delayed tasks whose processing status is executed in the scheduled task configuration table to the scheduled task configuration history table.

In one embodiment, the first level and the second level are determined according to the delay duration of the delayed task. The delay time corresponding to the first level is shorter than the delay time corresponding to the second level.

Each module in the above-mentioned device for processing delayed tasks may be fully or partially implemented by software, hardware or a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, and can also be stored in the memory of the computer device in the form of software, so that the processor can invoke and execute the corresponding operations of the above-mentioned modules.

In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure may be as shown in FIG. 7 . The computer device includes a processor, memory and a network interface connected by a system bus. Wherein, the processor of the computer device is used to provide calculation and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs and databases. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The database of the computer device is used to store the delay duration. The network interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a delayed task processing method is realized.

Those skilled in the art can understand that the structure shown in Figure 7 is only a block diagram of a part of the structure related to the solution of this application, and does not constitute a limitation to the computer equipment on which the solution of this application is applied. The specific computer equipment can be More or fewer components than shown in the figures may be included, or some components may be combined, or have a different arrangement of components.

In one embodiment, there is also provided a computer device, including a memory and a processor, where a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.

In one embodiment, there is also provided a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps in the foregoing method embodiments are implemented.

In one embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in the foregoing method embodiments are implemented.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented through computer programs to instruct related hardware, and the computer programs can be stored in a non-volatile computer-readable memory In the medium, when the computer program is executed, it may include the processes of the embodiments of the above-mentioned methods. Wherein, any reference to storage, database or other media used in the various embodiments provided in the present application may include at least one of non-volatile and volatile storage. Non-volatile memory can include read-only memory (Read-Only Memory, ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive variable memory (ReRAM), magnetic variable memory (Magnetoresistive Random Access Memory, MRAM), Ferroelectric Random Access Memory (FRAM), Phase Change Memory (Phase Change Memory, PCM), graphene memory, etc. The volatile memory may include random access memory (Random Access Memory, RAM) or external cache memory. As an illustration and not a limitation, RAM can be in various forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (Dynamic Random Access Memory, DRAM). The databases involved in the various embodiments provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a blockchain-based distributed database, etc., but is not limited thereto. The processors involved in the various embodiments provided by this application can be general-purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, data processing logic devices based on quantum computing, etc., and are not limited to this.

The technical features of the above embodiments can be combined arbitrarily. To make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be It is considered to be within the range described in this specification.

The above-mentioned embodiments only express several implementation modes of the present application, and the description thereof is relatively specific and detailed, but should not be construed as limiting the patent scope of the present application. It should be noted that those skilled in the art can make several modifications and improvements without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application should be determined by the appended claims.

Claims (10)

1. A processing method for a delayed task, characterized in that the method comprises: receiving a delayed task, and determining the delay time unit of the delayed task; In response to the case where the delay time unit is the first level, use a message queue to execute a processing operation on the delay task, and generate a processing result of the delay task; In response to the condition that the delayed time unit is the second level, the timing task is used to execute the processing operation on the delayed task, and a processing result of the delayed task is generated. 2. The method according to claim 1, wherein the processing operation of the delayed task by using a message queue to generate a processing result of the delayed task comprises: Use the message queue to start a pull thread, and use the pull thread to query tasks to be executed; When there are multiple to-be-executed tasks, sort according to the execution time corresponding to each of the to-be-executed tasks, and determine the processing sequence corresponding to each of the to-be-executed tasks; Each of the to-be-executed tasks is sequentially pulled by the pulling thread according to the processing sequence, and each of the to-be-executed tasks is sequentially processed according to the processing sequence to generate the processing result. 3. The method according to claim 2, characterized in that, before said sequentially processing each of said to-be-executed tasks according to said processing sequence and generating said processing result, further comprising: Obtaining a task identifier of each task to be executed; It is determined that there is no executed record carrying the same task identifier. 4. The method according to claim 1, wherein the processing operation of the delayed task by using the timing task to generate the processing result of the delayed task comprises: Polling the timing task configuration table according to the preset execution frequency of the timing task to periodically pull tasks to be executed; Execute processing operations on the to-be-executed tasks to generate the processing results. 5. The method according to claim 4, characterized in that, after performing the processing operation on the task to be executed and generating the processing result, further comprising: updating the processing status of the to-be-executed task in the timing task configuration table to an executed status; At a preset time, perform a data migration operation on the scheduled task configuration table, so as to migrate the delayed tasks whose processing status is executed in the scheduled task configuration table to the scheduled task configuration history table. 6. The method according to any one of claims 1 to 5, wherein the first level and the second level are determined according to the delay duration of the delayed task; The delay time corresponding to the first level is shorter than the delay time corresponding to the second level. 7. A processing device for delayed tasks, characterized in that the device comprises: A unit determination module, configured to receive a delayed task and determine the delayed time unit of the delayed task; A message processing module, configured to use a message queue to perform a processing operation on the delayed task and generate a processing result of the delayed task in response to the delay time unit being the first level; The timing processing module is configured to use a timing task to perform a processing operation on the delayed task and generate a processing result of the delayed task in response to the condition that the delay time unit is the second level. 8. A computer device, comprising a memory and a processor, the memory stores a computer program, wherein the processor implements the method according to any one of claims 1 to 6 when executing the computer program step. 9. A computer-readable storage medium, on which a computer program is stored, wherein when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are realized. 10. A computer program product, comprising a computer program, characterized in that, when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.