CN117193978A

CN117193978A - Task scheduling method, device, equipment and storage medium

Info

Publication number: CN117193978A
Application number: CN202311162001.1A
Authority: CN
Inventors: 邓奎龙
Original assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Current assignee: China Construction Bank Corp; CCB Finetech Co Ltd
Priority date: 2023-09-08
Filing date: 2023-09-08
Publication date: 2023-12-08

Abstract

The application provides a task scheduling method, a task scheduling device, task scheduling equipment and a storage medium. Relates to the technical field of information systems. The method comprises the following steps: acquiring a task request sent by a terminal device, wherein the task request is used for requesting to execute a target task, the task request comprises user information and M subtask identifiers, and M is a positive integer; splitting the target task according to the M subtask identifications to obtain M subtasks; acquiring the dependency relationship among M subtasks; determining a plurality of keywords corresponding to each subtask, and determining target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask; and carrying out scheduling processing on the M subtasks according to the dependency relationship and the plurality of target information corresponding to each subtask to obtain a target processing result of the target task. And the user experience is improved.

Description

Task scheduling method, device, equipment and storage medium

Technical Field

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

Background

In some scenarios, a user may transact multiple events on-line. There is a certain dependency between the events.

In the related art, a user needs to log in different systems on a terminal device, fill in and submit user information of an event to be handled, and apply for handling. However, in the above process, because the user often does not know the dependency relationship between the events, the handling is easy to fail, and the user information needs to be filled in and submitted to different systems multiple times, which results in poor user experience.

Disclosure of Invention

The application provides a task scheduling method, device, equipment and storage medium, which are used for improving user experience.

In a first aspect, the present application provides a task scheduling method, including: .

Acquiring a task request sent by a terminal device, wherein the task request is used for requesting to execute a target task, the task request comprises user information and M subtask identifiers, and M is a positive integer;

splitting the target task according to the M subtask identifications to obtain M subtasks;

acquiring the dependency relationship among the M subtasks;

determining a plurality of keywords corresponding to each subtask, and determining target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask;

And carrying out scheduling processing on the M subtasks according to the dependency relationship and the plurality of target information corresponding to each subtask to obtain a target processing result of the target task.

In a possible implementation manner, the dependency relationship includes M subtask identifiers, and an upstream subtask identifier and a downstream subtask identifier corresponding to each subtask identifier; according to the dependency relationship and the multiple target information corresponding to each subtask, scheduling the M subtasks to obtain a target processing result of the target task, wherein the target processing result comprises:

determining an arrangement level corresponding to each subtask in the dependency relationship according to the M subtask identifications;

determining the execution sequence of the M subtasks according to the arrangement level corresponding to each subtask;

and carrying out scheduling processing on the M subtasks according to the execution sequence and the plurality of target information corresponding to each subtask to obtain a target processing result of the target task.

In a possible implementation manner, according to the execution sequence and the multiple target information corresponding to each subtask, scheduling the M subtasks to obtain a target processing result of the target task, where the method includes:

Determining an ith subtask according to the execution sequence;

determining a target system, a target interface and a target network address corresponding to the ith subtask;

according to the target interface and the target network address, an ith subtask request is sent to the target system, wherein the ith subtask request comprises a plurality of target information corresponding to the ith subtask;

receiving a subtask processing result corresponding to an ith subtask request sent by each target system;

and (3) sequentially taking 1, 2, … … and M to obtain M subtask processing results, and determining that the target processing result comprises the M subtask processing results.

In one possible embodiment, if i is not equal to 1; determining an ith subtask according to the execution sequence, including:

determining a subtask processing result of at least one upstream task corresponding to the ith subtask;

and if the subtask processing results of the at least one upstream task are all passed, determining an ith subtask according to the execution sequence.

In one possible implementation manner, determining the target system, the target interface, and the target network address corresponding to the ith subtask includes:

Obtaining a routing information table, wherein the routing information table comprises a plurality of subtask identifiers and routing information corresponding to each subtask identifier, and the routing information comprises a target system, a target interface and a target network address;

and determining a target system, a target interface and a target network address corresponding to the ith subtask in the routing information table according to the identification of the ith subtask.

In one possible implementation manner, determining target information corresponding to a plurality of keywords in the user information according to the plurality of keywords includes:

for any keyword, carrying out semantic recognition in the user information, and determining target information corresponding to the keyword;

and determining target information corresponding to each keyword in the target information corresponding to the keywords.

In a possible implementation manner, after receiving a subtask processing result corresponding to the ith subtask request sent by each target system, the method further includes:

sending the subtask processing result to the terminal equipment;

after obtaining the target processing result of the target task, the method further includes:

And sending the target processing result to the terminal equipment.

In a second aspect, an embodiment of the present application provides a task scheduling device, including: the system comprises a first acquisition module, a splitting module, a determining module, a second acquisition module and a scheduling module, wherein,

the first acquisition module is used for acquiring a task request sent by the terminal equipment, wherein the task request is used for requesting to execute a target task, the task request comprises user information and M subtask identifiers, and M is a positive integer;

the splitting module is used for splitting the target task according to the M subtask identifications to obtain M subtasks;

the determining module is used for determining a plurality of keywords corresponding to each subtask, and determining target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask;

the second acquisition module is used for acquiring the dependency relationship among M subtasks;

the scheduling module is used for scheduling the M subtasks according to the dependency relationship and the target information corresponding to each subtask to obtain a target processing result of the target task.

In a possible implementation manner, the dependency relationship includes M subtask identifiers, and an upstream subtask identifier and a downstream subtask identifier corresponding to each subtask identifier; the scheduling module is specifically configured to:

In a possible implementation manner, the scheduling module is specifically configured to:

determining an ith subtask according to the execution sequence;

In one possible embodiment, if i is not equal to 1; the scheduling module is specifically configured to:

In one possible implementation manner, the determining module is specifically configured to:

In one possible implementation manner, after receiving the subtask processing result corresponding to the ith subtask request sent by each target system, the apparatus further includes: the transmitting module is configured to transmit the data,

the sending module is used for sending the subtask processing result to the terminal equipment;

after obtaining the target processing result of the target task, the sending module is further configured to:

and sending the target processing result to the terminal equipment.

In a third aspect, an embodiment of the present application provides a task scheduling server, including: a processor, and a memory communicatively coupled to the processor;

the memory stores computer-executable instructions;

the processor executes computer-executable instructions stored in the memory to implement the method of any one of the first aspects.

In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having stored therein computer-executable instructions for performing the method according to any of the first aspects when executed by a processor.

In a fifth aspect, an embodiment of the application provides a computer program product comprising a computer program which, when executed by a processor, implements the method according to any of the first aspects.

According to the task scheduling method, the device, the equipment and the storage medium, the task scheduling server can acquire the task request sent by the terminal equipment, the task request is used for requesting to execute the target task, and the task request comprises user information and M subtask identifiers. The task scheduling server can split the target task according to the M subtask identifications to obtain M subtasks and obtain the dependency relationship among the M subtasks. The task scheduling server can determine a plurality of keywords corresponding to each subtask, determine target information corresponding to the keywords in the user information according to the keywords, obtain a plurality of target information corresponding to each subtask, and further schedule M subtasks according to the dependency relationship and the target information corresponding to each subtask, so as to obtain a target processing result of the target task. The task scheduling server can acquire the task request sent by the terminal equipment only by submitting the user information once on the terminal equipment, split the target task according to the subtask identification in the task request to obtain a plurality of subtasks, namely a plurality of events, and schedule the plurality of subtasks to corresponding target systems respectively without filling and submitting the user information in different systems for a plurality of times, and without defining the dependency relationship among the plurality of events by the user, so that the user experience is improved.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.

FIG. 1 is an application scenario diagram provided by an embodiment of the present application;

fig. 2 is a schematic flow chart of a task scheduling method according to an embodiment of the present application;

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

FIG. 4 is a schematic diagram of a subtask configuration provided by an embodiment of the present application;

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

FIG. 6 is a schematic diagram of a task scheduling system according to an embodiment of the present application;

FIG. 7 is a schematic diagram of a workflow reference model according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a task scheduling device according to an embodiment of the present application;

fig. 9 is a schematic structural diagram of a task scheduling server according to an embodiment of the present application.

Specific embodiments of the present application have been shown by way of the above drawings and will be described in more detail below. The drawings and the written description are not intended to limit the scope of the inventive concepts in any way, but rather to illustrate the inventive concepts to those skilled in the art by reference to the specific embodiments.

Detailed Description

Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the accompanying claims.

In the technical scheme of the application, the related processes of collecting, storing, using, processing, transmitting, providing, disclosing and the like of the information such as financial data or user data are in accordance with the regulations of related laws and regulations, and the public welfare is not violated. The user information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, presented data, etc.) related to the present application are information and data authorized by the user or sufficiently authorized by each party, and the collection, use and processing of related data is required to comply with related laws and regulations and standards, and is provided with corresponding operation entries for the user to select authorization or rejection.

Fig. 1 is an application scenario diagram provided in an embodiment of the present application. Referring to fig. 1, the method includes: terminal equipment, task scheduling server and a plurality of target systems. The plurality of target systems may be target system 1, target systems 2, … …, target system n, n being an integer greater than or equal to 1, respectively.

When the user needs to apply for handling the event, the user information can be filled in the terminal device, and the 'submit' control is clicked. The terminal device may send a task request to the task scheduling server to request execution of the target task in response to a click operation of the user. The task request may include user information and M subtask identifications. For example, the task request may include user information such as a user's name, an identification card number, a home address, etc., and subtask identification 1, subtask identification 2, and subtask identification 3.

After the task scheduling server receives the task request, the target task can be split according to the M subtask identifications to obtain M subtasks, and the dependency relationship among the M subtasks is obtained. The task scheduling server may determine a plurality of target information corresponding to each sub-task. The task scheduling server can schedule M subtasks according to the dependency relationship and a plurality of target information corresponding to each subtask.

For example, if the target task is a registered package for handling a neonate, and if the task request includes a subtask identifier 1, a subtask identifier 2, and a subtask identifier 3, the task scheduling server may split the target task according to the 3 subtask identifiers to obtain the subtask 1, the subtask 2, and the subtask 3, obtain a dependency relationship between the 3 subtasks, and may also obtain multiple target information corresponding to each subtask respectively. The task scheduling server can schedule the 3 subtasks according to the dependency relationship and the plurality of target information corresponding to each subtask, namely the target system 1 corresponding to the subtask 1 can be determined, and the plurality of target information corresponding to the subtask 1 is sent to the target system 1; the target system 2 corresponding to the subtask 2 can be determined, and a plurality of target information corresponding to the subtask 2 is sent to the target system 2; the target system 3 corresponding to the subtask 3 may be determined, and a plurality of target information corresponding to the subtask 1 may be transmitted to the target system 3.

In the embodiment of the application, the user can submit the user information once on the terminal equipment. The task scheduling server can acquire a task request sent by the terminal equipment, split the target task according to the subtask identification in the task request to obtain a plurality of subtasks, namely a plurality of events, and schedule the subtasks to corresponding target systems respectively without filling in different systems and submitting user information for a plurality of times by a user, and without defining the dependency relationship among the plurality of events by the user, so that the user experience is improved.

The following describes the technical scheme of the present application and how the technical scheme of the present application solves the above technical problems in detail with specific embodiments. The following embodiments may be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.

Fig. 2 is a flow chart of a task scheduling method according to an embodiment of the present application. Referring to fig. 2, the method includes:

s201, acquiring a task request sent by the terminal equipment.

The execution main body of the embodiment of the application can be a task scheduling server or a task scheduling system arranged in the task scheduling server. The task scheduling system may be a task scheduling device. The task scheduling device may be implemented by software, or may be implemented by a combination of software and hardware. The task scheduling device may schedule a processor in the server for the task. For ease of understanding, the execution body will be described below as an example of a task scheduling server.

Alternatively, the terminal device may be a mobile phone, a computer, or an operation terminal of a hall, or the like.

The task request may be used to request execution of a target task, where the task request includes user information and M subtask identifiers, where M is a positive integer.

The target task may include a plurality of subtasks therein. For example, the target task may register a package for the neonate. The target tasks may include a neonate account registration task, a neonate social security registration task and a neonate medical insurance registration task.

For any one target task, the target task has a target task identifier. Alternatively, the scheduling system may be preconfigured with a plurality of subtask identifiers included in each target task identifier. For example, subtask identification 1, subtask identification 2, and subtask identification 3 may be included in the target task identification 1.

The user information may include information required to transact M subtasks. For example, the user information may include information of a user name, an identification card number, a home address, and the like. Optionally, the user information may further include a picture uploaded by the user, and the like.

Alternatively, the user may log into the scheduling system on the terminal device, fill in the user information, select the target task identity, and click on the "submit" control. The terminal device may determine M subtask identifiers according to the target task identifier, and generate a task request in response to an operation of the user, and send the task request to the task scheduling server. The task request may include user information and M subtask identifications.

For example, the user may fill in information on the terminal device such as Zhang three, sex male, year of birth month of 2021, 7 and 5 days of birth, ethnic group of Han, home address of Yanta district in western Ann, shaanxi province, etc., select the target task identifier 1, and click the "submit" control. If the target task identifier 1 includes a subtask identifier 1, a subtask identifier 2 and a subtask identifier 3, the terminal device may generate a task request 1 in response to an operation of a user, and send the task request 1 to the task scheduling server. User information, task identity 1, subtask identity 2 and subtask identity 3 may be included in task request 1.

S202, splitting the target task according to M subtask identifications to obtain M subtasks.

Optionally, after the task scheduling server receives the task request, M subtask identifiers may be determined in the task request, and the target task is split according to the M subtask identifiers, so as to obtain M subtasks.

For example, if the task request includes a task identifier 1, a subtask identifier 2 and a subtask identifier 3, and if the target task is a neonatal registration package, the task scheduling server may split the target task according to the 3 subtask identifiers to obtain 3 subtasks, that is, determine the subtask 1, that is, the neonatal household registration task according to the task identifier 1, determine the subtask 2, that is, the neonatal social security registration task according to the task identifier 2, and determine the subtask 3, that is, the neonatal medical security registration task according to the task identifier 3.

S203, acquiring the dependency relationship among M subtasks.

The dependency relationship comprises M subtask identifications, and an upstream subtask identification and a downstream subtask identification corresponding to each subtask. For example, the dependencies may be as shown in table 1:

TABLE 1

Subtask identification	Upstream subtask identification	Downstream subtask identification
			Subtask identification 1	/	Subtask id 2, subtask id 3
Subtask identification 2	Subtask identification 1	/
			Subtask identification 3	Subtask identification 1	/

Alternatively, the dependency relationship between the M subtasks may be manually preset, and the preset storage space of the task scheduling server may be pre-existing.

After the task scheduling server determines the M subtasks, the dependency relationship may be obtained in the preset storage space according to the M subtask identifiers, so as to obtain the dependency relationship between the M subtasks. For example, if there are 3 subtasks, the corresponding identifiers are respectively a subtask identifier 1, a subtask identifier 2 and a subtask identifier 3, the task scheduling server may obtain a dependency relationship in a preset storage space according to the subtask identifier 1, the subtask identifier 2 and the subtask identifier 3 as shown in table 1, that is, the dependency relationship between the 3 subtasks may be a subtask 2, the subtask 3 depends on a subtask 1, and there is no dependency relationship between the subtask 2 and the subtask 3, that is, the subtask 1 is connected in series with the subtask 2, the subtask 1 is connected in series with the subtask 3, and the subtask 2 is connected in parallel with the subtask 3.

S204, determining a plurality of keywords corresponding to each subtask, and determining target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask.

For any one subtask, the subtask has a corresponding keyword. For example, keywords corresponding to a neonatal account registration task may include name, gender, birth year month, ethnicity, home address, and the like.

Alternatively, the task scheduling server may determine a plurality of keywords corresponding to each subtask. For example, the task scheduling server may determine that subtask 1 corresponds to 5 keywords, may determine that subtask 2 corresponds to 3 keywords, and may determine that subtask 3 corresponds to 4 keywords.

In an alternative embodiment, the target information corresponding to the plurality of keywords may be determined in the user information according to the plurality of keywords by: for any keyword, carrying out semantic recognition in the user information, and determining target information corresponding to the keyword; and determining target information corresponding to each keyword in the target information corresponding to the keywords.

For example, if the user information includes information such as three names, male sex, year of birth, month 7, month 5, race, chinese, and family address, for example, in the goose tower region of west, western, shanxi, the task scheduling server may perform semantic recognition on the user information based on the keyword 1 if the keyword 1 is year of birth, and find out the target information corresponding to the year of birth, that is, month 7, month 5, 2021, if 3 keywords are present, the target information corresponding to the 3 keywords may include the target information 1 corresponding to the keyword 1, the target information 2 corresponding to the keyword 2, and the target information 3 corresponding to the keyword 3.

For example, the task scheduling server may determine 5 keywords corresponding to the subtask 1, and determine corresponding 5 target information in the user information according to the 5 keywords, and then the target information corresponding to the subtask 1 may include the 5 target information; 3 keywords corresponding to the subtask 2 can be determined, and corresponding 3 target information is determined in the user information according to the 3 keywords, and then the target information corresponding to the subtask 2 can comprise the 3 target information; the 4 keywords corresponding to the subtask 3 may be determined, and the corresponding 4 target information may be determined in the user information according to the 4 keywords, and then the target information corresponding to the subtask 3 may include the 4 target information.

S205, according to the dependency relationship and the multiple target information corresponding to each subtask, scheduling M subtasks to obtain a target processing result of the target task.

In an alternative embodiment, the scheduling processing may be performed on the M subtasks according to the dependency relationship and the multiple target information corresponding to each subtask, so as to obtain a target processing result of the target task: determining an arrangement level corresponding to each subtask in the dependency relationship according to the M subtask identifications; determining the execution sequence of M subtasks according to the arrangement level corresponding to each subtask; and carrying out scheduling processing on the M subtasks according to the execution sequence and a plurality of target information corresponding to each subtask to obtain a target processing result of the target task.

For example, the dependency relationship between the 3 subtasks may be that the subtask 2 and the subtask 3 depend on the subtask 1, and no dependency relationship exists between the subtask 2 and the subtask 3, that is, the subtask 1 is connected in series with the subtask 2, the subtask 1 is connected in series with the subtask 3, and the subtask 2 is connected in parallel with the subtask 3. For example, subtask 1 may be a neonatal registration task, subtask 2 may be a neonatal social security registration task, subtask 3 may be a neonatal medical security registration task, the neonatal social security registration task and the neonatal medical security registration task may be performed only by relying on an identification card number generated by the neonatal registration task, and the neonatal social security registration task and the neonatal medical security registration task have no dependency before each other.

The task scheduling server may determine that the arrangement level of the subtask 1 is 1, the arrangement level of the subtask 2 is 2, and the arrangement level of the subtask 3 is 2 in the dependency relationship. The task scheduling server may determine that the execution order of the 3 subtasks is to execute subtask 1 first and then execute subtask 2 or subtask 3. The task scheduling server may schedule the 3 sub-tasks according to the execution sequence and the target information corresponding to the sub-task 1, the sub-task 2 and the sub-task 3, so as to obtain a target processing result of the target task.

In the embodiment of the application, the task scheduling server can acquire the task request sent by the terminal equipment, wherein the task request is used for requesting to execute the target task, and the task request comprises the user information and M subtask identifiers. The task scheduling server can split the target task according to the M subtask identifications to obtain M subtasks and obtain the dependency relationship among the M subtasks. The task scheduling server can determine a plurality of keywords corresponding to each subtask, determine target information corresponding to the keywords in the user information according to the keywords, obtain a plurality of target information corresponding to each subtask, and further schedule M subtasks according to the dependency relationship and the target information corresponding to each subtask, so as to obtain a target processing result of the target task. The task scheduling server can acquire the task request sent by the terminal equipment only by submitting the user information once on the terminal equipment, split the target task according to the subtask identification in the task request to obtain a plurality of subtasks, namely a plurality of events, and schedule the plurality of subtasks to corresponding target systems respectively without filling and submitting the user information in different systems for a plurality of times, and without defining the dependency relationship among the plurality of events by the user, so that the user experience is improved.

The task scheduling method described above will be described in detail with reference to fig. 3, based on the embodiment shown in fig. 2.

Fig. 3 is a flow chart of another task scheduling method according to an embodiment of the present application. Referring to fig. 3, the method includes:

s301, acquiring a task request sent by the terminal equipment.

S302, splitting the target task according to the M subtask identifications to obtain M subtasks.

S303, acquiring the dependency relationship among M subtasks.

S304, determining a plurality of keywords corresponding to each subtask, and determining target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask.

It should be noted that, the execution process of steps S301 to S304 may refer to steps S201 to S204, and will not be described herein.

S305, determining an arrangement level corresponding to each subtask in the dependency relation according to the M task identifications.

For example, if there are 3 subtask identifiers, namely, subtask identifier 1, subtask identifier 2 and subtask identifier 3, respectively, if the dependency relationship is shown in table 1, it may be determined that there is no dependency relationship among subtask 2, subtask 3, subtask 1, subtask 2 and subtask 3 according to the 3 subtask identifiers, it may be determined that the arrangement level of subtask 1 is 1, the arrangement level of subtask 2 is 2 and the arrangement level of subtask 3 is 2 in the dependency relationship.

S306, determining the execution sequence of the M subtasks according to the arrangement level corresponding to each subtask.

For example, if there are 3 subtasks, the arrangement level of the subtask 1 is 1, the arrangement level of the subtask 2 is 2, and the arrangement level of the subtask 3 is 2, the task scheduling server may determine that the execution order of the 3 subtasks is to execute the subtask 1 first, and then execute the subtask 2 or the subtask 3.

S307, determining an ith subtask according to the execution sequence.

Alternatively, determining the ith subtask according to the execution order may include the following 2 cases:

case 1: when i is equal to 1.

In this case, since the 1 st sub-task has no upstream sub-task, the 1 st sub-task can be directly determined according to the execution order. For example, the 1 st subtask may be a neonatal household registration task.

Case 2: when i is not equal to 1.

In this case, since the i-th subtask has a corresponding upstream subtask, the i-th subtask depends on the subtask processing result of the upstream subtask, so that the subtask processing result of at least one upstream task corresponding to the i-th subtask can be determined; if the subtask processing results of at least one upstream task are all passed, determining an ith subtask according to the execution sequence.

Optionally, if the subtask processing result of at least one upstream task is failed, it is not necessary to determine the ith subtask according to the execution sequence.

For example, if i is equal to 2, the 2 nd subtask is the subtask 2, and if the upstream subtask corresponding to the subtask 2 is the subtask 1, the task scheduling server may determine the subtask processing result of the subtask 1. If the subtask processing result of the subtask 1 is passing, the 2 nd subtask can be determined to be the subtask 2; if the subtask processing result of the subtask 1 is failed, the determination of the 2 nd subtask may not be required.

S308, determining a target system, a target interface and a target network address corresponding to the ith subtask.

The target system refers to a system that performs the ith subtask. For example, if the 2 nd subtask is a neonatal social security registration task, the corresponding target system may be a social security registration system.

In an alternative embodiment, the target system, the target interface, and the target network address corresponding to the ith subtask may be determined by: acquiring a route information table; and determining a target system, a target interface and a target network address corresponding to the ith subtask in the routing information table according to the identification of the ith subtask.

The routing information table may include a plurality of subtask identifiers and routing information corresponding to each subtask identifier, where the routing information includes a target system, a target interface, and a target network address.

For example, the routing information table may be as shown in table 2:

TABLE 2

For example, if i is equal to 2, the task scheduling server determines that the subtask identifier of the 2 nd subtask is the subtask identifier 2, and if the routing information table is shown in table 2, the task scheduling server may determine that the target system corresponding to the 2 nd subtask is the social security registration system, the target interface is the interface 1, and the target network address is the network address 1 in the routing information table.

For any one subtask, the subtask can be configured in advance. The subtask configuration may include dependency configuration and routing information. Referring to fig. 4, fig. 4 is a schematic diagram of a subtask configuration according to an embodiment of the present application. The subtask configuration may include dependency configuration and routing information. For example, if the subtask is subtask 1, the dependency configuration in the corresponding subtask configuration 1 may include no upstream subtask, and the downstream subtask is subtask 2 and subtask 3, which may also be referred to as the subtask 1 being connected in series with the subtask 2, and the subtask 1 being connected in series with the subtask 3; the routing information may include a destination system being an account registration system, a destination interface being interface 1, and a destination network address being network address 1.

Alternatively, in the task scheduling server, the routing information table may be managed in a configurable manner.

S309, according to the target interface and the target network address, an ith subtask request is sent to the target system.

The ith subtask request may include a plurality of target information corresponding to the ith subtask. For example, if the 2 nd subtask is task 2, multiple pieces of target information corresponding to task 2 may be in the 2 nd subtask request.

For example, if i is equal to 2, it may be determined that the 2 nd subtask is the subtask 2, and if the target system corresponding to the 2 nd subtask is the social security registration system, the target interface is the interface 1, and the target network address is the network address 1, then the 2 nd subtask request may be sent to the server where the target system is located according to the interface 1 and the network address 1, where the 2 nd subtask request includes a plurality of target information corresponding to the subtask 2.

S310, receiving a subtask processing result corresponding to the ith subtask request sent by each target system.

Optionally, after any target system receives the ith subtask request, the ith subtask request can be processed according to a plurality of target information corresponding to the ith subtask, a subtask processing result corresponding to the ith subtask request is obtained, and the subtask processing result corresponding to the ith subtask request is sent to the task scheduling server. And i sequentially takes 1, 2, … … and M to obtain M subtask processing results.

For example, if there are 3 subtasks, the target system corresponding to the 1 st subtask is a household registration system, the target system corresponding to the 2 nd subtask is a social security registration system, the target system corresponding to the 3 rd subtask is a medical insurance registration system, and if i is equal to 1, the household registration system can process the 1 st subtask request according to a plurality of target information corresponding to the 1 st subtask, so as to obtain a subtask processing result 1 corresponding to the 1 st subtask request. The subtask processing result 1 may include the generated identification card number. The social security registration system can send a subtask processing result 1 to the task scheduling server; likewise, the medical insurance registration system can process the 2 nd subtask request according to a plurality of target information corresponding to the 2 nd subtask, obtain a subtask processing result 2 corresponding to the 2 nd subtask request, and send the subtask processing result 2 to the task scheduling server, wherein the subtask processing result 2 can comprise the generated medical insurance account number; the social security registration system can process the 3 rd subtask request according to a plurality of target information corresponding to the 3 rd subtask to obtain a subtask processing result 3 corresponding to the 3 rd subtask request, and send the subtask processing result 3 to the task scheduling server, wherein the subtask processing result 3 can comprise the generated social security account number. The task scheduling server may receive 3 subtask processing results sent by the 3 target systems.

Optionally, after receiving the subtask processing result corresponding to the ith subtask request sent by each target system, the task scheduling server sends the subtask processing result to the terminal device.

For example, if the task scheduling server receives the subtask processing result 1, the task scheduling server may send the subtask processing result 1 to the terminal device, so that the user can learn about the task handling progress in time.

It should be noted that, if the execution sequence of the 3 subtasks is that the subtask 1 is executed first, then the subtask 2 or the subtask 3 is executed, the task scheduling server performs scheduling processing on the 1 st subtask, that is, the subtask 1 according to the execution sequence, after the subtask result 1 is obtained, since there is no dependency between the subtask 2 and the subtask 3, the arrangement level of the subtask 2 and the subtask 3 is 2, the task scheduling server may perform scheduling processing on the 2 nd subtask, that is, the subtask 2 and the 3 rd subtask, that is, the subtask 3 in parallel, so as to obtain the subtask processing result 2 corresponding to the subtask 2 and the subtask processing result 3 corresponding to the subtask 3.

S311, determining that the target processing result comprises M subtask processing results.

Since the target task includes M subtasks, after receiving the M subtask processing results, the task scheduling server may determine that the target processing result of the target task includes the M subtask processing results.

For example, if the target task is a registered package for handling a neonate and includes 3 subtasks, and if the subtask processing results corresponding to the 3 subtasks are respectively a subtask processing result 1, a subtask processing result 2, and a subtask processing result 3, the task scheduling server may determine that the subtask processing result 1, the subtask processing result 2, and the subtask processing result 3 are included in the target processing result after receiving the 3 subtask processing results.

S312, sending the target processing result to the terminal equipment.

For example, if the target processing result includes a subtask processing result 1, a subtask processing result 2, and a subtask processing result 3, the task scheduling server may send the target processing result to the terminal device.

According to the technical scheme, the method and the device for scheduling the subtasks can flexibly schedule the subtasks according to the dependency relationship, namely flexibly sending the subtask requests to the target systems. The user only needs to submit the user information once at the terminal equipment, and the user information does not need to be submitted for a plurality of times at different systems.

In the embodiment of the application, the task scheduling server can acquire the task request sent by the terminal equipment and split the target task according to the M subtask identifications to obtain M subtasks. The task scheduling server can acquire the dependency relationship among the M subtasks, determine a plurality of keywords corresponding to each subtask, and determine target information corresponding to the keywords in the user information according to the keywords to obtain a plurality of target information corresponding to each subtask. The task scheduling server may determine, according to the M task identifiers, an arrangement level corresponding to each subtask in the dependency relationship, and determine an execution order of the M subtasks according to the arrangement level corresponding to each subtask. The task scheduling server can determine the ith subtask according to the execution sequence, determine a target system, a target interface and a target network address corresponding to the ith subtask, and further send an ith subtask request to the target system according to the target interface and the target network address. The task scheduling server may receive the subtask processing result corresponding to the ith subtask request sent by each target system, determine that the target processing result includes M subtask processing results, and send the target processing result to the terminal device.

Next, the task scheduling method will be further described with reference to fig. 5.

Fig. 5 is a schematic process diagram of a task scheduling method according to an embodiment of the present application. Referring to fig. 5, the task request may include user information, a subtask identifier 1, a subtask identifier 2, and a subtask identifier 3. After the task scheduling server receives the task request, the target task can be split according to the task identifier 1, the subtask identifier 2 and the subtask identifier 3 to obtain a subtask 1, a subtask 2 and a subtask 3.

The task scheduling server may trigger a workflow engine in the task scheduling system. The task scheduling server may determine a dependency relationship between the 3 subtasks, and determine an execution order of the 3 subtasks according to the dependency relationship. The task scheduling server may determine target information corresponding to each subtask in the user information. The task scheduling server may determine that the route information 1 corresponding to the subtask 1 includes the target system 1, the interface 1 and the network address 1 in the route information table; determining that the route information 2 corresponding to the subtask 2 comprises a target system 2, an interface 2 and a network address 2; the route information 3 corresponding to the determination subtask 3 includes the target system 3, the interface 3 and the network address 3.

The task scheduling server may be provided with a task scheduling system. The task scheduling server can trigger a workflow engine in the task scheduling system, call the interface 1 and send the subtask 1 to the target system 1 according to the network address 1 so that the target system 1 processes the subtask 1 to obtain a subtask processing result 1; the interface 2 can be called, and the subtask 2 is sent to the target system 2 according to the network address 2, so that the target system 2 processes the subtask 2 to obtain a subtask processing result 2; the interface 3 may be invoked to send the subtask 3 to the target system 3 according to the network address 3, so that the target system 3 processes the subtask 3 to obtain a subtask processing result 3.

The task scheduling server may determine that the target processing result corresponding to the target task includes a subtask processing result 1, a subtask processing result 2, and a subtask processing result 3, and send the target processing result to the terminal device.

In any of the above embodiments, the task scheduling server implements the task scheduling method through a task scheduling system.

Next, a task scheduling system will be described with reference to fig. 6.

Fig. 6 is a schematic structural diagram of a task scheduling system according to an embodiment of the present application. Referring to fig. 6, the task scheduling system may include a presentation layer, a business layer, a data access layer, and a persistence layer.

For the presentation layer, the presentation layer may employ a Model-view-controller (MVC) design pattern. The Model is the core of the application program and is used for data processing and operation. Views (views) are used to display data and user interactions. A Controller (Controller) is used to process the input, i.e. write the database record. The front end may employ Vue technology. Vue is a JavaScript model-View model (MVVM) library, which is built with the ideas of data driving and componentization, and is a set of progressive frameworks for building user interfaces. Vue is designed to be applied layer by layer from bottom up.

MVC layering helps manage complex applications. For example, view design may be focused on without relying on business logic, while testing of applications may be facilitated.

The presentation layer may also include common components that may include data visualization components, common form element components, and other components, among others.

For the service layer, the service layer may use a java current advanced SpringBoot (spp) framework. Springs boot is a framework for simplifying Spring development, and can be used for monitoring Spring application development.

SpringBoot frames may include SpringMVC and SpringBoot. Rights control, metadata services, business atomic service/service assembly, etc. can be implemented through SpringMVC and SpringBoot. The business layer can provide log service and realize transaction control. By adopting the front-end and back-end separation technology, the application interface of the system and the business logic can be separated organically.

For the data access layer, the data access layer may employ a Java-based persistent layer framework (Mybatis framework). MyBatis is an excellent persistence layer framework that can support custom structured query language (Structured Query Language, SQL), stored procedures, and high-level mappings. MyBatis can avoid almost all Java database connection (Java Database Connectivity, JDBC) code and manual setting parameters and retrieving result sets. MyBatis can use simple extensible markup language (Extensible Markup Language, XML) or annotations to configure and map native information, map interfaces and Java POJO (Plain Ordinary Java Object, common Java objects) to records in a database. And the method does not need any third party dependence and is easy to use. The design thought and implementation can be completely mastered through the documents and the source codes. MyBatis does not impose any impact on the existing design of the application or database.

The data access layer may include a file parsing module, a remote dictionary service (Remote Dictionary Server, dis) client graphical interface tool (dis client), a public outbound module. Authentication services may be provided through the data access layer.

For the persistence layer, the persistence layer is a logical layer that persists data. The persistence layer may include database clusters, redis caches, and metadata models. Data may be saved to a database cluster or Redis cache through a persistence layer. Flow control may be achieved through the persistence layer.

Optionally, when the task scheduling system is developed, the 'unified application task scheduling system access technical specification' can be written, the interface is docked according to the specification, and the calling implementation of interfaces such as task submission, task preexamination, task withdrawal, correction and complement submission and the like can be realized as required; interfaces such as holiday conversion, situation inquiry, item material inquiry, pipeline data receiving of each link, supplement and correction notification, task handling notification, preexamination result notification, acceptance result notification and the like are provided.

The task scheduling system can realize the butt joint standardization with a plurality of target systems and realize the unified standards of the target systems.

Optionally, a workflow engine may be included in the task scheduling system. The workflow engine is used as a part of the task scheduling system and provides a core solution of different decision information delivery routes, content levels and the like according to roles, division and conditions for the task scheduling system. The workflow engine comprises important functions such as node management, flow direction management, flow sample management and the like of the flow.

Alternatively, the workflow engine may be executed by a workflow reference model. The workflow reference model is described below with reference to fig. 7.

Fig. 7 is a schematic diagram of a workflow reference model according to an embodiment of the present application. Referring to fig. 7, the workflow reference model may include a workflow interface and a switch format module. The workflow interface and exchange format module may provide a workflow execution service that may include a plurality of workflow engines. The workflow interface and the exchange format module can call a flow definition tool through the interface I, call a client application through the interface II, call an application through the interface III, call other workflow execution services through the interface IV, and call a management monitoring tool through the interface V.

In an embodiment of the application, the task scheduling system can comprise a presentation layer, a service layer, a data access layer and a persistence layer. The task scheduling server can acquire a task request sent by the terminal equipment through the task scheduling system, split a target task according to a subtask identifier in the task request to obtain a plurality of subtasks, namely a plurality of events, and schedule the plurality of subtasks to corresponding target systems respectively without filling in and submitting user information in different systems for a plurality of times, and without defining the dependency relationship among the plurality of events by the user, so that user experience is improved.

Fig. 8 is a schematic structural diagram of a task scheduling device according to an embodiment of the present application. Referring to fig. 8, the task scheduling device 10 includes: a first acquisition module 11, a splitting module 12, a determining module 13, a second acquisition module 14 and a scheduling module 15, wherein,

the first obtaining module 11 is configured to obtain a task request sent by a terminal device, where the task request is used to request execution of a target task, the task request includes user information and M subtask identifiers, and M is a positive integer;

the splitting module 12 is configured to split the target task according to the M subtask identifiers to obtain M subtasks;

The determining module 13 is configured to determine a plurality of keywords corresponding to each subtask, and determine target information corresponding to the plurality of keywords in the user information according to the plurality of keywords, so as to obtain a plurality of target information corresponding to each subtask;

the second obtaining module 14 is configured to obtain a dependency relationship between M subtasks;

the scheduling module 15 is configured to perform scheduling processing on the M subtasks according to the dependency relationship and the multiple target information corresponding to each subtask, so as to obtain a target processing result of the target task.

The task scheduling device provided by the embodiment of the application can execute the technical scheme shown in the embodiment of the method, and the implementation principle and the beneficial effects are similar, and the detailed description is omitted.

In a possible implementation manner, the dependency relationship includes M subtask identifiers, and an upstream subtask identifier and a downstream subtask identifier corresponding to each subtask identifier; the scheduling module 15 is specifically configured to:

In one possible implementation, the scheduling module 15 is specifically configured to:

determining an ith subtask according to the execution sequence;

In one possible embodiment, if i is not equal to 1; the scheduling module 15 is specifically configured to:

In a possible embodiment, the determining module 13 is specifically configured to:

In one possible implementation manner, after receiving the subtask processing result corresponding to the ith subtask request sent by each target system, the apparatus further includes: the transmitting module 16 is configured to transmit,

the sending module 16 is configured to send the subtask processing result to the terminal device;

after obtaining the target processing result of the target task, the sending module 16 is further configured to:

And sending the target processing result to the terminal equipment.

Fig. 9 is a schematic structural diagram of a task scheduling server according to an embodiment of the present application. Referring to fig. 9, the task scheduling server 20 may include: a processor 21, and a memory 22. The processor 21, the memory 22, and the like are illustratively interconnected by a bus 23.

The memory 22 is used for storing program instructions;

the processor 21 is configured to execute the program instructions stored in the memory, so as to cause the task scheduling server 20 to execute the method shown in the above-mentioned method embodiment.

The task scheduling server provided by the embodiment of the application can execute the technical scheme shown in the embodiment of the method, and the implementation principle and the beneficial effects are similar, and are not repeated here.

Embodiments of the present application provide a computer-readable storage medium having stored therein computer-executable instructions for implementing the above-described method when the computer-executable instructions are executed by a processor.

Embodiments of the present application may also provide a computer program product comprising a computer program which, when executed by a processor, performs the above-described method.

In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, e.g., the division of modules is merely a logical function division, and there may be additional divisions of actual implementation, e.g., multiple modules may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or modules, which may be in electrical, mechanical, or other forms.

The modules illustrated as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to implement the solution of this embodiment.

In addition, each functional module in the embodiments of the present application may be integrated in one processing unit, or each module may exist alone physically, or two or more modules may be integrated in one unit. The units formed by the modules can be realized in a form of hardware or a form of hardware and software functional units.

The integrated modules, which are implemented in the form of software functional modules, may be stored in a computer readable storage medium. The software functional modules described above are stored in a storage medium and include instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or processor to perform some of the steps of the methods of the various embodiments of the application.

It should be understood that the above processor may be a central processing unit (Central Processing Unit, abbreviated as CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, abbreviated as DSP), application specific integrated circuits (Application Specific Integrated Circuit, abbreviated as ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in a processor for execution.

The memory may comprise a high-speed RAM memory, and may further comprise a non-volatile memory NVM, such as at least one magnetic disk memory, and may also be a U-disk, a removable hard disk, a read-only memory, a magnetic disk or optical disk, etc.

The bus may be an industry standard architecture (Industry Standard Architecture, ISA) bus, an external device interconnect (Peripheral Component Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, the buses in the drawings of the present application are not limited to only one bus or to one type of bus.

The storage medium may be implemented by any type or combination of volatile or nonvolatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.

An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuits, ASIC for short). Of course, the processor and the storage medium may reside as discrete components in an electronic control unit or master control device.

Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the method embodiments described above may be performed by hardware associated with program instructions. The foregoing program may be stored in a computer readable storage medium. The program, when executed, performs steps including the method embodiments described above; and the aforementioned storage medium includes: various media that can store program code, such as ROM, RAM, magnetic or optical disks.

Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the application.

Claims

1. A method for task scheduling, comprising:

acquiring the dependency relationship among the M subtasks;

2. The method according to claim 1, wherein the dependency relationship includes M subtask identifiers, and an upstream subtask identifier and a downstream subtask identifier corresponding to each subtask identifier; according to the dependency relationship and the multiple target information corresponding to each subtask, scheduling the M subtasks to obtain a target processing result of the target task, wherein the target processing result comprises:

3. The method according to claim 2, wherein performing scheduling processing on the M subtasks according to the execution sequence and the plurality of target information corresponding to each subtask to obtain a target processing result of the target task includes:

determining an ith subtask according to the execution sequence;

4. A method according to claim 3, wherein if i is not equal to 1; determining an ith subtask according to the execution sequence, including:

5. A method according to claim 3, wherein determining the target system, the target interface, and the target network address corresponding to the ith subtask comprises:

6. The method according to any one of claims 1-5, wherein determining target information corresponding to a plurality of keywords in the user information according to the plurality of keywords comprises:

7. The method according to any one of claims 3-6, wherein after receiving a subtask processing result corresponding to an ith subtask request sent by each target system, the method further comprises:

sending the subtask processing result to the terminal equipment;

and sending the target processing result to the terminal equipment.

8. A task scheduling device, comprising: the system comprises a first acquisition module, a splitting module, a determining module, a second acquisition module and a scheduling module, wherein,

9. A task scheduling server, comprising: a processor, and a memory communicatively coupled to the processor;

the memory stores computer-executable instructions;

the processor executes computer-executable instructions stored in the memory to implement the method of any one of claims 1 to 7.

10. A computer readable storage medium having stored therein computer executable instructions which when executed by a processor are adapted to carry out the method of any one of claims 1 to 7.

11. A computer program product comprising a computer program which, when executed by a processor, implements the method of any one of claims 1 to 7.