CN113986503A

CN113986503A - Task scheduling method, task scheduling device, task scheduling apparatus, and storage medium

Info

Publication number: CN113986503A
Application number: CN202111270868.XA
Authority: CN
Inventors: 李杨; 成杰峰
Original assignee: Ping An Life Insurance Company of China Ltd
Current assignee: Ping An Life Insurance Company of China Ltd
Priority date: 2021-10-29
Filing date: 2021-10-29
Publication date: 2022-01-28

Abstract

The application is applicable to the field of operation and maintenance, and provides a task scheduling method, a task scheduling device and a task scheduling storage medium. The method comprises the following steps: constructing a plurality of task nodes according to prestored metadata information; acquiring a dependency corresponding to the metadata information, and constructing a dependency among a plurality of task nodes according to the dependency; constructing a task relation directed acyclic graph based on a plurality of task nodes and the dependency relationship among the plurality of task nodes; triggering a scheduling request of any task node in the task relation directed acyclic graph; and executing the task of the task node corresponding to the scheduling request. In the scheme, the task of each task node is automatically configured by utilizing the constructed task relation directed acyclic graph, and the execution flow of the task of each task node can be adjusted in real time. And the task can be executed from the task of any task node, so that the problem that the existing job scheduling scheme is limited to be executed from the task node is solved, and the scheduling efficiency of the business process is improved.

Description

Task scheduling method, task scheduling device, task scheduling apparatus, and storage medium

Technical Field

The present application relates to the field of operations and maintenance, and in particular, to a task scheduling method, a task scheduling apparatus, a task scheduling device, and a storage medium.

Background

With the continuous development of internet technology, business systems are rapidly expanded, and more timing operations need to be automatically executed in the background under the condition of unmanned monitoring. Such as timed automatic ticket snatching, fund subscription, fund timed sale, etc.

A timing task framework (Quartz) is a powerful open source operation framework and supports distributed operation scheduling. However, when the existing Quartz executes the job scheduling scheme, only a single job can be scheduled, and the job scheduling scheme must be executed from the head task node, which results in inefficient scheduling of subsequent business processes.

Disclosure of Invention

In view of this, embodiments of the present application provide a task scheduling method, a task scheduling apparatus, a task scheduling device, and a storage medium, so as to solve the problem that, according to an existing job scheduling scheme, only a single job can be scheduled and must be executed from a head task node, which results in low scheduling efficiency of subsequent business processes.

A first aspect of an embodiment of the present application provides a task scheduling method, where the method includes:

constructing a plurality of task nodes according to prestored metadata information, wherein the metadata information comprises attribute information and trigger conditions;

acquiring a dependency corresponding to the metadata information, and constructing a dependency among the plurality of task nodes according to the dependency;

constructing a task relation directed acyclic graph based on the plurality of task nodes and the dependency relations among the plurality of task nodes;

triggering a scheduling request of any task node in the task relation directed acyclic graph;

and executing the task of the task node corresponding to the scheduling request.

Optionally, the constructing a task relationship directed acyclic graph based on the plurality of task nodes and the dependency relationships between the plurality of task nodes includes:

performing topological sorting on the plurality of task nodes based on the plurality of task nodes and the dependency relationship among the plurality of task nodes;

and constructing the task relation directed acyclic graph according to the topological sorting result.

Optionally, after the task of the task node corresponding to the scheduling request is executed, the task scheduling method further includes:

acquiring an execution result corresponding to the task;

and adjusting the corresponding execution flow of the task node corresponding to the scheduling request in the task relation directed acyclic graph in real time according to the execution result.

Optionally, the executing the task of the task node corresponding to the scheduling request includes:

acquiring a father task node of a task node corresponding to the scheduling request;

and when the completion of the task execution of the parent task node is detected, executing the task of the task node corresponding to the scheduling request.

Optionally, when it is detected that the task of the parent task node is executed completely, after the task of the task node corresponding to the scheduling request is executed, the task scheduling method further includes:

acquiring subtask nodes of a task node corresponding to the scheduling request;

executing the tasks of the subtask nodes;

and when the subtask node is detected to be the root node, ending the execution flow.

Optionally, after obtaining the parent task node of the task node corresponding to the scheduling request, the task scheduling method further includes:

when detecting that the task of the father task node is not executed and finished, detecting whether the father task node is a head node or not;

and when the father task node is detected to be a head node, sequentially executing the tasks of the father task node and the tasks of the task nodes corresponding to the scheduling request.

Optionally, the task scheduling method further includes:

acquiring an execution state corresponding to each task node;

and setting a color for each task node in the task relationship directed acyclic graph according to the execution state corresponding to each task node at present.

A second aspect of an embodiment of the present application provides a task scheduling apparatus, including:

the system comprises a first construction unit, a second construction unit and a third construction unit, wherein the first construction unit is used for constructing a plurality of task nodes according to prestored metadata information, and the metadata information comprises attribute information and trigger conditions;

the acquiring unit is used for acquiring the dependency corresponding to the metadata information and constructing the dependency among the plurality of task nodes according to the dependency;

the second construction unit is used for constructing a task relation directed acyclic graph based on the plurality of task nodes and the dependency relations among the plurality of task nodes;

the triggering unit is used for triggering a scheduling request of any task node in the task relation directed acyclic graph;

and the execution unit is used for executing the task of the task node corresponding to the scheduling request.

A third aspect of embodiments of the present application provides a task scheduling apparatus, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the steps of the task scheduling method according to the first aspect.

A fourth aspect of embodiments of the present application provides a computer-readable storage medium, which stores a computer program, and the computer program, when executed by a processor, implements the steps of the task scheduling method according to the first aspect.

A fifth aspect of embodiments of the present application provides a computer program product, which when run on a device, causes the device to perform the steps of the task scheduling method according to the first aspect.

The task scheduling method, the task scheduling device and the storage medium provided by the embodiment of the application have the following beneficial effects:

constructing a plurality of task nodes according to prestored metadata information; acquiring a dependency corresponding to the metadata information, and constructing a dependency among a plurality of task nodes according to the dependency; constructing a task relation directed acyclic graph based on a plurality of task nodes and the dependency relationship among the plurality of task nodes; triggering a scheduling request of any task node in the task relation directed acyclic graph; and executing the task of the task node corresponding to the scheduling request. In the scheme, the task of each task node is automatically configured by utilizing the constructed task relation directed acyclic graph, the dependency relation among the tasks can be flexibly adjusted according to the actual service scene, and the execution flow of the task of each task node can be adjusted in real time. And the task can be executed from the task of any task node, so that the problem that the existing job scheduling scheme is limited to be executed from the task node is solved, and the scheduling efficiency of the business process is improved.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.

FIG. 1 is a schematic flow chart diagram of a task scheduling method provided by an exemplary embodiment of the present application;

FIG. 2 is a task relationship directed acyclic graph provided by an exemplary embodiment of the present application;

FIG. 3 is a flowchart illustrating a step S105 of a task scheduling method according to another exemplary embodiment of the present application;

FIG. 4 is a schematic flow chart diagram of a task scheduling method provided by yet another exemplary embodiment of the present application;

fig. 5 is a schematic diagram of a task scheduling apparatus according to an embodiment of the present application;

fig. 6 is a schematic diagram of a task scheduling apparatus according to another embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

In the description of the embodiments of the present application, "/" means "or" unless otherwise specified, for example, a/B may mean a or B; "and/or" herein is merely an association describing an associated object, and means that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, in the description of the embodiments of the present application, "a plurality" means two or more than two.

In the following, the terms "first", "second" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present embodiment, "a plurality" means two or more unless otherwise specified.

With the continuous development of internet technology, business systems are rapidly expanded, and more timing operations need to be automatically executed in the background under the condition of unmanned monitoring. Such as timed automatic ticket snatching, fund decision making, fund timed selling, etc.

The timing task framework (Quartz) is a powerful open source operation framework, supports distributed operation scheduling, supports management of tasks in an Application Programming Interface (API) mode, is a default scheduling framework of an Application Programming framework (Spring), and can be integrated with the Spring to realize flexible and configurable scheduling service. Therefore, Quartz has found widespread application in distributed job scheduling.

However, when executing a job scheduling scheme, the prior Quartz can only schedule a single job, and must start to execute from a head task node, and cannot support to execute a plurality of interdependent jobs in a set order at a time, which results in a decrease in scheduling efficiency of subsequent business processes.

For example, when a large job flow needs to be split into a plurality of sub-jobs, and there are execution orders that are mutually dependent among the sub-jobs, Quartz cannot strictly control the execution order of each sub-job. If a large job flow is split into sub-job 1, sub-job 2, and sub-job 3, the existing Quartz can only start to execute from sub-job 1 each time when executing the job scheduling scheme, which results in a reduction in scheduling efficiency of sub-job 2 and sub-job 3. And can not adapt to various service requirements.

In view of this, the present application provides a task scheduling method, which uses a constructed task-relationship directed acyclic graph to implement automatic configuration of a task of each task node, and can flexibly adjust a dependency relationship between tasks according to an actual service scenario, thereby adjusting an execution flow of the task of each task node in real time. And the task can be executed from the task corresponding to any task node, so that the problem that the existing job scheduling scheme is limited to be executed from the head task node is solved, and the scheduling efficiency of the business process is improved.

The embodiment of the application can acquire and process related data based on an artificial intelligence technology. Among them, Artificial Intelligence (AI) is a theory, method, technique and application system that simulates, extends and expands human Intelligence using a digital computer or a machine controlled by a digital computer, senses the environment, acquires knowledge and uses the knowledge to obtain the best result.

The artificial intelligence infrastructure generally includes technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technologies, operation/interaction systems, mechatronics, and the like. The artificial intelligence software technology mainly comprises a computer vision technology, a robot technology, a biological recognition technology, a voice processing technology, a natural language processing technology, machine learning/deep learning/supervised learning and the like.

Referring to fig. 1, fig. 1 is a schematic flowchart of a task scheduling method according to an exemplary embodiment of the present application. The task scheduling device includes but is not limited to a mobile terminal such as a smart phone, a tablet computer, a Personal Digital Assistant (PDA), a desktop computer, and may further include various types of servers. For example, the server may be an independent server, or may be a cloud service that provides basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a web service, cloud communication, a middleware service, a domain name service, a security service, a Content Delivery Network (CDN), and a big data and artificial intelligence platform.

In the embodiments of the present application, an execution subject is taken as an example for description.

The task scheduling method as shown in fig. 1 may include: s101 to S105 are as follows:

s101: and constructing a plurality of task nodes according to the pre-stored metadata information.

Metadata is data describing data, and metadata information refers to information describing data attributes.

For example, the metadata information may include attribute information, trigger conditions, execution devices, execution time, and the like.

Wherein the triggering condition refers to a condition for triggering a scheduling request of the task node. For example, the trigger condition may include that time reaches a preset time point, the number of execution failures reaches a preset number of failures, the waiting time reaches a preset time, and the like. For example, when the time reaches a preset time point, a scheduling request of the task node for automatically robbing the ticket is triggered, and then the task for automatically robbing the ticket is executed according to the scheduling request. The description is given for illustrative purposes only and is not intended to be limiting.

The execution device is a device for executing the task corresponding to the task node, and the execution device can be set by a user according to different service scenes. For example, the execution device may include a mobile terminal such as a smart phone, a tablet computer, a computer, and the like, and may further include various types of servers.

The execution time is the start time of the task corresponding to the task execution node.

The attribute information may include an attribute name and an attribute description. One task node corresponds to one attribute information, and one attribute information can comprise a plurality of attribute names and a plurality of attribute descriptions. For example, the attribute names may include a task _ code, a task _ name, a task _ status, a retry _ num, an is _ skip, a parent _ task _ code, and the like.

The attribute description is used to interpret each attribute name. For example, the attribute description may include task node identification information, task node name, task node execution status, retry number, whether to skip after a task execution failure, whether the node to which the task belongs to the root node, whether the node to which the task belongs to the head node, parent task node identification information, and the like. The task node execution state may include non-execution, execution success, execution failure, ready, and the like.

The task node identification information is the definition of task _ code, the task node name is the definition of task _ name, the task node execution state is the definition of task _ status, the retry number is the definition of retry _ num, whether the task is skipped to the definition of is _ skip after the task execution fails or not, and the parent-level task node identification information is the definition of parent _ task _ code.

It is worth noting that the task node identification information is used to uniquely identify each task node. For example, a different code may be provided for each task node, which uniquely identifies each task node.

Illustratively, the attribute information is predefined by the user according to the actual service scenario.

And storing the metadata information into a database, and acquiring a plurality of preset and stored metadata information in the database when a task node is constructed according to the actual service scene. And correspondingly generating a plurality of task nodes according to the plurality of metadata information.

Each task node may include information such as task node identification information, a task node name, a task node execution state, retry times, whether a task is skipped after a task execution failure, whether an affiliated node belongs to a root node, whether an affiliated node belongs to a head node, parent task node identification information, a scheduling type, execution equipment, execution time, and a trigger condition.

S102: and acquiring a dependency corresponding to the metadata information, and constructing a dependency among the plurality of task nodes according to the dependency.

And the corresponding dependency relationship among the metadata information is predefined by the user according to the actual service scene and is stored in the database. And acquiring corresponding dependency relations among the metadata information in the database.

It can be understood that, a user defines the dependency relationship among the task nodes in advance according to the actual service scene, but the dependency relationship among the task nodes cannot be directly embodied at this time, but is embodied by defining the dependency relationship among the metadata information.

For example, after obtaining the plurality of task nodes in S101, the dependency relationship between the plurality of task nodes may be constructed by using an arrow to point according to the dependency relationship between the respective metadata information.

Each task node may have 0, 1 or more hierarchically related task nodes depending thereon. For example, there are 7 task nodes, taskA, taskB, taskC, taskD, tase, taskF, and taskgs. Wherein, the taskB and the taskC respectively have a task node taskA with a superior relation. the task D has two task nodes with a superior relation, namely task B and task F. the task B has two task nodes with lower-level relation, namely task C, task D and the like. The description is given for illustrative purposes only and is not intended to be limiting.

S103: and constructing a task relation directed acyclic graph based on the plurality of task nodes and the dependency relations among the plurality of task nodes.

Illustratively, the dependency relationships among a plurality of task nodes are arranged in a combing manner, so that the task nodes are connected through the dependency relationships, and a Direct Acyclic Graph (DAG) with task relationships is constructed.

Optionally, in some possible implementation manners of the present application, the foregoing S103 may include S1031 to S1032, which are specifically as follows:

s1031: and carrying out topological sequencing on the plurality of task nodes based on the plurality of task nodes and the dependency relationship among the plurality of task nodes.

The topological sorting refers to sorting according to the superior-inferior relation among a plurality of task nodes.

Illustratively, the search can be started from any task node by adopting a breadth-first search mode. The superior node or the subordinate node of the task node can be searched first, then the superior node of the superior node is searched continuously, or the subordinate node of the subordinate node is searched continuously, and the process is repeated until the search of all the task nodes is finished through traversal, and the superior-subordinate relation of all the task nodes is obtained.

S1032: and constructing a task relation directed acyclic graph according to the topological sorting result.

Illustratively, the topological sorting result is the superior-inferior relation among all task nodes. And (4) combing and arranging the superior-inferior relation among the task nodes, and indicating the superior-inferior relation among the task nodes by using the arrow direction to obtain a DAG (task relationship). And storing the constructed task relation DAG into a database.

Through the topological sorting mode, the superior-subordinate relation among all task nodes can be accurately and quickly determined, and then the task relation DAG is accurately and quickly established, so that the follow-up execution of the business process according to the task relation DAG is facilitated, and the scheduling efficiency of the business process is improved.

For ease of understanding, please refer to fig. 2, where fig. 2 is a task relationship directed acyclic graph provided by an exemplary embodiment of the present application.

As shown in fig. 2, an upper task node (parent task node) points to a lower task node (child task node) through an arrow, and the two task nodes have a dependency relationship. It should be noted that the upper task node (parent task node) and the lower task node (child task node) are relatively general.

Alternatively, the arrows may include solid line arrows, dotted line arrows, and curved line arrows. Different arrows indicate different meanings. The solid arrow indicates that the task cannot be skipped after the task fails to be executed, the dotted arrow indicates that the task can be skipped after the task fails to be executed, and the curved arrow indicates that the task can be repeatedly executed after the task fails to be executed. The arrows may be labeled with a number indicating the number of times a task may be repeatedly executed after the task fails to be executed.

As shown in fig. 2, there are 7 task nodes in fig. 2, which are taskA, taskB, taskC, tasdd, tase, taskF, and taskgs, respectively. The taskA is a head node (head task node), and the taskA has two subordinate task nodes, namely taskB and taskF. the task B has a task node task A with a superior relation, and has two task nodes with a subordinate relation, namely task C and task D.

the task F has a task node task A with a superior relation, and has two task nodes with a subordinate relation, namely task D and task G. the task C has a task node task B with a superior relationship and a task node task E with a subordinate relationship. the task D has two task nodes with a higher-level relationship, namely task B, task F and task node task E with a lower-level relationship.

task is a root node (root task node), which has two task nodes in a superior relationship. taskC and taskD, respectively. taskgs are root nodes (root task nodes) that have a task node taskF in a superior relationship.

the taskF and the taskG are connected by a dotted arrow, which indicates that the task corresponding to the taskF can be skipped to execute after the task corresponding to the taskF fails to execute, and the task of the taskG can be directly executed. the taskF has a curved arrow marked with a number 3, which indicates that the taskF can repeatedly execute the task 3 times after the task fails to execute.

For example, in one application scenario, after the task of taskA is successfully executed, the task of taskF is executed. The task of the taskF fails to be executed for the first time, the task of the taskF fails to be executed for the second time, the task of the taskF still fails to be executed for the third time, the task of the taskF is skipped, and the task of the taskG is directly executed.

For example, a certain webpage sequentially displays pictures and texts (firstly displays a picture, and then loads and displays characters corresponding to the picture), a certain task is to display the picture, the picture is loaded for three times without being loaded successfully due to network reasons, the task can be skipped to be executed, and the characters corresponding to the picture are directly displayed. The description is given for illustrative purposes only and is not intended to be limiting.

In the task-related directed acyclic graph shown in fig. 2, except that the taskF and the taskG are connected by a dotted arrow, the rest of the tasks are connected by solid arrows, which indicates that other tasks cannot jump after failing to execute, and the next-stage task can be executed only after successfully executing.

For example, in an application scenario where a certain task is payment and a next task is order generation, the task of payment fails to execute, and the direct order generation cannot be skipped. The description is given for illustrative purposes only and is not intended to be limiting.

For another example, in an application scenario, one path for executing each task is to execute task a, task b, task c, and task e sequentially. If the task corresponding to each task node is successfully executed, the business process corresponding to the path is completely executed after the task of task is successfully executed. The description is given for illustrative purposes only and is not intended to be limiting.

For another example, in an application scenario, one path for executing each task is to execute task a-task f-task d-task in sequence. If the task of taskA is successfully executed and the task of taskF is executed, the task fails to be executed, and the tasks of taskF and taskD are connected by solid arrows, so that the task of taskF cannot be directly executed when the task of taskF fails to be executed. At this time, the task of taskF may be repeatedly performed. And when the task of the taskF is successfully executed, executing the task of the taskD, and when the task of the taskD is successfully executed, executing the task of the taskE. And after the task of the task is successfully executed, the business process corresponding to the path is executed. The description is given for illustrative purposes only and is not intended to be limiting.

For another example, in an application scenario, one path for executing each task is to execute task a-task f-task g in sequence. If the task of taskA is successfully executed and the task of taskF is failed to be executed, the task of taskF may be skipped when the task of taskF is failed to be executed because the taskF and taskgs are connected by a dotted arrow. That is, when the task of the task f fails to be executed for the first time, the task of the task f may be skipped and the task of the task g may be executed directly. The task of the taskF can be repeatedly executed, or the task of the taskF can be repeatedly executed when the task of the taskF fails to be executed, and when the number of times of the task of executing the taskF is repeated reaches the upper limit, the task of executing the taskF is skipped, and the task of the taskF is directly executed. And after the task of the taskG is successfully executed, the business process corresponding to the path is executed. The description is given for illustrative purposes only and is not intended to be limiting.

S104: and triggering a scheduling request of any task node in the task relation directed acyclic graph.

Illustratively, different trigger conditions are set for each task node in advance, and according to the trigger conditions, a scheduling request of any task node in the task relationship DAG is triggered. For example, the trigger condition is that the time reaches a preset time point. And when the time reaches a preset time point, triggering a scheduling request of the task node of the fixed fund, and executing a task of automatically purchasing the fund according to the scheduling request. The description is given for illustrative purposes only and is not intended to be limiting.

The scheduling request is a request for executing a task corresponding to a trigger condition when the trigger condition is detected to be satisfied in the task scheduling process.

According to different trigger conditions, the task of any task node in the task relation DAG can be executed.

Illustratively, the trigger condition may be a user manual trigger. For example, a user selects a corresponding task node according to a task execution requirement of an actual service scene, calls a function menu of the task node by clicking a mouse, and selects to initiate a scheduling request in the function menu. The equipment initiates a scheduling request corresponding to the task node according to the operation of the user, and executes the task of the corresponding task node according to the scheduling request.

Illustratively, the trigger condition may also be triggered automatically. For example, when the user reaches a preset execution time according to the preset time of the actual service scene, the user triggers a scheduling request of a certain task node, and then executes the task of the corresponding task node according to the scheduling request.

The trigger condition may also be, for example, the execution state of the upper task node. For example, when the task of the upper task node is successfully executed, the task of the lower task node corresponding to the upper task node is automatically executed. And when the task execution of the upper task node fails but can be skipped, automatically executing the task of the lower task node corresponding to the upper task node. The execution of the superior task node fails, and the superior task node still fails after repeatedly executing the preset times, but the superior task node can skip and automatically execute the task of the subordinate task node corresponding to the superior task node. The description is given for illustrative purposes only and is not intended to be limiting.

S105: and executing the task of the task node corresponding to the scheduling request.

Illustratively, after a scheduling request of a certain task node is triggered, the task of the task node is executed.

For example, when the time reaches a preset time point, a scheduling request of a task node which sends the mail at regular time is triggered, and then a task of automatically sending the mail out is executed according to the scheduling request. The description is given for illustrative purposes only and is not intended to be limiting.

In the above embodiment, the task of each task node is automatically configured by using the constructed task-related directed acyclic graph, and the dependency relationship between the tasks can be flexibly adjusted according to the actual service scene, so that the execution flow of the task of each task node can be adjusted in real time. And the task can be executed from the task corresponding to any task node, so that the problem that the existing job scheduling scheme is limited to be executed from the head task node is solved, and the scheduling efficiency of the business process is improved.

Referring to fig. 3, fig. 3 is a flowchart illustrating a specific step S105 of a task scheduling method according to another exemplary embodiment of the present application; optionally, in some possible implementations of the present application, the S105 may include S1051 to S1052, which are as follows:

s1051: and acquiring a parent task node of the task node corresponding to the scheduling request.

Illustratively, when any task node is triggered, according to the dependency relationship or the superior-inferior relationship, the parent task node of the current task node, that is, the superior task node of the current task node, is found in the task relationship DAG.

S1052: and when the completion of the task execution of the parent task node is detected, executing the task of the task node corresponding to the scheduling request.

Illustratively, whether the task of the parent task node of the current task node is executed and completed is detected. And when the detection result is that the task execution of the parent task node is finished, executing the task of the task node corresponding to the scheduling request, namely executing the task of the current task node.

For example, in one application scenario, the task of the current task node is to generate an order and the parent task node of the task node is to pay. When the successful execution of the task of payment is detected, the task of the current task node is executed, namely, an order is generated. The description is given for illustrative purposes only and is not intended to be limiting.

Optionally, when any task node is triggered, all parent task nodes of the current task node, that is, all upper-level task nodes of the current task node, are found in the task relationship DAG according to the dependency relationship or the superior-inferior relationship. And detecting whether the tasks of all the father task nodes of the current task node are executed and finished. And if the tasks of all the parent task nodes are completely executed, executing the tasks of the current task node in sequence.

For example, in one application scenario, the task of the current task node is to generate an order, and the parent task nodes of the task node are to pay and detect whether the delivery address is correct. When the task of payment is successfully executed and the receiving address is correct, the task of the current task node is executed, namely, an order is generated. The description is given for illustrative purposes only and is not intended to be limiting.

In the implementation mode, the task can be executed from any task node according to the scheduled scheduling flow, and all tasks on the task chain are regularly executed according to the positions of different task nodes, so that the problem that the existing job scheduling scheme is limited to be executed from the head task node is solved, and the scheduling efficiency of the service flow is improved.

Optionally, in some possible implementation manners of the present application, the task scheduling method provided by the present application may further include, after S1052, S1053 to S1055, which are specifically as follows:

s1053: and acquiring subtask nodes of the task node corresponding to the scheduling request.

Illustratively, according to the dependency relationship or the superior-inferior relationship, a subtask node of the current task node, that is, a subordinate task node of the current task node, is found in the task relationship DAG.

S1054: and executing the tasks of the subtask nodes.

And when the completion of the task execution of the current task node is detected, executing the tasks of the subtask nodes.

Illustratively, in the process of executing each task node, if the current task node fails to execute, the retry can be performed according to the configured retry number. If the current task node fails to be configured, whether the current task node fails to be configured and can be skipped is judged, and if the current task node cannot be configured and failed, all task chains where the current task node is located are bound; if so, the task of the subtask node continues to be executed.

For example, if the task execution of the current task node fails, but the task can be skipped, the task of the subtask node corresponding to the task node may also be automatically executed.

Or, when the task of the current task node can be repeatedly executed, the task can be repeatedly executed after the first execution fails. After the task is repeatedly executed for the preset times, the task still fails, but the task can be skipped over, and the task of the subtask node corresponding to the task node is automatically executed. The description is given for illustrative purposes only and is not intended to be limiting.

S1055: and when detecting that the subtask node is the root node, ending the execution flow.

Illustratively, whether the task of the subtask node is performed is detected. And when the detection result is that the task execution of the subtask node is completed, judging whether the subtask node is a root node. And if the subtask node is the root node, after the task of the subtask node is executed, the whole job scheduling process is finished.

If the subtask node is not the root node, searching the subtask node of the subtask node in the task relationship DAG according to the dependency relationship or the superior-inferior relationship, namely searching the subordinate task node of the subtask node. And executing the tasks of the lower-level task nodes of the subtask nodes. Namely, the steps in S1054 and S1055 are repeatedly executed until the task corresponding to the task node belonging to the root node is finally executed, and the whole job scheduling process is ended this time.

In the implementation mode, each subtask node is detected, the execution flow is ensured to be ended when the subtask node is the root node, and the integrity of the whole job scheduling flow is ensured.

Optionally, in some possible implementation manners of the present application, the task scheduling method provided by the present application may further include S1056 to S1057 after S1051. It should be noted that S1056 to S1057 are arranged in parallel with S1052, and S1056 to S1057 or S1052 is selectively executed depending on the actual situation, but S1056 to S1057 are not executed after S1055. S1056 to S1057 are specifically as follows:

s1056: and when detecting that the task of the parent task node is not executed and completed, detecting whether the parent task node is a head node or not.

Illustratively, whether the task of the parent task node of the current task node is executed and completed is detected. And when the detection result is that the task of the parent task node is not executed, detecting whether the parent task node is a head node or not. That is, whether the father task node is the first node of the whole job scheduling process is detected.

S1057: and when detecting that the father task node is the head node, sequentially executing the tasks of the father task node and the tasks of the task nodes corresponding to the scheduling request.

For example, the parent task node is queried for a head node identification. If yes, judging the father task node as a head node; if not, the father task node is judged not to be the head node.

Or, according to the dependency relationship or the upper-lower level relationship, searching whether the parent task node has an upper level task node in the task relationship DAG, and if not, determining that the parent task node is a head node.

And when detecting that the father task node is the head node, executing the tasks of the father task node, and further sequentially executing the tasks corresponding to each task node under the father task node. For example, after the task of the parent task node is executed, the subordinate task node of the parent task node is the task node corresponding to the scheduling request, and the task of the task node corresponding to the scheduling request is continuously executed. And after the execution is finished, judging whether the task node is a root node, if so, finishing the whole job scheduling process. If not, continuing to search the subordinate task node of the task node corresponding to the scheduling request, executing the task of the subordinate task node until the task corresponding to the task node belonging to the root node is finally executed, and ending the whole job scheduling process.

In the implementation mode, the father task node is detected, and when the father task node is detected as the head node, the tasks corresponding to the task nodes on the task chain are sequentially executed, so that the integrity of the whole operation scheduling process is ensured.

Referring to fig. 4, fig. 4 is a schematic flowchart of a task scheduling method according to still another exemplary embodiment of the present application. The embodiment of the present invention differs from the embodiment corresponding to fig. 1 in that after S205, the embodiment further includes S206 to S207, where S201 to S205 in the present embodiment are completely the same as S101 to S105 in the embodiment corresponding to fig. 1, and reference is specifically made to the description related to S101 to S105 in the previous embodiment, which is not repeated herein. S206-S207 are specifically as follows:

s206: and acquiring an execution result corresponding to the task.

Illustratively, the execution result may include execution success, execution failure, and the like. And after the task of the task node corresponding to the scheduling request is executed, the execution result of the task is obtained.

S207: and adjusting the corresponding execution flow of the task node corresponding to the scheduling request in the task relation directed acyclic graph in real time according to the execution result.

Illustratively, when the execution result is that the execution is successful, the execution flow of the task node corresponding to the scheduling request in the task relationship DAG is adjusted to be the task of the lower-level task node of the task node.

Illustratively, when the execution result is execution failure, whether the task of the task node is configured to be repeatedly executed or whether the task of the task node is configured to be skipped is detected. And if the repeatable execution is configured, adjusting the execution flow of the task node corresponding to the scheduling request in the DAG to be repeatedly executing the task of the task node.

And if the skippable task node is configured, adjusting the execution flow of the task node corresponding to the scheduling request in the DAG to be the task of the lower-level task node of the task node.

Illustratively, when the execution result is that the execution fails, it is detected that the task of the task node is not configured to be repeatedly executed or configured to be skipped, and the execution flow of the task node corresponding to the scheduling request in the task relation DAG is adjusted to execute the task of the upper-level task node of the task node. Or adjusting the corresponding execution flow of the task node corresponding to the scheduling request in the DAG to end the job scheduling flow.

In the implementation mode, the dependency relationship among the task nodes can be flexibly adjusted according to the actual service scene and the execution result corresponding to each task, namely, the execution relationship among the tasks is adjusted, the problem that the existing job scheduling scheme can only schedule a single job is solved, the scheduling efficiency of the service process is improved, and the task execution efficiency is improved.

Optionally, in some possible implementation manners of the present application, the task scheduling method provided by the present application may further include: acquiring an execution state corresponding to each task node; and setting a color for each task node in the task relationship directed acyclic graph according to the execution state corresponding to each task node at present.

Illustratively, the execution status may include not executed, execution successful, execution failed, ready, and the like. Different colors can be set according to the execution state corresponding to each task node, so that the current execution state corresponding to the task node can be quickly determined.

For example, yellow indicates that the current corresponding execution state of the task node is ready, green indicates that the current corresponding execution state of the task node is successful, red indicates that the current corresponding execution state of the task node is failed, and white indicates that the current corresponding execution state of the task node is not executed. The description is given for illustrative purposes only and is not intended to be limiting.

For example, in the task relationship DAG shown in fig. 2, taskD, taskE, and taskF may be set to red, which indicates that the current execution states of several task nodes, namely taskD, taskE, and taskF, are execution failures. And the taskA, the taskB, the taskC and the taskG are set to be green, and the current corresponding execution states of the taskA, the taskB, the taskC and the taskG are indicated as successful execution. The description is given for illustrative purposes only and is not intended to be limiting.

In the implementation mode, the execution state of each task can be monitored in real time, different colors are set according to different execution states, a user can conveniently and quickly determine the current corresponding execution state of the task node, the user can conveniently and quickly locate the task node with failed task execution, and the task node with failed execution can be conveniently repaired.

Optionally, in some possible implementation manners of the present application, the task scheduling method provided by the present application may be applied to the medical field, and some tasks of a hospital are scheduled by using the task scheduling method. For example, automatic number calling, automatic detection and the like improve the detection efficiency of the hospital, improve the sensitivity of the patient on the side surface and facilitate promotion of doctor-patient relationship.

Referring to fig. 5, fig. 5 is a schematic diagram of a task scheduling device according to an embodiment of the present application. The device comprises units for executing the steps in the embodiments corresponding to fig. 1, 3-4. Please refer to fig. 1, 3-4 for the corresponding embodiments. For convenience of explanation, only the portions related to the present embodiment are shown. Referring to fig. 5, it includes:

a first constructing unit 310, configured to construct a plurality of task nodes according to pre-stored metadata information, where the metadata information includes attribute information and trigger conditions;

an obtaining unit 320, configured to obtain a dependency relationship corresponding to the metadata information, and construct a dependency relationship between the task nodes according to the dependency relationship;

a second constructing unit 330, configured to construct a task-relationship directed acyclic graph based on the plurality of task nodes and dependency relationships among the plurality of task nodes;

the triggering unit 340 is configured to trigger a scheduling request of any task node in the task relationship directed acyclic graph;

and an executing unit 350, configured to execute a task of a task node corresponding to the scheduling request.

