CN115061807A - Method for generating and scheduling execution of tasks as required - Google Patents
Method for generating and scheduling execution of tasks as required Download PDFInfo
- Publication number
- CN115061807A CN115061807A CN202210890451.1A CN202210890451A CN115061807A CN 115061807 A CN115061807 A CN 115061807A CN 202210890451 A CN202210890451 A CN 202210890451A CN 115061807 A CN115061807 A CN 115061807A
- Authority
- CN
- China
- Prior art keywords
- task
- execution
- time
- state
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/482—Application
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a method for generating, scheduling and executing tasks as required, which belongs to the technical field of computers and comprises task grouping and processing, task query, task on-demand generation, task retrieval, task scheduling and task asynchronous execution. The invention generates tasks and task lists as required, so that scheduling is timely and accurate, and system resources are optimally used; the state is monitored during the task execution, the problem that the dirty task can not be executed again forever due to failure is automatically solved, and the manual intervention is avoided; the problem of concurrent execution of tasks is solved, and only one task is effectively executed in the process of scheduling and executing the tasks.
Description
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a method for generating and scheduling and executing tasks as required.
Background
In the existing various software system applications, the time-consuming task requirements of various dimensions are infinite. The traditional processing mode comprises the steps of using timing polling scheduling, executing a preset task at fixed time intervals, and managing by a simple task state of waiting to be executed, executing in the middle of execution and finishing execution; the task is executed in real time, and is triggered in real time, but when the task triggering frequency is high, a large number of repeated concurrent tasks can be triggered. Two of these methods have the following problems: if the setting is too short, a plurality of simultaneously executed tasks can be generated when the last task is not completed, the system performance is lost, and the execution result is easy to generate errors because of the concurrent rush; and a second high-time-consumption task usually adopts an asynchronous calling mode, when the task starts to execute, the task state is set to be 'executing', if the execution of a program or a system executing the task is interrupted due to special reasons such as restart, downtime and the like, the task state is always 'executing', the task can never be re-executed, and manual intervention is needed. The first method for generating and scheduling the execution of tasks on demand also exists: whether the task needs to be executed really cannot be identified, and the task can only be called mechanically according to the set time period. In hundreds or thousands of tasks, task execution is meaningless if most of the task results are unchanged.
Therefore, the present invention provides a method for on-demand task generation and scheduling execution, so as to solve at least some of the above technical problems.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: a method for generating and scheduling execution of tasks on demand is provided to solve at least some of the above technical problems.
In order to achieve the purpose, the technical scheme adopted by the invention is as follows:
a method for generating and scheduling execution of tasks on demand comprises the following steps:
s1, grouping the tasks to be processed according to types, assigning task identifiers P1-Pn to each group, wherein the task identifiers of the tasks in the group are consistent with the task identifiers of the group, and storing the tasks into an asynchronous task execution list;
step S2, inquiring whether a task identifier P1 exists in the asynchronous task execution list and whether the task state is a task to be executed or in execution;
step S3, inquiring that no task with task identification P1 exists, generating a new task and storing the new task in an asynchronous task execution list;
step S4, searching whether the asynchronous task execution list has a task state to be executed or a task in execution at intervals;
step S5, searching the task state existing at the current time as the task to be executed or in execution, orderly scheduling the task execution and checking whether the task in execution has abnormal interruption;
and step S6, reporting the task execution state, monitoring whether the task is normally executed, and updating the task state immediately after the execution is finished.
Further, the step S3 specifically includes:
step S31, assigning task numbers to the tasks of the same type to be processed in sequence;
step S32, assigning the same task identifier P1 to each task;
step S33, assigning task states to each task in sequence as waiting for execution, and setting task execution period, task preparation execution time and allowed maximum disconnection time;
and step S34, storing the new task into the asynchronous task execution list.
Furthermore, each task is assigned with a task number from 1 to n in sequence for the tasks of the same type to be processed, and the task number of the first task is 1.
Further, the task preparation execution time is the sum of the system time and the task execution period, and the initial state of the task is to be executed.
Further, the step S5 specifically includes:
step S51, checking whether the task state of the task set is the task in execution;
step S52, if the task in the task set is in the executing state, the step S53 is entered, and if the task in the task set is not in the executing state, the step S55 is entered;
step S53, judging whether the current system time minus the last execution time of the task is less than the maximum allowable disconnection time;
step S54, subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be normally executed, and ending the process; subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be abnormally interrupted, setting the task state of the task to be interrupted, and jumping to the step S55;
step S55, checking whether the task state of the task set is a task to be executed;
step S56, the task set does not have a task state to be executed, and the process is ended;
step S57, the task set has task status as the task to be executed, and the preparation execution time is less than the current system time, and the process is ended; and the task set has a task state to be executed, the preparation execution time is greater than or equal to the current system time, and the asynchronous execution of the tasks is carried out.
Further, the step S6 specifically includes:
step 61, giving an internal execution identifier to the current task to be executed, and setting the internal execution identifier as 1;
step 62, updating the task state of the current task in the asynchronous task execution list to be in execution, and the last execution time to be system time;
step 63, executing a preset task processing program, and synchronously starting a state reporting program;
and step 64, finishing the task processing program, updating the task state of the current task to be execution completion or execution failure, and setting the internal execution identifier of the current task to be 0.
Further, an internal execution flag of 0 indicates that the task is finished being executed, and an internal execution flag of 1 indicates that the task is in execution.
Further, the status reporting procedure specifically includes: checking whether the internal execution identifier of the task is 0 or not at intervals of 5 seconds, wherein the internal execution identifier is 1, acquiring the current system time and updating the final execution time of the task in the asynchronous task execution list; and the internal execution identifier is 0, and the process is exited.
Further, executing the predetermined task processing program and enabling the state reporting program are performed in parallel and simultaneously.
Further, in step S4, the search interval time is 5 seconds.
Compared with the prior art, the invention has the following beneficial effects:
the invention generates tasks and task lists as required, so that the scheduling is timely and accurate, and the system resources are saved; the state is monitored during the task execution, the problem that the dirty task can not be executed again forever due to failure is automatically solved, and the manual intervention is avoided; the problem of concurrent execution of tasks is solved, and only one task is effectively executed in the process of scheduling and executing the tasks.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to the accompanying drawings. It should be apparent that the described embodiments are only some embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, the tasks and task lists are generated as required, so that scheduling is timely and accurate, and system resources are saved; the state is monitored during the task execution, the problem that the dirty task can not be executed again forever due to failure is automatically solved, and the manual intervention is avoided; the problem of concurrent execution of tasks is solved, and only one task is effectively executed in the process of scheduling and executing the tasks.
The invention comprises the following steps:
step S1, task grouping and processing: s1, grouping the tasks to be processed according to types, assigning task identifiers P1-Pn to each group, wherein the task identifiers of the tasks in the group are consistent with the task identifiers of the group, and storing the tasks into an asynchronous task execution list;
step S2, task query: inquiring whether a task identifier P1 exists in the asynchronous task execution list and whether the task state is a task to be executed or in execution;
step S3, task on-demand generation: generating a new task and storing the new task into an asynchronous task execution list after the task with the task identification P1 does not exist through inquiry;
step S4, task search: searching whether the asynchronous task execution list has a task state to be executed or a task in execution at intervals;
step S5, task scheduling: searching whether the task state existing at the current time is a task to be executed or in execution, orderly scheduling the task execution and checking whether the task in execution is abnormally interrupted;
step S6, asynchronous execution of tasks: and reporting the task execution state, monitoring whether the task is normally executed or not, and updating the task state immediately after the execution is finished.
The invention generates tasks according to needs, and does not have an execution plan when the tasks which do not need to be executed are scheduled. The invention establishes the task set for task execution and searches the task execution state in real time, thereby facilitating the generation and execution of new tasks in time and leading the system resources to run optimally.
Step S3 of the present invention specifically includes:
step S31, assigning task numbers to the tasks of the same type to be processed in sequence;
step S32, assigning the same task identifier P1 to each task;
step S33, assigning task states to each task in sequence as waiting for execution, and setting task execution period, task preparation execution time and allowed maximum disconnection time;
and step S34, storing the new task into the asynchronous task execution list.
Specifically, tasks of the same type to be processed are sequentially assigned with a task number from 1 to n, the task number of the first task is 1, and the tasks are sequentially processed. The task identifier P1 is used as an identifier of task processing, the task state includes, in the whole processing flow, to-be-executed, in-execution, execution completed, execution failed, and execution interrupted, and the initial states of the tasks are all to-be-executed.
When the task is queried in step S2 and the task having the task identifier P1 is found, there are three cases. The first type has only 1 state, i.e. the task to be executed; the second type has only 1 state, i.e. task under execution; the third type has 2 states, the task to be executed and the task in execution.
When the task is identified as P1 and the task state is the task to be executed, the task which is not executed currently exists, the process is ended and the task is not generated as required; only 1 task with the task status of P1 being in execution exists, which indicates that the current task is being executed and there is no task to be executed subsequently, and a scenario that the execution time of the task is long and may be longer than the execution period of the task needs to be considered, so at this time, it also needs to go to step S3, generate a new task to be executed, and store the new task into the asynchronous task execution list.
Specifically, if the task execution period is 10 minutes, the task is executed after 10 minutes; the task preparation execution time is the sum of the system time and the task execution period, namely the time for the task to be executed; the allowed maximum disconnection time is the maximum time allowed when the task executes the abnormal interruption, and the task is judged to execute the abnormal interruption after the allowed maximum disconnection time is exceeded; while the last execution time is only valid if the state is in execution.
Step S5 and task scheduling specifically include:
step S51, checking whether the task state of the task set is the task in execution;
step S52, if the task in the task set is in the executing state, the step S53 is entered, and if the task in the task set is not in the executing state, the step S55 is entered;
step S53, judging whether the current system time minus the last execution time of the task is less than the maximum allowable disconnection time;
step S54, subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be normally executed, and ending the process; subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be abnormally interrupted, setting the task state of the task to be interrupted, and jumping to the step S55;
step S55, checking whether the task state of the task set is a task to be executed;
step S56, the task set does not have a task state to be executed, and the process is ended;
step S57, the task set has task status as the task to be executed, and the preparation execution time is less than the current system time, and the process is ended; and the task set has a task state to be executed, the preparation execution time is greater than or equal to the current system time, and the asynchronous execution of the tasks is carried out.
Specifically, step S5 is triggered by the interval search of step S4, the search interval time is 5 seconds, no task is searched for a task whose task status is execution completion, 5 seconds are waited for, and the check is interrupted. And if the task state is the task which is completed by execution, circularly processing each task set according to the grouping marks of the task identifiers. The task scheduling can realize the real-time monitoring of the task execution state by subtracting the comparison between the final execution time of the task and the maximum disconnection time from the system time, solve the problem of executing interrupted dirty tasks due to special reasons such as restart, downtime and the like, and avoid manual intervention.
The step S6 of the present invention specifically includes the following steps:
step 61, giving an internal execution identifier to the current task to be executed, and setting the internal execution identifier as 1;
step 62, updating the task state of the current task in the asynchronous task execution list to be in execution, and the last execution time to be system time;
step 63, executing a preset task processing program and synchronously starting a state reporting program;
and step 64, finishing the task processing program, updating the task state of the current task to be execution completion or execution failure, and setting the internal execution identifier of the current task to be 0.
Wherein, the internal execution flag is 0 to indicate that the task is finished, and the internal execution flag is 1 to indicate that the task is in execution.
The state reporting program specifically comprises: checking whether the internal execution identifier of the task is 0 or not at intervals of 5 seconds, wherein the internal execution identifier is 1, namely the task is in execution, acquiring the current system time and updating the final execution time of the task in an asynchronous task execution list; and the internal execution identifier is 0, namely the task execution is finished, and the process is exited. The invention executes the scheduled task processing program and the starting state reporting program at the same time, and ensures that the task has only one effective executing example in the scheduling execution.
Finally, it should be noted that: the above embodiments are only preferred embodiments of the present invention to illustrate the technical solutions of the present invention, but not to limit the technical solutions, and certainly not to limit the patent scope of the present invention; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention; that is, the technical problems to be solved by the present invention, which are not substantially changed or supplemented by the spirit and the concept of the main body of the present invention, are still consistent with the present invention and shall be included in the scope of the present invention; in addition, the technical scheme of the invention is directly or indirectly applied to other related technical fields, and the technical scheme of the invention is included in the patent protection scope of the invention.
Claims (10)
1. A method for generating and scheduling execution of tasks on demand is characterized by comprising the following steps:
s1, grouping the tasks to be processed according to types, assigning task identifiers P1-Pn to each group, wherein the task identifiers of the tasks in the group are consistent with the task identifiers of the group, and storing the tasks into an asynchronous task execution list;
step S2, inquiring whether a task identifier P1 exists in the asynchronous task execution list and whether the task state is a task to be executed or in execution;
step S3, inquiring that no task with task identification P1 exists, generating a new task and storing the new task in an asynchronous task execution list;
step S4, searching whether the asynchronous task execution list has a task state to be executed or a task in execution at intervals;
step S5, searching the task state existing at the current time as the task to be executed or in execution, orderly scheduling the task execution and checking whether the task in execution has abnormal interruption;
and step S6, reporting the task execution state, monitoring whether the task is normally executed, and updating the task state immediately after the execution is finished.
2. The method for on-demand generation and scheduling execution of tasks according to claim 1, wherein the step S3 specifically comprises:
step S31, assigning task numbers to the tasks of the same type to be processed in sequence;
step S32, assigning the same task identifier P1 to each task;
step S33, assigning task states to each task in sequence as waiting for execution, and setting task execution period, task preparation execution time and allowed maximum disconnection time;
and step S34, storing the new task into the asynchronous task execution list.
3. The method of claim 2, wherein the tasks of the same type to be processed are assigned a task number from 1 to n in sequence, and the task number of the first task is 1.
4. The method of claim 2, wherein the task preparation execution time is system time plus a task execution period, and the initial state of the task is to be executed.
5. The method for on-demand generation and scheduling execution of tasks according to claim 2, wherein the step S5 specifically comprises:
step S51, checking whether the task state of the task set is the task in execution;
step S52, if the task in the task set is in the executing state, the step S53 is entered, and if the task in the task set is not in the executing state, the step S55 is entered;
step S53, judging whether the current system time minus the last execution time of the task is less than the maximum allowable disconnection time;
step S54, subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be normally executed, and ending the process; subtracting the maximum disconnection time allowed by the last execution time of the task from the current system time, judging the task to be abnormally interrupted, setting the task state of the task to be interrupted, and jumping to the step S55;
step S55, checking whether the task state of the task set is a task to be executed;
step S56, the task set does not have a task state to be executed, and the process is ended;
step S57, the task set has task status as the task to be executed, and the preparation execution time is less than the current system time, and the process is ended; and the task set has a task state to be executed, the preparation execution time is greater than or equal to the current system time, and the asynchronous execution of the tasks is carried out.
6. The method for on-demand generation and scheduling execution of tasks according to claim 5, wherein the step S6 specifically comprises:
step 61, giving an internal execution identifier to the current task to be executed, and setting the internal execution identifier as 1;
step 62, updating the task state of the current task in the asynchronous task execution list to be in execution, and the last execution time to be system time;
step 63, executing a preset task processing program and synchronously starting a state reporting program;
and step 64, finishing the task processing program, updating the task state of the current task to be execution completion or execution failure, and setting the internal execution identifier of the current task to be 0.
7. The method of claim 6, wherein the internal execution flag is 0 to indicate the end of the task execution, and the internal execution flag is 1 to indicate the task is in execution.
8. The method for task on-demand generation and scheduling execution according to claim 6, wherein the status reporting procedure specifically comprises: checking whether the internal execution identifier of the task is 0 or not at an interval of 5 seconds, wherein the internal execution identifier is 1, acquiring the current system time and updating the last execution time of the task in the asynchronous task execution list; and the internal execution identifier is 0, and the process is exited.
9. The method of claim 6, wherein the execution of the predetermined task handler and the enabling status reporting procedure are performed concurrently.
10. The method for on-demand task generation and scheduling execution according to claim 1, wherein in the step S4, the retrieval interval time is 5 seconds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210890451.1A CN115061807A (en) | 2022-07-27 | 2022-07-27 | Method for generating and scheduling execution of tasks as required |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210890451.1A CN115061807A (en) | 2022-07-27 | 2022-07-27 | Method for generating and scheduling execution of tasks as required |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115061807A true CN115061807A (en) | 2022-09-16 |
Family
ID=83205557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210890451.1A Pending CN115061807A (en) | 2022-07-27 | 2022-07-27 | Method for generating and scheduling execution of tasks as required |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115061807A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003050709A (en) * | 2001-08-06 | 2003-02-21 | Matsushita Electric Ind Co Ltd | Method and device for task scheduling |
| CN102981904A (en) * | 2011-09-02 | 2013-03-20 | 阿里巴巴集团控股有限公司 | Task scheduling method and system |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN110825505A (en) * | 2019-10-29 | 2020-02-21 | 深圳前海环融联易信息科技服务有限公司 | Task scheduling method and device, computer equipment and storage medium |
| CN110955508A (en) * | 2019-11-28 | 2020-04-03 | 广州鼎甲计算机科技有限公司 | Asynchronous task scheduling method and device based on distributed architecture and computer equipment |
| CN112486657A (en) * | 2020-12-16 | 2021-03-12 | 广东电网有限责任公司惠州供电局 | Task scheduling method and system |
| CN112633710A (en) * | 2020-12-26 | 2021-04-09 | 中国农业银行股份有限公司 | Job task scheduling method, device, equipment and storage medium |
| CN113448712A (en) * | 2021-07-12 | 2021-09-28 | 中国银行股份有限公司 | Task scheduling execution method and device |
-
2022
- 2022-07-27 CN CN202210890451.1A patent/CN115061807A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003050709A (en) * | 2001-08-06 | 2003-02-21 | Matsushita Electric Ind Co Ltd | Method and device for task scheduling |
| CN102981904A (en) * | 2011-09-02 | 2013-03-20 | 阿里巴巴集团控股有限公司 | Task scheduling method and system |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN110825505A (en) * | 2019-10-29 | 2020-02-21 | 深圳前海环融联易信息科技服务有限公司 | Task scheduling method and device, computer equipment and storage medium |
| CN110955508A (en) * | 2019-11-28 | 2020-04-03 | 广州鼎甲计算机科技有限公司 | Asynchronous task scheduling method and device based on distributed architecture and computer equipment |
| CN112486657A (en) * | 2020-12-16 | 2021-03-12 | 广东电网有限责任公司惠州供电局 | Task scheduling method and system |
| CN112633710A (en) * | 2020-12-26 | 2021-04-09 | 中国农业银行股份有限公司 | Job task scheduling method, device, equipment and storage medium |
| CN113448712A (en) * | 2021-07-12 | 2021-09-28 | 中国银行股份有限公司 | Task scheduling execution method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108600353B (en) | Parallel block synchronization method of block chain nodes | |
| CN108563502B (en) | Task scheduling method and device | |
| CN109857527A (en) | A kind of distributed task dispatching method, system, distributed devices and Redis database | |
| CN107688489B (en) | Method and system for scheduling tasks | |
| CN110750343B (en) | Cluster system timing task scheduling control method and cluster system | |
| CN110597695A (en) | Alarm method, alarm device, computer equipment and readable storage medium | |
| CN111371599A (en) | Cluster disaster recovery management system based on ETCD | |
| CN110704172B (en) | Cluster system timing task scheduling method and cluster system | |
| CN113703946B (en) | Application recovery method and device, electronic equipment and computer readable storage medium | |
| CN115001990A (en) | Cross-region openstack cluster management method and system based on declarative API | |
| CN105653556B (en) | Data aging method and device | |
| CN115061807A (en) | Method for generating and scheduling execution of tasks as required | |
| CN116701063B (en) | Persistence method, device and system for internal memory state data for data language of digital networking | |
| CN108536541B (en) | Process engine object processing method and device | |
| CN110134512B (en) | Method, device, equipment and storage medium for cluster server to execute tasks | |
| CN110688211A (en) | Distributed job scheduling method | |
| CN108255704B (en) | Abnormal response method of script calling event and terminal thereof | |
| CN111427864A (en) | Batch archiving method, device, equipment and storage medium for data | |
| CN115878423A (en) | High-concurrency scene batch ending judgment method and system and computer equipment thereof | |
| CN111444033A (en) | Springbatch-based task fault-tolerant processing method and related equipment | |
| CN111258728A (en) | Task execution method and device, storage medium and electronic device | |
| CN113032131B (en) | Redis-based distributed timing scheduling system and method | |
| CN113722075B (en) | Task management method, system, equipment and storage medium | |
| CN112596887B (en) | Analysis method for batch delay and related device | |
| CN113204434B (en) | Planned task execution method and device based on k8s and computer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220916 |