CN112286704A - Processing method and device of delay task, computer equipment and storage medium - Google Patents
Processing method and device of delay task, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112286704A CN112286704A CN202011301503.4A CN202011301503A CN112286704A CN 112286704 A CN112286704 A CN 112286704A CN 202011301503 A CN202011301503 A CN 202011301503A CN 112286704 A CN112286704 A CN 112286704A
- Authority
- CN
- China
- Prior art keywords
- task
- delay
- time
- queue
- execution
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application provides a processing method and device of a delay task, computer equipment and a storage medium, relates to the technical field of data processing, and is used for reducing system resources occupied by processing the delay task. The method mainly comprises the following steps: obtaining a delay task in a task execution queue, wherein the delay task carries task execution time; calculating the execution residual time of the delayed task according to the task execution time and the current time; loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue; and loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for processing a delay task, a computer device, and a storage medium.
Background
As some service scenarios of the open platform require delayed execution of some services, such as checking whether to pay for a second half hour, checking whether to use after sending out an activity invitation code for 3 days, and the like, the delayed execution time is not fixed, and as the traffic volume and the users increase, the number of delayed tasks is also large.
Currently, each task is added to a delay queue, and then whether the task needs to be executed is detected according to a timing scanning function of the delay queue. However, the maximum delay time of the delay queue is fixed, and if the maximum delay time is 1 hour, for a delay task exceeding one hour, the delay task will be continuously timed in the delay queue to calculate whether the execution time of the task is reached, so that the processing of the existing delay task will occupy more system resources.
Disclosure of Invention
The embodiment of the application provides a processing method and device of a delay task, computer equipment and a storage medium, which are used for reducing system resources occupied by processing the delay task.
The embodiment of the invention provides a processing method of a delay task, which comprises the following steps:
obtaining a delay task in a task execution queue, wherein the delay task carries task execution time;
calculating the execution residual time of the delayed task according to the task execution time and the current time;
loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
The embodiment of the invention provides a processing device of a delay task, which comprises:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a delay task in a task execution queue, and the delay task carries task execution time;
the computing module is used for computing the execution residual time of the delay task according to the task execution time and the current time;
the loading module is used for loading the delay tasks of which the execution residual time is less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and the execution module is used for loading the delay tasks in the preloading queue into the delay queue and executing the delay tasks in the delay queue according to a preset time interval.
A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the processing method of the above-mentioned delay task.
A computer-readable storage medium, which stores a computer program, which, when executed by a processor, implements the processing method of the above-described delayed task.
The invention provides a processing method, a device, computer equipment and a storage medium of a delay task, which comprises the steps of firstly obtaining the delay task in a task execution queue, wherein the delay task carries task execution time; then, calculating the execution residual time of the delayed task according to the task execution time and the current time; and loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval. Compared with the prior art that each delay task is added to the delay queue, the invention calculates the execution residual time of the delay task according to the task execution time and the current time, and then loads the delay task of which the execution residual time is less than or equal to the preset value to the preloading queue.
Drawings
Fig. 1 is a flowchart of a processing method of a delay task according to a first embodiment of the present application;
fig. 2 is a flowchart of a processing method of a delayed task according to a second embodiment of the present application;
fig. 3 is a block diagram illustrating a processing apparatus for delayed tasks according to an embodiment of the present application;
fig. 4 is a schematic diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to better understand the technical solutions described above, the technical solutions of the embodiments of the present application are described in detail below with reference to the drawings and the specific embodiments, and it should be understood that the specific features of the embodiments and the embodiments of the present application are detailed descriptions of the technical solutions of the embodiments of the present application, and are not limitations of the technical solutions of the present application, and the technical features of the embodiments and the embodiments of the present application may be combined with each other without conflict.
First embodiment
Referring to fig. 1, a method for processing a delay task according to a first embodiment of the present invention is shown, and the method specifically includes steps S10-S40:
step S10, obtain the delay task in the task execution queue.
The delay task carries task execution time, and the task execution time is the time that the delay task needs to be executed in a timing mode.
And step S20, calculating the execution residual time of the delay task according to the task execution time and the current time.
For example, when the delayed task a is received, the task execution time of the delayed task a is 10/month/9/15: 00 in 2020, and if the current time is 13:00 in 10/month/9 in 2020, the residual execution time of the delayed task is calculated to be 2 hours, that is, the delayed task is triggered to be executed after 2 hours from the current time.
And step S30, loading the delay task whose execution remaining time is less than or equal to a preset value into a preloading queue.
The preset value is smaller than the maximum delay time of the delay queue, the maximum delay time is the longest timing time of the delay queue, and may be 1 hour, 2 hours, 5 hours, and the like.
The residual time of the execution of the delayed task is less than or equal to the maximum delay time. For example, the maximum delay time is 1 hour, the preset value may be 30 minutes, 40 minutes, or 50 minutes, and the like, that is, the delay task may be loaded into the preload queue as long as the execution remaining time of the delay task is less than 30 minutes, 40 minutes, or 50 minutes.
Step S40, loading the delay tasks in the preload queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
The preset time interval is a fixed time step of the delay queue, and may be specifically 1 minute, 2 minutes, and the like, and the embodiment of the present invention is not specifically limited.
The invention provides a processing method of a delay task, which comprises the steps of firstly obtaining the delay task in a task execution queue, wherein the delay task carries task execution time; then, calculating the execution residual time of the delayed task according to the task execution time and the current time; and loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval. Compared with the prior art that each delay task is added to the delay queue, the invention calculates the execution residual time of the delay task according to the task execution time and the current time, and then loads the delay task of which the execution residual time is less than or equal to the preset value to the preloading queue.
Second embodiment
Referring to fig. 2, a method for processing a delay task according to a second embodiment of the present invention is shown, the method specifically includes steps S01-S05:
step S01, obtain the delay task in the task execution queue.
The delay task carries task execution time.
And step S02, sequencing the delay tasks in the task execution queue from the back to the first according to the task execution time.
For example, there are a delay task 1, a delay task 2, and a delay task 3, where when the task execution time of the delay task 1 is 15:00 at 10 months and 9 days in 2020, the task execution time of the delay task 2 is 10 months and 9 days in 2020, 10:00 at 10 days in 2020, and the task execution time of the delay task 3 is 19:00 at 10 months and 9 days in 2020, the task execution times are sorted in order from the back to the front, and the obtained task execution queues are (the delay task 3, the delay task 1, and the delay task 2).
In an embodiment provided by the present invention, when a new delay task appears in the task execution queue, the new delay task is inserted into a position corresponding to a sequencing result of the task execution queue according to the task execution time of the new delay task. And if the remaining time of the new delay task is less than the preset value, loading the new task into the preloading delay queue.
For example, a new delayed task 4, a delayed task 5, a delayed task 4 with a task execution time of 18:00 at 10/9/2020, a delayed task 5 with a task execution time of 8:20 at 10/9/2020, if the sequencing result of the current task execution queue is (delayed task 3, delayed task 1, and delayed task 2), specifically, a delayed task 1 with a task execution time of 15:00 at 10/9/10/00 at 2020, a delayed task 2 with a task execution time of 10/9/10/00 at 2020, and a delayed task 3 with a task execution time of 19:00 at 10/9/2020. The current time is 10 months, 9 days, 8:00 in 2020, and the preset value is 30 minutes. For the delay task 4, the result obtained after the delay task 4 needs to be inserted into the task execution queue is (delay task 3, delay task 4, delay task 1, and delay task 2), and for the delay task 5, the execution residual time of the delay task 5 is calculated to be 20 minutes, that is, the delay task 5 is smaller than the preset value, and at this time, the delay task 5 needs to be directly loaded into the preloading delay queue.
And step S03, sequentially calculating the execution residual time of the delay tasks according to the sequence of the sequencing results of the task execution queues from back to front.
And step S04A, if the remaining time of the current delay task is less than or equal to a preset value, loading the current delay task to the preloading queue, and calculating the execution remaining time of the last delay task.
And step S04B, if the execution residual time of the current delay task is greater than a preset value, stopping calculating the residual time of the last delay task.
Step S05, loading the delay tasks in the preload queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
For example, the sequencing result of the task execution queue is (delayed task 3, delayed task 4, delayed task 1, delayed task 2), the task execution time of delayed task 1 is 10/month/9/10: 20 in 2020, the task execution time of delayed task 2 is 10/month/9/10: 00 in 2020, the task execution time of delayed task 3 is 10/month/9/19: 00 in 2020, and the task execution time of delayed task 4 is 10/month/9/11: 00 in 2020.
If the current time is 10, 9, 55 in 2020 and the preset value is 30 minutes, firstly calculating the execution residual time of the delay task 2 according to the sequence of the sequencing result from back to front, namely the execution residual time of the delay task 2 is 5 minutes, loading the delay task 2 into the preloading queue and calculating the execution residual time of the last delay task (delay task 1) because the residual time of the delay task 2 is less than or equal to the preset value, loading the delay task 1 into the preloading queue and calculating the execution residual time of the last delay task (delay task 4) because the execution residual time of the last delay task (delay task 1) is 25 minutes, calculating the execution residual time of the delay task 4 is 65 minutes, stopping calculating the execution residual time of the last delay task (delay task 3) because the execution residual time of the delay task 4 is greater than the preset value, i.e. this round of computation loads only delay task 2 and delay task 1 into the preload queue.
According to the processing method of the delay tasks, provided by the embodiment of the invention, the delay tasks in the task execution queue are sequenced from back to first according to the task execution time, and the execution residual time of the delay tasks is sequentially calculated according to the sequence of the sequencing result of the task execution queue from back to first. If the remaining time of the current delay task is less than or equal to a preset value, loading the current delay task to the preloading queue, and calculating the execution remaining time of the last delay task; and if the execution residual time of the current delay task is greater than a preset value, stopping calculating the residual time of the last delay task. Therefore, the invention reduces the calculation amount of the execution residual time and improves the efficiency of loading the delay task in the preloading queue.
In another embodiment provided by the present invention, the method further comprises: and loading the delay tasks in the preloading queue into the delay queue according to a preset time period, wherein the preset time period is less than the preset time interval. For example, the preset time interval is 3 minutes, that is, a time-up delay task is executed every 3 minutes in the delay queue, and the preset time period may be set to be less than 3 minutes, such as 1 minute, 2 minutes, and the like, and the embodiment of the present invention is not limited specifically. In the embodiment of the invention, the delay tasks in the preloading queue are loaded into the delay queue according to the preset time period, so that the frequency of loading the delay tasks into the delay queue can be reduced, and the delay tasks can be executed in the task execution time, thereby further reducing the resource waste caused by loading the delay tasks into the delay queue.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In an embodiment, a processing device for a delay task is provided, and the processing device for the delay task corresponds to the processing method for the delay task in the foregoing embodiment one to one. As shown in fig. 3, the functional modules of the processing apparatus for the delayed task are described in detail as follows:
an obtaining module 10, configured to obtain a delay task in a task execution queue, where the delay task carries a task execution time;
a calculating module 20, configured to calculate the execution remaining time of the delay task according to the task execution time and the current time;
a loading module 30, configured to load the delay task whose execution remaining time is less than or equal to a preset value into a preload queue, where the preset value is less than the maximum delay time of the delay queue;
and the execution module 40 is configured to load the delay tasks in the preload queue into the delay queue, and execute the delay tasks in the delay queue according to a preset time interval.
Further, the apparatus further comprises:
a sorting module 50, configured to sort the delayed tasks in the task execution queue from the last to the first according to the task execution time;
the calculating module 20 is further configured to sequentially calculate the remaining time for executing the delayed tasks according to a sequence of the sequencing results of the task execution queues from back to front.
Specifically, the execution module 40 includes:
a loading unit 41, configured to load the current delay task into the preload queue and calculate the remaining time of the last delay task if the remaining time of the current delay task is less than or equal to a preset value;
the stopping unit 42 stops calculating the execution remaining time of the previous delay task if the execution remaining time of the current delay task is greater than a preset value.
Further, the apparatus further comprises:
and an inserting module 60, configured to insert, when a new delay task occurs in the task execution queue, the new delay task into a position corresponding to a sequencing result of the task execution queue according to a task execution time of the new delay task.
Further, the loading module 30 is further configured to load the new task into the pre-loading delay queue if the remaining time of the new delay task is less than the preset value.
Specifically, the loading module 30 is configured to load the delay task in the preload queue into the delay queue according to a preset time period, where the preset time period is smaller than the preset time interval.
For specific limitations of the processing device of the delay task, reference may be made to the above limitations on the processing method of the delay task, and details are not described here. The various modules in the above-described apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of processing a delayed task.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
obtaining a delay task in a task execution queue, wherein the delay task carries task execution time;
calculating the execution residual time of the delayed task according to the task execution time and the current time;
loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
obtaining a delay task in a task execution queue, wherein the delay task carries task execution time;
calculating the execution residual time of the delayed task according to the task execution time and the current time;
loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (10)
1. A processing method of a delay task is characterized by comprising the following steps:
obtaining a delay task in a task execution queue, wherein the delay task carries task execution time;
calculating the execution residual time of the delayed task according to the task execution time and the current time;
loading the delay tasks with the execution residual time less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and loading the delay tasks in the preloading queue into the delay queue, and executing the delay tasks in the delay queue according to a preset time interval.
2. The method for processing a delayed task according to claim 1, wherein before calculating the execution remaining time of the delayed task according to the task execution time and the current time, the method further comprises:
sequencing the delay tasks in the task execution queue from the back to the first according to the task execution time;
the calculating the execution residual time of the delayed task according to the task execution time and the current time comprises the following steps:
and sequentially calculating the execution residual time of the delayed tasks according to the sequence of the sequencing results of the task execution queues from back to front.
3. The method for processing the delayed task according to claim 2, wherein the loading the delayed task whose execution remaining time is less than or equal to a preset value into a preload queue comprises:
if the remaining time of the current delay task is less than or equal to a preset value, loading the current delay task to the preloading queue, and calculating the remaining time of the last delay task;
and if the execution residual time of the current delay task is greater than a preset value, stopping calculating the execution residual time of the last delay task.
4. The method for processing the delayed task according to claim 2, wherein the method further comprises:
and when a new delay task appears in the task execution queue, inserting the new delay task into a position corresponding to a sequencing result of the task execution queue according to the task execution time of the new delay task.
5. The method for processing the delayed task according to claim 4, wherein the method further comprises:
and if the remaining time of the new delay task is less than the preset value, loading the new task into the preloading delay queue.
6. The method for processing the delay task according to claim 1, wherein the loading the delay task in the preload queue into the delay queue comprises:
and loading the delay tasks in the preloading queue into the delay queue according to a preset time period, wherein the preset time period is less than the preset time interval.
7. An apparatus for processing a delayed task, the apparatus comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a delay task in a task execution queue, and the delay task carries task execution time;
the computing module is used for computing the execution residual time of the delay task according to the task execution time and the current time;
the loading module is used for loading the delay tasks of which the execution residual time is less than or equal to a preset value into a preloading queue, wherein the preset value is less than the maximum delay time of the delay queue;
and the execution module is used for loading the delay tasks in the preloading queue into the delay queue and executing the delay tasks in the delay queue according to a preset time interval.
8. The apparatus for processing delayed tasks according to claim 7, wherein said apparatus further comprises:
the sequencing module is used for sequencing the delay tasks in the task execution queue from the back to the first according to the task execution time;
the computing module is further configured to sequentially compute the execution remaining time of the delayed tasks according to a sequence from the back to the first of the sequencing results of the task execution queue.
9. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the processing method of the delayed task according to any one of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method for processing the delayed task according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011301503.4A CN112286704B (en) | 2020-11-19 | 2020-11-19 | Processing method and device of delay task, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011301503.4A CN112286704B (en) | 2020-11-19 | 2020-11-19 | Processing method and device of delay task, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112286704A true CN112286704A (en) | 2021-01-29 |
| CN112286704B CN112286704B (en) | 2023-08-15 |
Family
ID=74398766
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011301503.4A Active CN112286704B (en) | 2020-11-19 | 2020-11-19 | Processing method and device of delay task, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112286704B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108628671A (en) * | 2018-04-28 | 2018-10-09 | 北京顶象技术有限公司 | Method for scheduling task and device |
| CN109684069A (en) * | 2017-10-13 | 2019-04-26 | 华为技术有限公司 | The method and terminal device of resource management |
| CN110196761A (en) * | 2019-04-15 | 2019-09-03 | 北京达佳互联信息技术有限公司 | Delay task processing method and processing device |
-
2020
- 2020-11-19 CN CN202011301503.4A patent/CN112286704B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109684069A (en) * | 2017-10-13 | 2019-04-26 | 华为技术有限公司 | The method and terminal device of resource management |
| CN108628671A (en) * | 2018-04-28 | 2018-10-09 | 北京顶象技术有限公司 | Method for scheduling task and device |
| CN110196761A (en) * | 2019-04-15 | 2019-09-03 | 北京达佳互联信息技术有限公司 | Delay task processing method and processing device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112286704B (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110851159B (en) | Business rule updating method and device, computer equipment and storage medium | |
| CN109062788B (en) | Test case generation method and device, computer equipment and storage medium | |
| CN110928653B (en) | Cross-cluster task execution method and device, computer equipment and storage medium | |
| CN112256417B (en) | Data request processing method and device and computer readable storage medium | |
| CN112395202B (en) | Interface automation test method and device, computer equipment and storage medium | |
| CN110688168A (en) | Method, device and equipment for improving starting speed of application program and storage medium | |
| CN110147258B (en) | Method and device for improving program loading efficiency, computer equipment and storage medium | |
| CN114385485A (en) | Interface test method, device, equipment and storage medium | |
| US20220035666A1 (en) | Method and apparatus for data processing, server and storage medium | |
| CN112286704A (en) | Processing method and device of delay task, computer equipment and storage medium | |
| CN109547253B (en) | File downloading method and device, computer equipment and storage medium | |
| CN115729705A (en) | Distributed task batch processing method, device, equipment and storage medium | |
| CN111079390B (en) | Method and device for determining selection state of check box list | |
| CN114661545A (en) | Method, device and equipment for monitoring processor resources and storage medium | |
| CN112395057A (en) | Data processing method and device based on timing task and computer equipment | |
| CN113377397A (en) | Configuration updating method and device, computer equipment and storage medium | |
| CN112732819A (en) | ETL-based data processing method, device, equipment and storage medium | |
| CN112181831A (en) | Script performance verification method, device and equipment based on keywords and storage medium | |
| CN111258728A (en) | Task execution method and device, storage medium and electronic device | |
| CN106897158B (en) | data loading method and device | |
| CN110969430A (en) | Method and device for identifying suspicious user, computer equipment and storage medium | |
| CN110740062A (en) | Breakpoint resume method and device | |
| CN112766768B (en) | Contract flow management method and device, electronic equipment and readable storage medium | |
| CN115277714B (en) | Method, device, equipment and computer readable storage medium for repairing service registration abnormality | |
| CN115841259B (en) | Thread management method, device, computer equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |