WO2022222567A1

WO2022222567A1 - Task scheduling method and apparatus, and computer-readable storage medium

Info

Publication number: WO2022222567A1
Application number: PCT/CN2022/074659
Authority: WO
Inventors: 李松; 金学文; 田丰; 冀乃庚; 查骏
Original assignee: 中国银联股份有限公司
Priority date: 2021-04-22
Filing date: 2022-01-28
Publication date: 2022-10-27
Also published as: TWI791389B; CN113238838B; CN113238838A; TW202242643A

Abstract

Provided in the present invention are a task scheduling method, apparatus and system, and a computer-readable storage medium. The method comprises: splitting a scheduling task, to be scheduled, into a plurality of sub-tasks, and arranging the plurality of sub-tasks into a plurality of stages; configuring a task dependency relationship between the plurality of sub-tasks and a stage dependency relationship between the plurality of stages; in response to an execution instruction of the current stage, acquiring all the sub-tasks of the current stage, and issuing, to an execution node, a sub-task to be executed that meets a preset execution condition, wherein the preset execution condition is determined according to the stage dependency relationship, the task dependency relationship and a task execution state; and updating an execution state of said sub-task according to an execution result fed back by the execution node. By means of the method, an execution flow of a plurality of sub-tasks of a scheduling task can be managed more effectively, and task scheduling in various complex service scenarios is better satisfied, thereby effectively improving task scheduling performance.

Description

A task scheduling method, device and computer-readable storage medium

This application claims the priority of the Chinese patent application with the application number of 202110436537.2, which was filed on April 22, 2021, and entitled "A Task Scheduling Method, Device, and Computer-readable Storage Medium", and the disclosure content of the Chinese patent application Incorporated herein by reference.

technical field

The present invention belongs to the field of computers, and in particular relates to a task scheduling method, a device and a computer-readable storage medium.

Background technique

This section is intended to provide a background or context for the embodiments of the invention that are recited in the claims. The descriptions herein are not admitted to be prior art by inclusion in this section.

In distributed and microservice application scenarios, complex scheduling tasks can be split into multiple subtasks, and each subtask can be dispatched to different nodes for execution to improve scheduling efficiency. However, due to the limitations of business processes and deployment resources, there are problems such as high complexity and difficulty in the execution sequence, task scheduling management and efficient execution of multiple subtasks obtained by split scheduling tasks.

SUMMARY OF THE INVENTION

Aiming at the problems existing in the above-mentioned prior art, a task scheduling method, device and computer-readable storage medium are proposed, and the above-mentioned problems can be solved by using the method, device and computer-readable storage medium.

The present invention provides the following solutions.

In a first aspect, a task scheduling method is provided, which includes: dividing a scheduling task to be scheduled into multiple subtasks, arranging the multiple subtasks into multiple stages, and configuring task dependencies and multiple subtasks among the multiple subtasks. The stage dependency between stages; in response to the execution instruction of the current stage, obtain all subtasks of the current stage, and deliver the subtasks to be executed that meet the preset execution conditions to the execution node, wherein the preset execution conditions are based on stage dependencies The relationship, task dependency, and task execution state are determined; and the execution state of the subtask to be executed is updated according to the execution result fed back by the execution node.

In a possible implementation manner, the method further includes: monitoring the task execution state; and, when monitoring that all subtasks of the previous stage of the current stage are executed and completed, generating an execution instruction of the current stage; and/or, when When it is monitored that all subtasks of the current stage are executed and completed, the execution instruction of the subsequent stage is generated.

In a possible implementation manner, arranging multiple subtasks in stages further includes: grouping and arranging multiple subtasks in the stage to obtain multiple task groups of the stage; and, when the current stage includes multiple task groups , executes multiple task groups of the current stage in parallel.

In a possible implementation, it also includes delivering subtasks to be executed that meet preset execution conditions to execution nodes based on a load balancing strategy, specifically including: preconfiguring the expected load of each subtask, the load of each execution node Threshold; when the current stage is executed, determine the expected load of the subtasks to be executed, and calculate the current load of each execution node; determine the subtasks to be executed according to the load threshold and current load of each execution node, and the expected load of the subtasks to be executed. A list of available nodes for the task; and, delivering the subtask to be executed to the execution node with the lowest load rate in the list of available nodes.

In a possible implementation manner, the task execution status includes at least the execution status of the subtask, and the execution status of the subtask includes: pending, executing, successful, failed, terminated, and abnormal.

In a possible implementation, the dependency types of the stage dependency and the task dependency include: strong dependency, weak dependency, and no dependency; wherein, each dependency type and the execution state of one or more subtasks have a preset Mapping relations.

In a possible implementation, the current stage depends on the predecessor stage based on the configured stage dependencies; wherein, if the stage dependency is a strong dependency, all subtasks of the current stage depend on the predecessor stage to be successfully executed; if the stage If the dependency is weak, the current stage depends on the predecessor stage and all subtasks are executed without exception; if the stage dependency is no dependency, the execution of the current stage does not depend on the execution status of the subtasks in the predecessor stage.

In a possible implementation manner, the subtask to be executed depends on at least one specified subtask based on a configured task dependency relationship, and the task dependency relationship includes: one of strong dependency, weak dependency and no dependency; wherein, if the task If the dependency is a strong dependency, the subtask to be executed depends on at least one specified subtask to execute successfully; if the task dependency is a weak dependency, the subtask to be executed depends on at least one specified subtask to execute successfully or fail; if the task dependency is No dependencies, subtasks to be executed depend on at least one specified subtask to execute successfully, fail, terminate or exception.

In a possible implementation, the method further includes judging whether the execution condition is satisfied, specifically including: if the stage dependency of the current stage is a strong dependency or a weak dependency, judging whether the current stage satisfies the preset execution condition, if not, setting the The execution status of all subtasks in the current stage is abnormal. If satisfied, all subtasks in the current stage are sequentially delivered using the load balancing strategy, and the execution status of the delivered subtasks is updated to be executing.

In a possible implementation manner, the method further includes judging whether the execution condition is satisfied, specifically including: if the stage dependency of the current stage is no dependency, judging whether each subtask of the current stage satisfies the preset execution condition, if not The execution status of the subtask is set as abnormal, and if it is satisfied, the subtask is issued, and the execution status of the issued subtask is updated to be executing.

In a possible implementation manner, the method further includes preconfiguring a plurality of configuration information, where the configuration information includes one or more of the following: the scheduling task identifier of the scheduling task; the following one or more configuration items of each subtask : The scheduling task ID of the scheduling task to which it belongs, the stage ID of the stage it belongs to, the stage dependency of the stage it belongs to, the group ID of the task group it belongs to, the subtask ID, the task dependency relationship, the expected load, the timeout time, and the execution module ID; One or more of the following configuration items: Execution node ID, Execution node load threshold, Execution node list.

In a second aspect, a task scheduling device is provided, comprising: a configuration module for dividing a scheduling task to be scheduled into multiple sub-tasks, arranging the multiple sub-tasks into multiple stages, and configuring tasks between the multiple sub-tasks Dependency relationship and stage dependency relationship between multiple stages; the scheduling module is used to obtain all subtasks of the current stage in response to the execution instruction of the current stage, and deliver the to-be-executed subtasks that meet the preset execution conditions to the execution node , wherein the preset execution condition is determined according to the phase dependency, the task dependency and the task execution state; and the execution state of the subtask to be executed is updated according to the execution result fed back by the execution node.

In a possible implementation manner, the device further includes a monitoring module, configured to: monitor the task execution state; and, when it is monitored that all subtasks of the previous stage of the current stage are executed and completed, generate an execution instruction of the current stage; And/or, when it is monitored that all subtasks of the current stage are executed and completed, an execution instruction of the subsequent stage is generated.

In a possible implementation, the configuration module is further configured to: group and arrange multiple subtasks in the stage to obtain multiple task groups of the stage; and, when the current stage includes multiple task groups, execute the current stage in parallel groupings of multiple tasks.

In a possible implementation manner, the scheduling module is further configured to deliver the subtasks to be executed that meet the preset execution conditions to the execution node based on the load balancing strategy, and is specifically used for: preconfiguring the expected load of each subtask, each subtask The load threshold of the execution node; when the current stage is executed, determine the expected load of the subtasks to be executed, and calculate the current load of each execution node; according to the load threshold and current load of each execution node, and the expected load of the subtasks to be executed Determine the list of available nodes of the subtask to be executed; and deliver the subtask to be executed to the execution node with the lowest load rate in the list of available nodes.

In a possible implementation manner, the apparatus further includes judging whether the execution condition is satisfied, specifically including: if the stage dependency of the current stage is a strong dependency or a weak dependency, judging whether the current stage satisfies the preset execution condition, if not, setting the The execution status of all subtasks in the current stage is abnormal. If satisfied, all subtasks in the current stage are sequentially delivered using the load balancing strategy, and the execution status of the delivered subtasks is updated to be executing.

In a possible implementation manner, the apparatus further includes judging whether the execution condition is satisfied, specifically including: if the stage dependency of the current stage is no dependency, judging whether each subtask of the current stage satisfies the preset execution condition, if not The execution status of the subtask is set as abnormal, and if it is satisfied, the subtask is issued, and the execution status of the issued subtask is updated to be executing.

In a possible implementation manner, the configuration module is further configured to pre-configure a plurality of configuration information, and the configuration information includes one or more of the following: the scheduling task identifier of the scheduling task; one or more of the following for each subtask Configuration items: scheduling task ID of the scheduling task to which it belongs, stage ID of the stage to which it belongs, stage dependency of the stage to which it belongs, group ID of the task group to which it belongs, subtask ID, task dependency, expected load, timeout, and execution module ID; execution One or more of the following configuration items for the module: execution node identification, execution node load threshold, execution node list.

In a third aspect, a task scheduling apparatus is provided, which is characterized by comprising: at least one processor; and a memory connected in communication with the at least one processor; wherein the memory stores an instruction that can be executed by the at least one processor, and the instruction Executed by at least one processor to enable the at least one processor to execute: the method of claims 1-11.

In a fourth aspect, a computer-readable storage medium is provided, the computer-readable storage medium stores a program, and when the program is executed by a multi-core processor, the multi-core processor executes the method according to any one of claims 1-11.

The above-mentioned at least one technical solution adopted in the embodiments of the present application can achieve the following beneficial effects: by dividing the scheduling task into multiple subtasks, arranging the multiple subtasks in stages into multiple stages of orderly execution, and by comprehensively maintaining the subtasks The task dependencies between tasks and the stage dependencies between stages can more effectively manage the execution process of multiple sub-tasks of scheduling tasks, better meet task scheduling in various complex business scenarios, and effectively improve task scheduling performance.

It should be understood that the above description is only an overview of the technical solutions of the present invention, so that the technical means of the present invention can be more clearly understood, and thus can be implemented in accordance with the contents of the description. In order to make the above-mentioned and other objects, features and advantages of the present invention more apparent and comprehensible, specific embodiments of the present invention are illustrated below.

Description of drawings

The advantages and benefits described herein, as well as other advantages and benefits, will become apparent to those of ordinary skill in the art upon reading the following detailed description of the exemplary embodiments. The drawings are for purposes of illustrating exemplary embodiments only and are not to be considered limiting of the invention. Also, the same components are denoted by the same reference numerals throughout the drawings. In the attached image:

FIG. 1 is a schematic flowchart of a task scheduling method according to an embodiment of the present invention;

2 is a schematic diagram of arranging scheduling tasks in stages according to an embodiment of the present invention;

3 is a schematic flowchart of a task scheduling method according to another embodiment of the present invention;

4 is a schematic diagram of a task scheduling system according to an embodiment of the present invention;

5 is a schematic flowchart of a task scheduling method according to another embodiment of the present invention;

6 is a schematic structural diagram of a task scheduling apparatus according to an embodiment of the present invention;

7 is a schematic structural diagram of a task scheduling apparatus according to yet another embodiment of the present invention;

In the drawings, the same or corresponding reference numerals denote the same or corresponding parts.

Detailed ways

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided so that the present disclosure will be more thoroughly understood, and will fully convey the scope of the present disclosure to those skilled in the art.

In the description of the embodiments of the present application, it should be understood that terms such as "comprising" or "having" are intended to indicate the presence of features, numbers, steps, acts, components, parts or combinations thereof disclosed in this specification, and do not The intention is to exclude the possibility of the presence of one or more other features, numbers, steps, acts, components, parts, or combinations thereof.

Unless otherwise specified, "/" means or, for example, A/B can mean A or B; "and/or" in this text is only an association relationship to describe related objects, indicating that there can be three kinds of relationships, For example, A and/or B can mean that A exists alone, A and B exist at the same time, and B exists alone.

The terms "first", "second", etc. are used for descriptive purposes only, and should not be construed as indicating or implying relative importance or implying the number of indicated technical features. Thus, a feature defined as "first", "second", etc., may expressly or implicitly include one or more of that feature. In the description of the embodiments of the present application, unless otherwise specified, "plurality" means two or more.

In addition, it should be noted that the embodiments of the present invention and the features of the embodiments may be combined with each other without conflict. The present invention will be described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.

FIG. 1 is a schematic flowchart of a task scheduling method according to an embodiment of the present application, which is used to schedule and execute complex tasks. In this process, from a device perspective, the execution subject may be one or more electronic devices; from a program perspective, In other words, the execution body may be a program mounted on these electronic devices accordingly.

As shown in FIG. 1, the method provided by this embodiment may include the following steps:

S101. Divide the scheduling task to be scheduled into multiple subtasks, and arrange the multiple subtasks into multiple stages;

In an example, referring to FIG. 2 , it shows a schematic diagram of arranging scheduling tasks in stages. The scheduling task to be scheduled is divided into multiple sub-tasks, and the multiple sub-tasks are arranged into n stages, each stage. It includes several subtasks, and the subtasks in each stage can be executed in stages. Optionally, the arrangement can be performed according to the association relationship between the split subtasks, for example, two or more subtasks with temporal associations are arranged in different stages, and each stage includes several subtasks. There is no such relationship between them.

S102, configure task dependencies between multiple subtasks and stage dependencies between multiple stages;

Specifically, dependencies between multiple subtasks and between multiple stages can be configured according to the task execution state. The task execution status can mainly include scheduling/subtask execution status.

Task dependencies are used to indicate dependencies between subtasks. In other words, the start of execution of a subtask needs to depend on the execution status of another or more subtasks. For example, the start of execution of the first subtask may depend on the success/failure of execution of the second subtask. As another example, the start of execution of the third subtask may depend on the unexecuted state of the fourth subtask, and so on.

Phase dependencies are used to indicate dependencies between phases, in other words, the start of a phase needs to depend on the execution status of all subtasks in another or more phases. For example, the start of execution of the first stage may depend on the success/failure of all subtasks of the second stage. For another example, the start of execution of the third stage may depend on the success of all subtasks of the fourth stage and the success of the fifth stage. All subtasks of are not executed, and so on, which is not specifically limited in this application.

S103, in response to the execution instruction of the current stage, obtain all the subtasks of the current stage, and deliver the subtasks to be executed that meet the preset execution conditions to the execution node,

Specifically, the preset execution condition may be determined according to the phase dependency, the task dependency, and the task execution state.

Still referring to FIG. 2 , assuming that the current stage is stage 2, all subtasks in stage 2 are obtained at this time: subtask 2-1-1, subtask 2-2-2, ..., subtask 2-1-t ₂₁ , It is judged whether each subtask satisfies a preset execution condition, and the preset execution condition may include the stage execution condition of the current stage and the task execution condition of each subtask. For example, it is possible to first judge whether the current stage satisfies the stage execution conditions determined based on the stage dependencies and the task execution status, and then further judge whether each subtask of the current stage satisfies the task execution conditions determined based on the task dependencies and the task execution status, If all are satisfied, it is considered that the subtask satisfies the preset execution condition, and can be delivered to the execution node according to the load balancing policy, and the execution status of the subtask is updated to be executing. Otherwise, it is considered that the subtask does not meet the preset execution condition, and the execution status of the subtask can be updated to abnormal.

S104. Update the execution state of the subtask to be executed according to the execution result fed back by the execution node.

Specifically, the execution result fed back by the execution node may indicate the execution success/failure/termination/abnormality of the subtask to be executed.

It can be understood that the above S101-S102 are the configuration work before executing the scheduling task, and S103-S104 are the scheduling work of each current stage of the specific execution of the scheduling task. For example, according to the above S101-S102, the task arrangement result shown in FIG. 2 can be configured, and the phase dependencies and task dependencies can be configured accordingly. During actual execution, the phases 1 to n in FIG. When each stage is the current stage, the above-mentioned work of S103-S104 is executed until the execution of stage n ends.

In this embodiment, by dividing the scheduling task into multiple subtasks, arranging the multiple subtasks in stages into multiple stages of orderly execution, and by comprehensively maintaining the task dependency between the subtasks and the relationship between the stages The stage dependency relationship can more effectively manage the execution process of multiple subtasks of the scheduling task, which can better meet the task scheduling in various complex business scenarios, and effectively improve the task scheduling performance.

In some possible implementations, the execution status of the subtask may include multiple execution statuses such as pending, executing, successful, failed, terminated, and abnormal. For example, for any subtask, the execution status is "to be executed" when it is not executed, the execution status is "executing" after it has been successfully distributed to the execution node, and the execution status after it has been successfully executed by the execution node. The execution status is "success", the execution status after it has been executed by the execution node and failed to be executed is "failed", and the execution status after it has been terminated by the execution node is "terminated", and one of several abnormal conditions occurs. The subsequent execution state is "abnormal". It can be understood that, according to the actual task scenario, other execution states can of course be set, and are not limited to the execution states listed above. In this embodiment, by adopting and setting the above-mentioned multiple execution states, a more refined state management solution is provided compared to only setting "executed" and "unexecuted" in the traditional solution.

In an example, Table 1 presents a refined subtask state machine.

Table 1:

In some possible implementations, the execution state of the scheduled task may include initial and execution.

Table 2 provides a scheduling task state machine, wherein, when the scheduling task is executed, the scheduling task execution status of the recording scheduling task is identified as "execution", and the execution stage is identified as the current stage identification; the subtask execution status is identified as the current The execution state of the subtask and the execution node of the subtask are the execution node information of the subtask currently executing the subtask; after the task ends, the execution state of the recorded scheduling task is marked as "initial".

Table 2:

状态state	含义meaning
初始initial	调度任务未执行Scheduled task not executed
执行implement	调度任务处于执行状态Scheduled task is executing

In some possible implementations, in order to further refine the scheduling method, the dependency types of the phase dependency and the task dependency may include: strong dependency, weak dependency, and no dependency. Each dependency type has a preset mapping relationship with the execution state of one or more subtasks.

Table 3 shows a mapping relationship between dependencies and state machines. According to the above subtask state machine, the stage dependencies between stages, the task dependencies between subtasks and subtasks, and the dependencies can be refined. Can include: strong dependencies, weak dependencies, and no dependencies.

table 3:

依赖关系dependencies	满足关系的状态列表List of states that satisfy the relationship
强依赖strong dependence	成功success
弱依赖weak dependency	成功、失败success failure
无依赖no dependency	成功、失败、终止、异常success, failure, termination, exception

Compared with the existing solution, this embodiment can provide more refined task status management (to be executed, executing, successful, failed, terminated, abnormal) and task dependency relationship management (strong dependency, weak dependency, no dependency) . It can meet the needs of various business scenarios.

In some possible implementations, it is assumed that the current stage depends on the predecessor stage based on the stage dependency relationship, and the stage dependency relationship can be one of: strong dependency, weak dependency and no dependency. More specifically, if the stage dependency is strong dependency, all subtasks of the current stage depend on the predecessor stage to be executed successfully; if the stage dependency is weak dependency, all subtasks of the current stage depend on the predecessor stage to be executed without exception; If the stage dependency is no dependency, the execution of the current stage does not need to depend on the execution status of the subtasks of the previous stage.

In some possible implementations, it is assumed that a subtask to be executed depends on at least one specified subtask based on a task dependency relationship, and the task dependency relationship is one of strong dependency, weak dependency, and no dependency. More specifically, if the task dependency is strong, the subtask to be executed depends on at least one specified subtask to be executed successfully; if the task dependency is weak dependency, the subtask to be executed depends on at least one specified subtask to be executed successfully or Failed; if the task dependency is no dependency, the subtask to be executed depends on the success, failure, termination or exception of at least one specified subtask.

In some possible implementations, in S103, it can also be judged whether the execution conditions are met, specifically including:

If the stage dependency of the current stage is strong or weak, judge whether the current stage satisfies the preset execution conditions. If not, set the execution status of all subtasks in the current stage as abnormal. If so, use the load balancing strategy to execute the Send all the subtasks in the current stage and update the execution status of the subtasks after they are issued to executing.

If the stage dependency of the current stage is no dependency, judge whether each subtask of the current stage satisfies the preset execution conditions. If not, set the execution status of the subtask to be abnormal. The execution status of subsequent subtasks is executing.

In other words, in order to further reduce the complexity of judging whether each subtask can be executed, the following scheme can be adopted: if the stage dependency of the current stage is a strong dependency or a weak dependency, the task dependency of each subtask of the current stage of the configuration is ignored ; If the stage dependency of the current stage is no dependency, the task dependency of each subtask of the current stage of the configuration is supported.

This embodiment supports the user to configure phase dependencies and subtask dependencies respectively. When the stage dependencies of a certain stage are strong/weak dependencies, it is not necessary to further verify whether each subtask in this stage satisfies the preset execution conditions based on their respective task dependencies, but only needs to verify whether the stage satisfies the stage-based dependencies. If the preset execution conditions are met, each subtask in this stage can be directly issued. On the contrary, if the phase dependency of a certain stage is non-dependent, it is necessary to verify whether each subtask in this stage satisfies the preset execution conditions based on their respective task dependencies. If so, the subtasks that meet the preset execution conditions are issued Task, if one or more subtasks in this stage are not configured with task dependencies, they can be defaulted to meet the preset execution conditions.

In an example, referring to FIG. 2 , the type of phase dependency of phase n is weak dependency. Therefore, when phase n satisfies the phase execution condition based on phase dependency, all subtasks of phase n are executed, otherwise, phase n is executed. The execution status of all subtasks of is updated to Exception. The type of the phase dependency in phase 2 is no dependency, so it can be further verified whether the task 2-1-2 in phase 2 satisfies the task execution conditions based on its task dependency. The task dependency of task 2-1-2 is specifically: : Task 2-1-2 depends on subtask 1-1-2 and is strongly dependent, and task 2-1-2 depends on subtask 1-2-1 and is weakly dependent. Therefore, combined with the mapping relationship shown in Table 3, only when the execution status of subtask 1-1-2 is successful, and the execution status of task 2-1-2 is successful or failed, the task 2-1-2 can be executed. 1-2. For other subtasks in phase 2, since no task dependencies are configured, they can be executed directly without further validation.

In some possible implementations, in order to monitor the progress of all currently executing tasks, and further drive the task flow to continue to execute or end the task, the task execution status can be monitored. When it is monitored that all the subtasks of the previous stage of the current stage are executed and completed, an execution instruction of the current stage is generated; and/or, when it is monitored that all the subtasks of the current stage have been executed and completed, it is further judged whether there are any more subtasks in the current stage. In the subsequent stage, if there is, the execution instruction of the subsequent stage will be generated, if not, the task will be ended.

In some possible implementations, in order to perform concurrent execution of multiple subtasks in the same stage, the multiple subtasks may be further finely arranged. In S101, it is also possible to: group and arrange the multiple subtasks in the stage , to obtain multiple task groups of the stage; and, when the current stage contains multiple task groups, execute the multiple task groups of the current stage in parallel.

In an example, still referring to FIG. 2 , it shows a schematic diagram of a fine-grained staged grouped task scheduling, wherein dependencies can be configured from stage and subtask dimensions. The multiple subtasks contained in each stage are further grouped and arranged, and the concurrency of subtasks is controlled in detail from the parallel grouping dimension. The implementation method is as follows: when subtasks are arranged, the stage numbers are 1, 2, ... n according to the execution order, and the

concurrent group numbers

1, 2, ... n are set in the same stage, and each subtask number n-1 is set in the group. -1, n-1-2, ...n-1-tn. This model supports subtasks in the same stage to be grouped and configured according to concurrency requirements. Different groups of the same stage can execute concurrently. Multiple subtasks within the same group of the same stage are executed sequentially.

In some possible implementations, referring to FIG. 3, in S103, in order to further improve the load balancing of the execution node, the following steps may also be performed:

S31, preconfigure the expected load of each subtask and the load threshold of each execution node;

S32, when the current stage is executed, determine the expected load of the subtask to be executed, and calculate the current load of each execution node;

S33, determine the available node list of the subtask to be executed according to the load threshold and current load of each execution node, and the expected load of the subtask to be executed; and,

S34. Deliver the subtask to be executed to the execution node with the lowest load rate in the list of available nodes.

In an example, the distribution process based on the load balancing strategy is as follows: in S31 , when adding a scheduling task, it is necessary to configure an expected load for the subtask, and configure a load threshold for the execution node. Users can evaluate the expected load according to the expected resource consumption of subtasks in production, and evaluate the load threshold according to the actual available resources of the execution node. The resources here include CPU, memory, etc. In S32, before the subtask is issued, a list of execution nodes corresponding to the subtask is obtained, all subtasks currently being executed by each execution node are queried, and the current load sum _wn of the execution node is calculated. In S33, record the expected load of the current subtask to be executed as w, and the load threshold of the execution node as w _max , if w+ _wn is less than the configured load threshold w _max , put the node on the available node list. In S34, the load ratio [(w+w _n )/w _max ] is calculated and sorted, and the available node with the lowest load ratio is selected to issue subtasks. On the contrary, if there is no available node, record the execution status of the subtask as "abnormal".

In the traditional scheme, it is difficult to avoid the risk of the execution node going down due to excessive load. This embodiment proposes a real-time task distribution strategy, which requires pre-evaluation of the load threshold of the execution node and the weight of each subtask. When the task is issued, the actual load of all currently available nodes is calculated in real time, and the optimal execution node is comprehensively selected to execute the task compared with the load threshold. Compared with the existing solutions, the interaction complexity is low, ensuring that the execution node will not be overloaded, and has better versatility and security.

In some possible implementations, the method further includes pre-configuring a variety of configuration information, where the configuration information includes: a scheduling task identifier of the scheduling task; one or more of the following configuration items of each subtask: the scheduling task identifier of the scheduling task to which it belongs. , the stage ID of the stage to which it belongs, the stage dependency of the stage to which it belongs, the group ID of the task group to which it belongs, subtask ID, task dependency, expected load, timeout, and execution module ID; one or more of the following configuration items of the execution module : Execution node ID, execution node load threshold, and execution node list.

In an example, referring to FIG. 4 , a task scheduling system is shown, which mainly includes a configuration module 400, a visual interface 401, a scheduling module 402, a monitoring module 403, a storage module 404, and an execution module 405. Each module specifically performs the following tasks: The configuration module 400 is configured to generate configuration information related to task scheduling. For example, referring to FIG. 4 , in (1), the configuration module 400 inputs the configuration information through the visual interface 401 , and optionally the configuration information can also be input through the background, which is not specifically limited in this application. The visual interface 401 is used to provide the user with an interactive interface for operating the related process of the task scheduling, which can be performed on the visual interface 401: adding/deleting/updating tasks, adding configuration information, querying the execution status of scheduling/subtasks, manual triggering/terminating Scheduling tasks, etc. For example, referring to FIG. 4, in (2) the visual interface 401 stores the configuration information to the storage module 404, and in (3) the visual interface 401 sends an instruction to the scheduling module 402 to manually trigger/terminate the scheduling task. The scheduling module 402 is configured to start scheduling task scheduling in response to a trigger condition (either manually triggered or automatically triggered), and is responsible for issuing subtasks and maintaining task execution status. For example, in (4), the scheduling module 402 obtains the configuration information and execution status of the scheduling/subtasks from the storage module 404, and in (5), the subtasks that satisfy the preset execution conditions are delivered to the execution nodes in the execution module 405 , in (6) the execution result fed back by the execution node is received, and in (7) the execution state of the corresponding subtask is updated according to the execution result. The monitoring module 403 is used to monitor the progress of all currently executing scheduling/subtasks, and drive the task flow to continue to execute or end the task. In (8), the monitoring module 403 obtains the configuration information and execution status of the scheduling/subtask from the storage module 404, in (9) the monitoring module 403 monitors the progress of the currently executing scheduling/subtask, and in (10) The module 403 sends the task execution instruction of the subsequent stage to the scheduling module 402 after monitoring the completion of the current stage subtask execution and when there is a subsequent stage, in (11), the monitoring module 403 monitors that the current stage subtask execution is completed and does not exist. End the scheduling task scheduling in the subsequent stage. The storage module 404 is used to store the configuration information of the scheduling/subtask and the task execution state. The execution module 405 includes several execution nodes, each execution node is responsible for executing subtasks, and the execution node is generally a module of each business system.

In an example, referring to FIG. 5 , it shows a flow interaction diagram for performing task scheduling based on the scheduling result in FIG. 2 and using the task scheduling device shown in FIG. 4 . When an automatic triggering instruction is issued in the background, the scheduling task to be scheduled meets the triggering condition, and further in S501, the scheduling module 402 acquires all the subtasks of stage 1. In S502, since stage 1 is the initial stage, there is no stage dependency and sub-task dependency, and the scheduling module 402 can sequentially deliver each sub-task of this stage 1; in S503, if the delivery is successful, the execution state of the sub-task is recorded In S504, after the execution of the subtask is completed, the scheduling module 402 receives the execution result fed back by the execution node of the execution module 405; in S505, the scheduling module 402 executes the execution according to the feedback from the execution node As a result, the execution state of the corresponding subtask is updated in the storage module 404, which can be "success", "failure", "abnormal", etc.; at S506, the monitoring module 403 monitors and obtains the execution state of the subtask in stage 1; at S507, When all the subtasks in stage 1 have been executed (not "to be executed" or "executed"), the monitoring module 403 further judges whether there are subtasks to be executed in the next stage, if not, it is considered that the scheduling task has completed execution, Otherwise, the stage identification is updated; in S508, the monitoring module 403 generates and sends the next stage of stage 1, that is, the execution instruction of stage 2; in S509, the scheduling module 402 obtains the current execution status of all subtasks and all subtasks of stage 2 At S510, scheduling module 402 judges whether stage 2 satisfies the execution condition according to the stage dependency of configuration, if not, then puts all subtask execution states of this stage 2 as "abnormal", otherwise executes all subtasks of this stage successively; In S511, before the subtasks of stage 2 are executed, if the stage dependency of stage 2 is no dependency, the scheduling module 402 determines whether the subtasks to be processed satisfy the execution conditions according to the subtask dependency configuration; in S512, if the subtasks to be processed If the execution conditions are not met, the execution status of the subtask is updated to "abnormal", otherwise, the task is issued according to S502. The above steps S502-S512 are cycled in sequence until the execution of stage n is completed. Optionally, for multiple task groups that may exist in the stage, between S506 and S507, step (a) may also be included, which specifically includes: if the current group has a sub-task to be executed, then continue to execute the current sub-task of the next group. , if all grouping subtasks in the current stage have been completed, and there is a task to be executed in the next stage, then execute S507.

In the description of this specification, reference to description of the terms "some possible implementations", "some embodiments", "example", "specific example", or "some examples" etc. means that the description in connection with the embodiment or example A particular feature, structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, those skilled in the art may combine and combine the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples, without conflicting each other.

In addition, the terms "first" and "second" are only used for descriptive purposes, and should not be construed as indicating or implying relative importance or implying the number of indicated technical features. Thus, a feature delimited with "first", "second" may expressly or implicitly include at least one of that feature. In the description of the present invention, "plurality" means at least two, such as two, three, etc., unless otherwise expressly and specifically defined.

Any description of a process or method in the flowcharts or otherwise described herein may be understood to represent a module, segment or portion of code comprising one or more executable instructions for implementing a specified logical function or step of the process , and the scope of the preferred embodiments of the invention includes alternative implementations in which the functions may be performed out of the order shown or discussed, including performing the functions substantially concurrently or in the reverse order depending upon the functions involved, which should It is understood by those skilled in the art to which the embodiments of the present invention belong.

With regard to the method flowcharts of the embodiments of the present application, certain operations are described as different steps performed in a certain order. Such flowcharts are illustrative and not restrictive. Certain steps described herein may be grouped together and performed in a single operation, certain steps may be split into sub-steps, and certain steps may be performed in a different order than shown herein . may be implemented in any manner by any circuit structure and/or tangible mechanism (eg, by software running on a computer device, hardware (eg, logical functions implemented by a processor or chip), etc., and/or any combination thereof) The individual steps shown in the flowchart.

Based on the same technical concept, an embodiment of the present invention further provides a task scheduling apparatus for executing the task scheduling method provided by any of the foregoing embodiments. FIG. 6 is a schematic structural diagram of a task scheduling apparatus according to an embodiment of the present invention.

As shown in Figure 6, the device 60 includes:

The configuration module 400 is used for splitting the scheduling task to be scheduled into multiple subtasks, arranging the multiple subtasks into multiple stages, and configuring the task dependency relationship between the multiple subtasks and the stage dependency relationship between the multiple stages ;

The scheduling module 402 is configured to, in response to the execution instruction of the current stage, obtain all subtasks of the current stage, and deliver the subtasks to be executed that meet the preset execution conditions to the execution node, wherein the preset execution conditions are based on the stage dependencies, tasks The dependency relationship and the task execution state are determined; and the execution state of the subtask to be executed is updated according to the execution result fed back by the execution node.

In a possible implementation, the configuration module 400 is further configured to: group and arrange multiple subtasks in the stage to obtain multiple task groups of the stage; and, when the current stage includes multiple task groups, execute the current stage in parallel Multiple task groupings for stages.

In a possible implementation, the scheduling module 402 is further configured to deliver the to-be-executed subtasks that meet the preset execution conditions to the execution node based on the load balancing strategy, and is specifically configured to: preconfigure the expected load of each subtask, each subtask The load threshold of each execution node; when the current stage is executed, the expected load of the subtask to be executed is determined, and the current load of each execution node is calculated; according to the load threshold and current load of each execution node, and the expected load of the subtask to be executed The load determines the list of available nodes of the subtask to be executed; and delivers the subtask to be executed to the execution node with the lowest load rate in the list of available nodes.

In a possible implementation manner, the configuration module 400 is further configured to preconfigure a plurality of configuration information, and the configuration information includes one or more of the following: the scheduling task identifier of the scheduling task; the following one or more of each subtask Configuration items: the scheduling task identifier of the scheduling task to which it belongs, the stage identifier of the phase to which it belongs, the phase dependency of the phase to which it belongs, the group identifier of the task group to which it belongs, the subtask identifier, the task dependency, the expected load, the timeout period, and the execution module identifier; One or more of the following configuration items of the execution module: the identification of the execution node, the load threshold of the execution node, and the list of execution nodes.

It should be noted that, the task scheduling apparatus in the embodiment of the present application can implement each process of the foregoing embodiments of the task scheduling method, and achieve the same effects and functions, which will not be repeated here.

FIG. 7 is a task scheduling apparatus according to an embodiment of the present application, for executing the task scheduling method shown in FIG. 1 , the apparatus includes: at least one processor; and a memory communicatively connected to the at least one processor; 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 methods described in the above embodiments.

According to some embodiments of the present application, a non-volatile computer storage medium of a task scheduling method is provided, and computer-executable instructions are stored thereon, and the computer-executable instructions are configured to be executed when run by a processor: the above-mentioned embodiments method described.

Each embodiment in this application is described in a progressive manner, and the same and similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the apparatus, device, and computer-readable storage medium embodiments, since they are basically similar to the method embodiments, the description thereof is simplified, and reference may be made to the partial descriptions of the method embodiments for related parts.

The apparatuses, devices, and computer-readable storage media and methods provided in the embodiments of the present application are in one-to-one correspondence. Therefore, the apparatuses, devices, and computer-readable storage media also have beneficial technical effects similar to those of the corresponding methods. The beneficial technical effects of the method have been described in detail, therefore, the beneficial technical effects of the apparatus, equipment and computer-readable storage medium will not be repeated here.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each process and/or block in the flowchart illustrations and/or block diagrams, and combinations of processes and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

Memory may include forms of non-persistent memory, random access memory (RAM) and/or non-volatile memory in computer readable media, such as read only memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media includes both persistent and non-permanent, removable and non-removable media, and storage of information may be implemented by any method or technology. Information may be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Flash Memory or other memory technology, Compact Disc Read Only Memory (CD-ROM), Digital Versatile Disc (DVD) or other optical storage, Magnetic tape cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission medium that can be used to store information that can be accessed by a computing device. Furthermore, although the operations of the methods of the present invention are depicted in the figures in a particular order, this does not require or imply that the operations must be performed in the particular order, or that all illustrated operations must be performed to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined to be performed as one step, and/or one step may be decomposed into multiple steps to be performed.

While the spirit and principles of the present invention have been described with reference to a number of specific embodiments, it should be understood that the invention is not limited to the specific embodiments disclosed, nor does the division of aspects imply that features of these aspects cannot be combined to perform Benefit, this division is only for convenience of presentation. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

A task scheduling method, comprising:

Split the scheduling task to be scheduled into multiple subtasks, arrange the multiple subtasks into multiple stages, and configure the task dependency between the multiple subtasks and the stage dependency between the multiple stages ;

In response to the execution instruction of the current stage, obtain all the subtasks of the current stage, and deliver the subtasks to be executed that meet the preset execution conditions to the execution node, wherein the preset execution conditions are based on the stage dependencies, the The task dependency relationship and the task execution state are determined; and the execution state of the to-be-executed subtask is updated according to the execution result fed back by the execution node.
The method according to claim 1, wherein the method further comprises: monitoring task execution status; and,

When it is monitored that all subtasks of the previous stage of the current stage are executed and completed, an execution instruction of the current stage is generated; and/or,

When it is monitored that all the subtasks of the current stage are executed and completed, an execution instruction of the subsequent stage is generated.
The method according to claim 1 or 2, wherein the multiple subtasks are arranged in stages, further comprising:

grouping and arranging a plurality of subtasks in the stage to obtain a plurality of task groups in the stage; and, when the current stage includes the plurality of task groups, executing the plurality of task groups in the current stage in parallel Task grouping.
The method according to any one of claims 1-3, further comprising, based on a load balancing strategy, delivering the subtasks to be executed that meet preset execution conditions to the execution node, specifically including:

pre-configuring the expected load of each of the subtasks and the load threshold of each of the execution nodes;

When the current stage is executed, the expected load of the subtask to be executed is determined, and the current load of each execution node is calculated;

Determine the available node list of the subtask to be executed according to the load threshold and the current load of each of the execution nodes, and the expected load of the subtask to be executed; and,

The to-be-executed subtask is delivered to the execution node with the lowest load rate in the available node list.
The method according to any one of claims 1-4, wherein the task execution status includes at least the execution status of the subtask, and the execution status of the subtask includes: pending, executing, successful , failure, termination, exception.
The method according to claim 5, wherein the dependency types of the phase dependency and the task dependency include: strong dependency, weak dependency, and no dependency;

Wherein, each type of dependency relationship and the execution state of one or more subtasks have a preset mapping relationship.
The method of claim 6, wherein:

the current stage is dependent on a predecessor stage based on the configured stage dependencies;

Wherein, if the stage dependency is the strong dependency, the current stage depends on the success of all subtasks in the predecessor stage; if the stage dependency is the weak dependency, the current stage depends on the predecessor stage All subtasks of the stage are executed without exception; if the stage dependency is the no dependency, the start execution of the current stage does not depend on the execution state of the subtasks of the previous stage.
The method according to claim 6 or 7, wherein,

The subtask to be executed depends on at least one specified subtask based on the configured task dependency relationship, and the task dependency relationship includes: one of strong dependency, weak dependency and no dependency;

Wherein, if the task dependency is the strong dependency, the to-be-executed subtask depends on the at least one specified subtask to be successfully executed; if the task dependency is the weak dependency, the to-be-executed subtask is executed successfully; The task depends on the at least one specified subtask to execute successfully or fails; if the task dependency is the no dependency, the to-be-executed subtask depends on the at least one specified subtask to execute successfully, fail, terminate or abnormally .
The method according to any one of claims 6-8, characterized in that the method further comprises judging whether the execution condition is satisfied, specifically comprising:

If the phase dependency of the current phase is a strong dependency or a weak dependency, determine whether the current phase satisfies the preset execution condition, and if not, set the execution status of all subtasks in the current phase as abnormal , if satisfied, all subtasks in the current stage are sequentially delivered by using the load balancing strategy, and the execution status of the delivered subtasks is updated to be executing.
The method according to claim 8 or 9, characterized in that, the method further comprises judging whether the execution condition is satisfied, specifically comprising:

If the phase dependency of the current phase is no dependency, then determine whether each of the subtasks in the current phase satisfies the preset execution condition, and if not, set the execution status of the subtask to be If it is abnormal, if it is satisfied, the subtask is issued, and the execution status of the issued subtask is updated to be executing.
The method according to any one of claims 1-10, wherein the method further comprises preconfiguring a plurality of configuration information, the configuration information including one or more of the following: Scheduling task identifier; one or more of the following configuration items for each subtask: the scheduling task identifier of the scheduling task to which it belongs, the phase identifier of the phase to which it belongs, the phase dependency of the phase to which it belongs, and the grouping of the task group to which it belongs. Identification, subtask identification, task dependency, expected load, timeout time, execution module identification; one or more of the following configuration items of the execution module: execution node identification, load threshold of the execution node, and execution node list.
A task scheduling device, characterized in that it includes:

The configuration module is used to split the scheduling task to be scheduled into multiple subtasks, arrange the multiple subtasks into multiple stages, and configure the task dependency between the multiple subtasks and the relationship between the multiple stages. stage dependencies between;

The scheduling module is used to obtain all subtasks of the current stage in response to the execution instruction of the current stage, and deliver the subtasks to be executed that meet the preset execution conditions to the execution node, wherein the preset execution conditions are based on the stage The dependency relationship, the task dependency relationship and the task execution state are determined; and the execution state of the subtask to be executed is updated according to the execution result fed back by the execution node.
The device according to claim 12, wherein the device further comprises a monitoring module for:

monitor task execution status; and,

When it is monitored that all the subtasks of the previous stage of the current stage are executed and completed, the execution instruction of the current stage is generated; and/or, when it is monitored that all the subtasks of the current stage are executed and completed, the execution instruction of the current stage is generated. Execution instructions in subsequent stages.
The device according to claim 12 or 13, wherein the configuration module is further configured to:

grouping and arranging a plurality of subtasks in the stage to obtain a plurality of task groups in the stage; and, when the current stage includes the plurality of task groups, executing the plurality of task groups in the current stage in parallel Task grouping.
The device according to any one of claims 12 to 14, wherein the scheduling module is further configured to deliver the subtasks to be executed that meet preset execution conditions to the execution nodes based on a load balancing strategy, specifically Used for:

pre-configuring the expected load of each of the subtasks and the load threshold of each of the execution nodes;

When the current stage is executed, the expected load of the subtask to be executed is determined, and the current load of each execution node is calculated;

Determine the available node list of the subtask to be executed according to the load threshold and the current load of each of the execution nodes, and the expected load of the subtask to be executed; and,

The to-be-executed subtask is delivered to the execution node with the lowest load rate in the available node list.
The apparatus according to any one of claims 12-15, wherein the task execution status includes at least the execution status of the subtask, and the execution status of the subtask includes: pending, executing, successful , failure, termination, exception.
The apparatus according to claim 16, wherein the dependency types of the phase dependency and the task dependency include: strong dependency, weak dependency, and no dependency;

Wherein, each type of dependency relationship and the execution state of one or more subtasks have a preset mapping relationship.
The apparatus of claim 17, wherein:

the current stage is dependent on a predecessor stage based on the configured stage dependencies;

Wherein, if the stage dependency is the strong dependency, the current stage depends on the success of all subtasks in the predecessor stage; if the stage dependency is the weak dependency, the current stage depends on the predecessor stage All subtasks of the stage are executed without exception; if the stage dependency is the no dependency, the start execution of the current stage does not depend on the execution state of the subtasks of the previous stage.
The device according to claim 17 or 18, characterized in that,

The subtask to be executed depends on at least one specified subtask based on the configured task dependency relationship, and the task dependency relationship includes: one of strong dependency, weak dependency and no dependency;

Wherein, if the task dependency is the strong dependency, the to-be-executed subtask depends on the at least one specified subtask to be successfully executed; if the task dependency is the weak dependency, the to-be-executed subtask is executed successfully; The task depends on the at least one specified subtask to execute successfully or fails; if the task dependency is the no dependency, the to-be-executed subtask depends on the at least one specified subtask to execute successfully, fail, terminate or abnormally .
The device according to any one of claims 17-19, wherein the device further comprises judging whether the execution condition is satisfied, specifically comprising:

If the phase dependency of the current phase is a strong dependency or a weak dependency, determine whether the current phase satisfies the preset execution condition, and if not, set the execution status of all subtasks in the current phase as abnormal , if satisfied, all subtasks in the current stage are sequentially delivered by using the load balancing strategy, and the execution status of the delivered subtasks is updated to be executing.
The apparatus according to any one of claims 17-20, wherein the apparatus further comprises judging whether the execution condition is satisfied, specifically comprising:

If the phase dependency of the current phase is no dependency, then determine whether each of the subtasks in the current phase satisfies the preset execution condition, and if not, set the execution status of the subtask to be If it is abnormal, if it is satisfied, the subtask is issued, and the execution status of the issued subtask is updated to be executing.
The apparatus according to any one of claims 12-21, wherein the apparatus further comprises preconfigured multiple pieces of configuration information, the configuration information comprising one or more of the following: Scheduling task identifier; one or more of the following configuration items for each subtask: the scheduling task identifier of the scheduling task to which it belongs, the phase identifier of the phase to which it belongs, the phase dependency of the phase to which it belongs, and the grouping of the task group to which it belongs. Identification, subtask identification, task dependency, expected load, timeout time, execution module identification; one or more of the following configuration items of the execution module: execution node identification, load threshold of the execution node, and execution node list.
A task scheduling device, characterized in that it includes:

at least one processor; and, a memory communicatively coupled to the at least one processor; 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 execute: such as The method of claims 1-11.
A computer-readable storage medium, the computer-readable storage medium stores a program, when the program is executed by a multi-core processor, the multi-core processor is made to execute the method according to any one of claims 1-11 method.