Automatic task adaptive scheduling method and device, electronic equipment and storage medium

Abstract

The invention provides an automatic task adaptive scheduling method and device, electronic equipment and a storage medium, and the method comprises the steps: detecting and determining a ready task which is not operated, and determining a first actuator corresponding to the ready task; executing the processing ready task based on the first executor; after the ready task is processed, determining a task dependency relationship of the ready task; according to the task dependency relationship, subsequent tasks are determined and triggered, and the ready tasks are direct preposed tasks of the subsequent tasks. Therefore, active triggering of the automatic task is realized, wait-free coherent execution of the task chain is realized, and the processing efficiency is effectively improved.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of software development, in particular to an automatic task adaptive scheduling method and device, electronic equipment and storage medium. BACKGROUND

[0002] The existing distributed task scheduling framework (such as XXL-JOB) supports pre-configuring the execution plan of the task through the timing expression (Cron Expression), but when facing the chain task with front and rear sequence dependence, its scheduling mechanism still has certain limitations: on the one hand, the system cannot dynamically adjust the scheduling plan of the subsequent task according to the actual execution state of the task, and lacks real-time response capability; on the other hand, the rationality of the scheduling strategy is difficult to accurately grasp: if a higher execution frequency is set, it may lead to waste of system resources; if the frequency is too low, it cannot meet the timeliness requirement of task processing. SUMMARY

[0003] The present disclosure aims to at least solve one of the technical problems in the related art to some extent.

[0004] To this end, the purpose of the present disclosure is to propose an automatic task adaptive scheduling method and device, electronic equipment and storage medium, thereby realizing the active triggering of the automatic task and the non-waiting coherent execution of the task chain, thereby effectively improving the processing efficiency.

[0005] To achieve the above-mentioned purpose, the automatic task adaptive scheduling method proposed by the first aspect of the present disclosure comprises: detecting and determining an unrunnable ready task, and determining a first executor corresponding to the ready task; processing the ready task based on the first executor; after the ready task is processed, determining the task dependency relationship of the ready task; determining and triggering a subsequent task according to the task dependency relationship, wherein the ready task is a direct pre-task of the subsequent task.

[0006] To achieve the above-mentioned purpose, the automatic task adaptive scheduling device proposed by the second aspect of the present disclosure comprises: a first determination module for detecting and determining an unrunnable ready task, and determining a first executor corresponding to the ready task; a processing module for processing the ready task based on the first executor; a second determination module for determining the task dependency relationship of the ready task after the ready task is processed; A third determining module is configured to determine and trigger a subsequent task according to the task dependency relationship, wherein the ready task is a direct preceding task of the subsequent task.

[0007] The electronic device provided by the third aspect of the present disclosure includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the automatic task adaptive scheduling method according to the first aspect of the present disclosure is implemented.

[0008] The fourth aspect of the present disclosure provides a non-transitory computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the automatic task adaptive scheduling method according to the first aspect of the present disclosure is implemented.

[0009] The fifth aspect of the present disclosure provides a computer program product. When the instructions in the computer program product are executed by a processor, the automatic task adaptive scheduling method according to the first aspect of the present disclosure is executed.

[0010] The automatic task adaptive scheduling method, device, electronic device, and storage medium provided by the present disclosure detect and determine a ready task that is not running, and determine a first executor corresponding to the ready task. The first executor is used to process the ready task. After the ready task is processed, the task dependency relationship of the ready task is determined. According to the task dependency relationship, a subsequent task is determined and triggered, and the ready task is a direct preceding task of the subsequent task. Thus, the automatic task is actively triggered, the task chain is executed without waiting, and the processing efficiency is improved.

[0011] Additional aspects and advantages of the present disclosure will be described in part in the description that follows, some of which will become apparent, or will be learned by practice of the present disclosure. BRIEF DESCRIPTION OF DRAWINGS

[0012] The above and / or additional aspects and advantages of the present disclosure will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings: Figure 1 is a flowchart of an automatic task adaptive scheduling method according to an embodiment of the present disclosure; Figure 2 is a flowchart of an automatic task adaptive scheduling method according to another embodiment of the present disclosure; Figure 3 is a task scheduling program flowchart according to the present disclosure; Figure 4 is a structural diagram of an automatic task adaptive scheduling device according to an embodiment of the present disclosure; Figure 5is a block diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0013] Embodiments of the present disclosure are described in detail below with reference to the accompanying drawings, examples of which are shown in the drawings, wherein the same or similar notations represent the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by reference to the drawings are exemplary only, and are for the purpose of explanation only, and are not to be construed as limiting the present disclosure. On the contrary, embodiments of the present disclosure include all changes, modifications and equivalents that fall within the spirit and scope of the appended claims.

[0014] It should be noted that the information (including but not limited to user device information, user personal information, etc.), data (including but not limited to data for analysis, stored data, displayed data, etc.) and signals involved in the present disclosure are all authorized by the user or fully authorized by all parties, and the collection, use and processing of related data need to comply with relevant laws, regulations and standards of relevant countries and regions.

[0015] Figure 1 is a flowchart of an automatic task adaptive scheduling method according to an embodiment of the present disclosure.

[0016] It should be noted that the execution subject of the automatic task adaptive scheduling method in the present embodiment is an automatic task adaptive scheduling device, which can be realized by software and / or hardware, and the device can be configured in an electronic device, which can include but is not limited to a terminal, a server end, etc., such as a mobile phone, a palm computer, etc.

[0017] As shown in the figure, the automatic task adaptive scheduling method comprises the following steps. Figure 1 S101: detecting and determining an unrun task that is ready, and determining a first executor corresponding to the ready task.

[0018] The ready task can refer to a task that has met the task triggering condition.

[0019] The first executor can refer to an executor for executing the above-mentioned ready task.

[0020] That is, in the present embodiment, the task can be detected in real time, so as to timely determine the unrun ready task, and provide a reliable triggering basis for triggering task scheduling.

[0021] S102: executing and processing the ready task based on the first executor.

[0022] ​In other words, in this embodiment of the present disclosure, after detecting and determining the ready task that has not been run and determining the first executor corresponding to the ready task, the ready task can be processed based on the first executor, thereby realizing the timely processing of the ready task that has not been run.

[0023] S103: After the ready tasks have been processed, determine the task dependencies of the ready tasks.

[0024] Task dependencies can be used to indicate the dependencies between different tasks during execution.

[0025] It is understandable that there may be multiple tasks in the system, and there may be dependencies between different tasks. For example, the completion of task A can serve as a prerequisite for task B.

[0026] S104: Based on task dependencies, determine and trigger subsequent tasks, where ready tasks are the direct predecessors of subsequent tasks.

[0027] In other words, in this embodiment of the present disclosure, after completing a task, the corresponding subsequent tasks can be determined based on the dependencies of the completed tasks, and the subsequent tasks can be triggered to achieve automatic active triggering of tasks, realizing the continuous execution of the task chain without waiting, thereby effectively improving processing efficiency. In this embodiment, ready tasks that are not yet running are detected, and a first executor corresponding to each ready task is identified. The ready tasks are then processed using the first executor. After the ready tasks are processed, their task dependencies are determined. Based on these dependencies, subsequent tasks are identified and triggered, where the ready tasks are direct predecessors to the subsequent tasks. This achieves automatic task triggering and enables seamless, uninterrupted execution of the task chain, thereby effectively improving processing efficiency.

[0028] Figure 2 This is a flowchart illustrating an automatic task adaptive scheduling method proposed in another embodiment of this disclosure.

[0029] like Figure 2 As shown, the automatic task adaptive scheduling method includes: S201: Periodically detect task-related information for each inactive task based on a pre-configured liveness detection device.

[0030] Among them, the "live detection device" can refer to a tool pre-configured to detect whether there are any ready tasks that have not yet been run.

[0031] In this embodiment of the disclosure, the detection cycle of the liveness detection device can be flexibly configured according to the application scenario, and there is no limitation thereto.

[0032] Among them, task-related information can be used to indicate information corresponding to tasks that are not running.

[0033] In this embodiment of the disclosure, when the task-related information of each non-running task is periodically detected based on the pre-configured activity detection device, reliable reference information can be provided for the subsequent determination of ready tasks.

[0034] S202: When the task-related information indicates that the prerequisite triggering conditions for the non-running task are met, determine that the corresponding non-running task is a ready task that has not yet run.

[0035] In other words, in this embodiment of the present disclosure, task-related information for each non-running task can be periodically detected based on a pre-configured activity detection device; when the task-related information indicates that the pre-triggered conditions of the non-running task are met, the corresponding non-running task is determined to be a ready task that has not yet been run. Thus, periodic detection of whether a task meets the execution conditions can be achieved, thereby effectively improving the timeliness of task scheduling.

[0036] S203: Generate a first scheduling instruction corresponding to the ready task based on the task scheduling platform, and send the first scheduling instruction to the first executor, wherein the first scheduling instruction is used to trigger the first executor to process the ready task.

[0037] The task scheduling platform can refer to the XXL-JOB distributed task scheduling platform, or any other task scheduling platform applicable to the method proposed in this disclosure, without limitation.

[0038] The first scheduling instruction can refer to an instruction generated by the task scheduling platform to trigger the first executor to process ready tasks.

[0039] In this embodiment of the disclosure, when a first scheduling instruction corresponding to a ready task is generated based on the task scheduling platform and the first scheduling instruction is sent to the first executor, the driving processing of the first executor can be realized based on the first scheduling instruction.

[0040] S204: The first executor executes the pre-verification logic corresponding to the ready task.

[0041] Among them, the pre-verification logic can be used to verify whether the corresponding ready task truly meets the execution conditions.

[0042] In this embodiment of the disclosure, when the first executor executes the pre-verification logic corresponding to the ready task, a second verification of the ready task can be performed before the task is executed, thereby effectively improving the reliability of the task execution process.

[0043] S205: When the pre-verification is successful, execute the ready task based on the first executor and update the scheduling log.

[0044] The scheduling log refers to the log used to record information related to task scheduling.

[0045] In other words, in this embodiment of the present disclosure, a first scheduling instruction corresponding to a ready task can be generated based on a task scheduling platform and sent to a first executor. The first scheduling instruction triggers the first executor to process the ready task. The first executor executes the pre-verification logic corresponding to the ready task. If the pre-verification is successful, the ready task is processed based on the first executor's execution, and the scheduling log is updated. Therefore, by having the first executor execute the pre-verification logic corresponding to the ready task, the reliability of the task execution process can be effectively improved. Updating the scheduling log enables timely recording of scheduling information, facilitating subsequent data analysis of the scheduling process.

[0046] Optionally, in some embodiments, the scheduling log and error log can be updated when the pre-verification fails. This allows for timely cessation of task execution and updating of the scheduling log and error log when pre-verification fails, thus providing reliable data support for scheduling process analysis.

[0047] Error logs can refer to logs used to record error information during task scheduling.

[0048] S206: After the ready tasks have been processed, determine the task dependencies of the ready tasks.

[0049] For a detailed description of S206, please refer to the above embodiments, which will not be repeated here.

[0050] S207: Based on task dependencies, determine the task that is triggered by the completion of the ready task as the subsequent task, and determine the second executor associated with the subsequent task.

[0051] The second executor can refer to an executor used to perform the aforementioned subsequent tasks.

[0052] In this embodiment of the disclosure, when a task that is triggered by the completion of a ready task is determined as a subsequent task based on the task dependency relationship, and a second executor associated with the subsequent task is determined, a reliable execution tool can be provided for processing the subsequent task.

[0053] S208: Generate a second scheduling instruction corresponding to the subsequent task based on the task scheduling platform, and send the second scheduling instruction to the second executor. The second scheduling instruction is used to trigger the second executor to process the subsequent task.

[0054] The second scheduling instruction can refer to a scheduling instruction used to trigger the second executor to process subsequent tasks.

[0055] Optionally, in some embodiments, there are multiple subsequent tasks corresponding to the ready task. When generating a second scheduling instruction corresponding to each subsequent task based on the task scheduling platform and sending the second scheduling instruction to the second executor, it can be done by: generating a second scheduling instruction corresponding to each subsequent task based on the task scheduling platform; asynchronously calling the interface of the task scheduling platform to send each second scheduling instruction to the corresponding second executor. This allows for the simultaneous triggering of multiple subsequent tasks, thereby effectively improving task processing efficiency.

[0056] In other words, in this embodiment of the present disclosure, tasks triggered by the completion of ready tasks can be identified as subsequent tasks based on task dependencies, and a second executor associated with the subsequent task can be determined. A second scheduling instruction corresponding to the subsequent task is generated based on the task scheduling platform and sent to the second executor, wherein the second scheduling instruction is used to trigger the second executor to process the subsequent task. Therefore, the second executor can be accurately triggered to process the subsequent task based on the second scheduling instruction, effectively improving the reliability of the task execution process.

[0057] In this embodiment, task-related information for each non-running task is periodically detected using a pre-configured activity detection device. When the task-related information indicates that the pre-triggered conditions for the non-running task are met, the corresponding non-running task is determined to be a ready task that has not yet been run. This allows for periodic detection of whether a task meets the execution conditions, effectively improving the timeliness of task scheduling. A first scheduling instruction corresponding to the ready task is generated based on the task scheduling platform and sent to the first executor. The first scheduling instruction triggers the first executor to process the ready task. The first executor executes the pre-verification logic corresponding to the ready task. If the pre-verification is successful, the first executor processes the ready task and updates the scheduling log. Therefore, by having the first executor execute the pre-verification logic corresponding to the ready task, the reliability of the task execution process can be effectively improved. Updating the scheduling log enables timely recording of scheduling information, facilitating subsequent data analysis of the scheduling process. By identifying tasks based on task dependencies, tasks triggered by the completion of ready tasks are designated as subsequent tasks, and a second executor associated with each subsequent task is determined. A second scheduling instruction corresponding to the subsequent task is generated based on the task scheduling platform and sent to the second executor. This second scheduling instruction triggers the second executor to process the subsequent task. Therefore, the second executor can be accurately triggered to process the subsequent task based on the second scheduling instruction, effectively improving the reliability of the task execution process.

[0058] Based on the above embodiments, this disclosure designs a scheduling mechanism that actively triggers subsequent task chains after the completion of preceding tasks, and combines an automatic task status detection device as a fault-tolerant supplement to achieve adaptive task scheduling functionality. This system can respond on demand, execute efficiently, and significantly improve the timeliness and resource utilization of task scheduling.

[0059] For example, such as Figure 3 As shown, Figure 3 The flowchart of the task scheduling procedure proposed in this disclosure includes the following specific steps: 1. The detection device actively detects ready automatic tasks that are not running and triggers the relevant actuators; 2. After receiving the XXL-JOB schedule, the corresponding executor executes the pre-verification logic, and if successful, executes the automatic task. 3. After the automatic task is completed, it actively reports the status, records the scheduling log, and queries the directly following tasks to find the corresponding scheduler; 4. Asynchronously call the corresponding XXL-JOB interface to wake up the executors of subsequent tasks in batches.

[0060] In other words, this disclosure proposes a device for actively triggering the scheduling of subsequent tasks. This protection point can eliminate the time interval for subsequent task scheduling by actively triggering subsequent tasks without disrupting the XXL-JOB scheduling mechanism. Simultaneously, by introducing an automatic task status detection device, tasks are reactivated when automatic task scheduling fails. Ultimately, this device can achieve wait-free adaptive continuous scheduling in scenarios requiring highly consistent task execution (such as financial batch processing), effectively improving business processing timeliness and resource utilization.

[0061] Figure 4 This is a schematic diagram of the structure of an automatic task adaptive scheduling device proposed in an embodiment of this disclosure.

[0062] like Figure 4 As shown, the automatic task adaptive scheduling device 40 includes: The first determining module 401 is used to detect and determine ready tasks that have not been run, and to determine the first executor corresponding to the ready task; Processing module 402 is used to process ready tasks based on the first executor; The second determining module 403 is used to determine the task dependencies of the ready tasks after the ready tasks have been processed. The third determination module 404 is used to determine and trigger subsequent tasks based on task dependencies, wherein the ready tasks are the direct predecessor tasks of the subsequent tasks.

[0063] It should be noted that the foregoing explanation of the automatic task adaptive scheduling method also applies to the automatic task adaptive scheduling device of this embodiment, and will not be repeated here.

[0064] In this embodiment, ready tasks that are not yet running are detected, and a first executor corresponding to each ready task is identified. The ready tasks are then processed using the first executor. After the ready tasks are processed, their task dependencies are determined. Based on these dependencies, subsequent tasks are identified and triggered, where the ready tasks are direct predecessors to the subsequent tasks. This achieves automatic task triggering and enables seamless, uninterrupted execution of the task chain, thereby effectively improving processing efficiency.

[0065] According to embodiments of this application, this application also provides an electronic device and a readable storage medium.

[0066] Figure 5 This is a block diagram of an electronic device according to an embodiment of the present application.

[0067] like Figure 5 As shown, the electronic device includes: The memory 501, the processor 502, and the computer instructions stored in the memory 501 and executable on the processor 502.

[0068] When processor 502 executes instructions, it implements the automatic task adaptive scheduling method provided in the above embodiments.

[0069] Furthermore, electronic devices also include: Communication interface 503 is used for communication between memory 501 and processor 502.

[0070] Memory 501 is used to store computer instructions that can be executed on processor 502.

[0071] Memory 501 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.

[0072] The processor 502 is used to implement the automatic task adaptive scheduling method of the above embodiments when executing the program.

[0073] If the memory 501, processor 502, and communication interface 503 are implemented independently, then the communication interface 503, memory 501, and processor 502 can be interconnected via a bus to complete communication between them. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. Buses can be categorized as address buses, data buses, control buses, etc. For ease of representation, Figure 5 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0074] Optionally, in a specific implementation, if the memory 501, processor 502, and communication interface 503 are integrated on a single chip, then the memory 501, processor 502, and communication interface 503 can communicate with each other through an internal interface.

[0075] Processor 502 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application.

[0076] This application also proposes a computer program product that implements the automatic task adaptive scheduling method of the embodiments of this application when the instruction processor in the computer program product is executed.

[0077] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0078] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0079] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing custom logic functions or processes, and the scope of the preferred embodiments of this application includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as should be understood by those skilled in the art to which embodiments of this application pertain.

[0080] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a processor-included system, or other system that can fetch and execute instructions from, an instruction execution system, apparatus, or device). For the purposes of this specification, "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disc read-only memory (CDROM). Furthermore, computer-readable media can even be paper or other suitable media on which programs can be printed, because programs can be obtained electronically, for example, by optically scanning the paper or other media, followed by editing, interpreting, or otherwise processing as necessary, and then stored in computer memory.

[0081] It should be understood that various parts of this application can be implemented using hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented using software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0082] Those skilled in the art will understand that all or part of the steps of the methods described in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.

[0083] Furthermore, the functional units in the various embodiments of this application can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0084] The storage medium mentioned above can be a read-only memory, a disk, or an optical disk, etc. Although embodiments of this application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting this application. Those skilled in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of this application.

Claims

1. An automatic task self-adapting scheduling method, characterized in that, The method comprises: detecting a non-running ready task, and determining a first executor corresponding to the ready task; processing the ready task based on the first executor; after the ready task is processed, determining a task dependency relationship of the ready task; according to the task dependency relationship, determining and triggering a subsequent task, wherein the ready task is a direct preceding task of the subsequent task.

2. The method of claim 1, wherein, The detection of the non-running ready task comprises: periodically detecting task-related information of each non-running task based on a pre-configured live detection device; when the task-related information indicates that the preceding trigger condition of the non-running task is met, determining that the non-running task is the non-running ready task.

3. The method of claim 1, wherein, The processing of the ready task based on the first executor comprises: generating a first scheduling instruction corresponding to the ready task based on a task scheduling platform, and sending the first scheduling instruction to the first executor, wherein the first scheduling instruction is used to trigger the first executor to process the ready task; executing a preceding verification logic corresponding to the ready task by the first executor; when the preceding verification succeeds, processing the ready task based on the first executor, and updating a scheduling log.

4. The method of claim 3, wherein, The method further comprises: when the preceding verification fails, updating the scheduling log and an error log.

5. The method of claim 1, wherein, The determination and triggering of the subsequent task according to the task dependency relationship comprises: determining a task with the ready task being completed as a trigger condition as the subsequent task according to the task dependency relationship, and determining a second executor associated with the subsequent task; generating a second scheduling instruction corresponding to the subsequent task based on a task scheduling platform, and sending the second scheduling instruction to the second executor, wherein the second scheduling instruction is used to trigger the second executor to process the subsequent task.

6. The method of claim 5, wherein, There are a plurality of subsequent tasks corresponding to the ready task; wherein the generation of the second scheduling instruction corresponding to the subsequent task based on the task scheduling platform and the sending of the second scheduling instruction to the second executor comprise: the generation of the second scheduling instruction corresponding to each of the subsequent tasks based on the task scheduling platform; asynchronous calling of an interface of the task scheduling platform, and the sending of each of the second scheduling instructions to the corresponding second executor.

7. An automatic task self-adapting scheduling apparatus characterized by comprising: The method comprises: a first determination module configured to detect a non-running ready task, and determine a first executor corresponding to the ready task; a processing module configured to process the ready task based on the first executor; a second determination module configured to determine a task dependency relationship of the ready task after the ready task is processed; a third determination module configured to determine and trigger a subsequent task according to the task dependency relationship, wherein the ready task is a direct preceding task of the subsequent task.

8. An electronic device, comprising: The method comprises: at least one processor; and a memory connected to the at least one processor in communication; wherein, The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.

9. A non-transitory computer-readable storage medium having stored thereon computer instructions, wherein, wherein, The computer instructions are for causing the computer to perform the method of any one of claims 1-6.

10. A computer program product, characterised in that, A computer program comprising instructions which, when executed by a processor, implement the steps of the method according to any one of claims 1-6.

Images