Optionally, the second constructing unit 330 is specifically configured to:

Optionally, the execution unit 350 is specifically configured to:

Optionally, the apparatus further comprises:

the result acquisition unit is used for acquiring an execution result corresponding to the task;

and the adjusting unit is used for adjusting the corresponding execution flow of the task node corresponding to the scheduling request in the task relationship directed acyclic graph in real time according to the execution result.

Optionally, the apparatus further comprises:

a subtask node obtaining unit, configured to obtain a subtask node of a task node corresponding to the scheduling request;

the task execution unit is used for executing the tasks of the subtask nodes;

and the first detection unit is used for finishing the execution process when the subtask node is detected to be the root node.

Optionally, the apparatus further comprises:

the second detection unit is used for detecting whether the father task node is a head node or not when detecting that the task of the father task node is not executed and completed;

and the third detection unit is used for sequentially executing the tasks of the father task node and the tasks of the task nodes corresponding to the scheduling request when the father task node is detected as a head node.

Optionally, the apparatus further comprises:

the state acquisition unit is used for acquiring the execution state corresponding to each task node;

and the adjusting unit is used for setting colors for each task node in the task relationship directed acyclic graph according to the current execution state corresponding to each task node.

Referring to fig. 6, fig. 6 is a schematic diagram of a task scheduling apparatus according to another embodiment of the present application. As shown in fig. 6, the task scheduling apparatus 4 of this embodiment includes: a processor 40, a memory 41 and a computer program 42 stored in said memory 41 and executable on said processor 40. The processor 40 implements the steps in the above-described embodiments of the task scheduling method, such as S101 to S105 shown in fig. 1, when executing the computer program 42. Alternatively, the processor 40, when executing the computer program 42, implements the functions of the units in the embodiments, such as the functions of the units 310 to 350 shown in fig. 5.

Illustratively, the computer program 42 may be divided into one or more units, which are stored in the memory 41 and executed by the processor 40 to accomplish the present application. The one or more units may be a series of computer instruction segments capable of performing specific functions, which are used to describe the execution of the computer program 42 in the device 4. For example, the computer program 42 may be divided into a first building unit, an obtaining unit, a second building unit, a triggering unit, and an executing unit, each unit having the specific functions as described above.

The apparatus may include, but is not limited to, a processor 40, a memory 41. It will be appreciated by those skilled in the art that fig. 6 is merely an example of the task scheduling device 4 and does not constitute a limitation of the device, and may include more or less components than those shown, or combine some components, or different components, for example, the device may also include input output devices, network access devices, buses, etc.

The Processor 40 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The memory 41 may be an internal storage unit of the device, such as a hard disk or a memory of the device. The memory 41 may also be an external storage terminal of the device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the device. Further, the memory 41 may also include both an internal storage unit and an external storage terminal of the apparatus. The memory 41 is used for storing the computer instructions and other programs and data required by the terminal. The memory 41 may also be used to temporarily store data that has been output or is to be output.

The embodiments of the present application further provide a computer storage medium, where the computer storage medium may be nonvolatile or volatile, and the computer storage medium stores a computer program, and the computer program, when executed by a processor, implements the steps in the foregoing task scheduling method embodiments.

The present application further provides a computer program product, which when run on a device, causes the device to perform the steps in the above-mentioned respective embodiments of the task scheduling method.

An embodiment of the present application further provides a chip or an integrated circuit, where the chip or the integrated circuit includes: and the processor is used for calling and running the computer program from the memory so that the device provided with the chip or the integrated circuit executes the steps in each task scheduling method embodiment.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules, so as to perform all or part of the functions described above. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The above-mentioned embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not cause the essential features of the corresponding technical solutions to depart from the spirit scope of the technical solutions of the embodiments of the present application, and are intended to be included within the scope of the present application.

Claims

1. A method for task scheduling, comprising:

2. The task scheduling method of claim 1, wherein constructing a task relationship directed acyclic graph based on the plurality of task nodes and dependencies between the plurality of task nodes comprises:

3. The task scheduling method according to claim 1, wherein after the task of the task node corresponding to the scheduling request is executed, the task scheduling method further comprises:

acquiring an execution result corresponding to the task;

4. The task scheduling method according to claim 1, wherein the executing the task of the task node corresponding to the scheduling request includes:

5. The task scheduling method according to claim 4, wherein after the task of the task node corresponding to the scheduling request is executed when completion of the task execution of the parent task node is detected, the task scheduling method further comprises:

acquiring subtask nodes of a task node corresponding to the scheduling request;

executing the tasks of the subtask nodes;

6. The task scheduling method according to claim 4, wherein after the obtaining of the parent task node of the task node corresponding to the scheduling request, the task scheduling method further comprises:

7. The task scheduling method according to any one of claims 1 to 6, wherein the task scheduling method further comprises:

acquiring an execution state corresponding to each task node;

8. A task scheduling apparatus, comprising:

9. A task scheduling apparatus comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 7.