WO2019041824A1

WO2019041824A1 - Task scheduling method and server

Info

Publication number: WO2019041824A1
Application number: PCT/CN2018/083048
Authority: WO
Inventors: 李斌; 王瑞阳
Original assignee: 平安科技（深圳）有限公司
Priority date: 2017-08-29
Filing date: 2018-04-13
Publication date: 2019-03-07
Also published as: CN108255589A

Abstract

The present application is applicable to the technical field of task scheduling, and provides a task scheduling method and a server. The method comprises: obtaining tasks to be executed sent by task requesters; detecting the tasks to be executed, and obtaining a current priority order of the tasks to be executed; and sequentially sending the tasks to be executed to corresponding task executors in descending order of priorities, so as to enable the corresponding task executors to execute the tasks to be executed, wherein if a high priority task to be executed is not successfully executed by the corresponding task executor, no low priority task to be executed is sent to the corresponding task executor. According to the task scheduling method and the server, the tasks to be executed of the task requesters are controlled and scheduled in a unified manner, so that the schedule execution of the tasks to be executed can be performed more securely and accurately.

Description

Task scheduling method and server

The present application claims the benefit of the priority of the Japanese Patent Application Serial No. JP-A No. No. No. No. No. No. No. No.

Technical field

The present application belongs to the technical field of task scheduling, and in particular, to a task scheduling method and a server.

Background technique

When there are timing tasks inside the system that need to be executed, the quartz function in the spring software is generally used to complete. If the dependencies between the various tasks are involved, it needs to be controlled indirectly through some identification records. At this time, the tasks are basically isolated, which makes the system unable to conveniently control and manage each task.

technical problem

In view of this, the embodiment of the present application provides a task scheduling method and a server, so as to solve the problem that the isolation between tasks in the prior art can not easily control and manage each task.

Technical solution

A task scheduling method provided by the application includes:

Obtaining each to-be-executed task sent by each task requester;

Detecting each of the to-be-executed tasks, and acquiring a current priority order of each of the to-be-executed tasks;

Sending each of the to-be-executed tasks to the corresponding task performers in order of priority level, so that the corresponding task performers execute each of the to-be-executed tasks;

Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.

Beneficial effect

Compared with the prior art, the embodiment of the present application has the beneficial effects that: in the embodiment of the present application, each task to be executed sent by each task requester is first obtained, each task to be executed is detected, and the current priority order of each task to be executed is obtained. Sending each to-be-executed task to the corresponding task performer in order of priority level, so that the corresponding task performer executes each to-be-executed task; and the high-priority pending task is not executed by the corresponding task performer When successful, the low-priority tasks to be executed are not sent to the corresponding task executors, and the tasks to be executed are uniformly controlled and scheduled by each task requester, so that the scheduled execution of the tasks to be executed can be performed more safely and accurately. .

DRAWINGS

1 is a flowchart of an implementation of a task scheduling method provided by an embodiment of the present application;

2 is a flowchart of an implementation of step S102 in FIG. 1;

FIG. 3 is a flowchart of an implementation of step S103 in FIG. 1;

4 is a schematic diagram of an operating environment of a task scheduler according to an embodiment of the present application;

FIG. 5 is a block diagram of a program of a task scheduler according to an embodiment of the present application.

Embodiments of the invention

Embodiment 1

FIG. 1 is a flowchart showing an implementation process of a task scheduling method according to Embodiment 1 of the present application, which is described in detail as follows:

Step S101: Acquire each to-be-executed task sent by each task requester.

The task requester is the party that initiates the task to be executed, and is opposite to the task performer in the subsequent step, and the task performer is the party that executes each task to be executed.

In this embodiment, the tasks to be executed may include real-time tasks, quasi-real-time tasks, and other tasks. Real-time tasks mainly refer to tasks with high urgency requirements and immediate execution by task performers. Quasi-real-time tasks mainly mean that the urgency requirements are not high, but the task execution instructions must also be forwarded to the task executor within a limited time (for example, within 10 minutes). Other tasks are tasks with low urgency requirements and no requirements for execution time or long time.

Step S102: Detect each of the to-be-executed tasks, and obtain a current priority order of each of the to-be-executed tasks.

Optionally, the step S102 is specifically: detecting each of the to-be-executed tasks once every preset time, and acquiring a current priority order of each of the to-be-executed tasks.

It can be understood that the task to be executed sent by the task requester is continuously acquired in step S101, and therefore the acquired task to be executed needs to be updated. In this embodiment, each of the acquired tasks to be executed is detected once every preset time, and then the current priority order of each task to be executed is determined.

As an implementation manner, the to-be-executed task may include task execution time information, task performer information, task requester information, and the like. Referring to FIG. 2, in this embodiment, the to-be-executed task includes task execution time information, and step S102 may include the following steps:

Step S201: Detect task execution time of each of the to-be-executed tasks.

The task to be executed corresponds to a task execution time, and the task execution time may be a time segment or a time point. For example, two pending tasks are acquired at 16:00, the task execution time in the first pending task is 16:05, and the task execution time of the second pending task is 16:10~16:20. That is, the task execution time of the first task to be executed is the time point, and the task execution time of the second task to be executed is the time period.

Step S202: Determine a current priority order of each of the to-be-executed tasks according to a task execution time of each of the to-be-executed tasks.

In this embodiment, the current priority order of each task to be executed is determined by the task execution time of each task to be executed. Specifically, the priority sequence of the task execution time may be taken as the priority order of each task to be executed, that is, the priority of the task to be executed with the task execution time being higher is higher, and the priority of the task to be executed after the task execution time is later. low.

After determining the current priority order of each of the to-be-executed tasks according to the task execution time of each to-be-executed task, each of the to-be-executed tasks is sent to the corresponding one according to the determined priority order of each to-be-executed task. The task executor is such that the respective task executor executes each of the to-be-executed tasks. Specifically, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.

For example, the three tasks to be executed are the first task to be executed, the second task to be executed, and the third task to be executed. The task execution time of the first task to be executed is 16:05, and the task execution time of the second task to be executed is For 16:10~16:20, the task execution time of the third task to be executed is 16:40, and the priority order of the three tasks to be executed is the first task to be executed and the second task to be executed in descending order. And the third task to be performed.

Step S103: Send each of the to-be-executed tasks to the corresponding task performers in order according to the priority level, so that the corresponding task performers execute each of the to-be-executed tasks.

Wherein, when the first to-be-executed task is not executed or is not executed successfully, the second to-be-executed task and the third-generation execution task are not sent to the corresponding task execution party; until the first to-be-executed task is successfully executed, The second task to be executed is sent to the corresponding task performer to execute; when the second task to be executed is executed or not executed successfully, the third task to be executed is not sent to the corresponding task performer until the second task to be executed When the execution is successful, the third pending task is sent to the corresponding task performer for execution.

Referring to FIG. 3, in an embodiment, step S103 may include the following steps:

Step S301: sequentially send each of the to-be-executed tasks to a client corresponding to the corresponding task executor in order of priority.

The number of the client is multiple, and one client corresponds to one task performer. Each client is deployed on the host of the task executor and can execute the shell script of the task executor. The deployment mode of each client in the task executor can be a single point deployment mode, HA (Hadoop) deployment mode, cluster (cluster) deployment mode or component deployment mode.

In this embodiment, each to-be-executed task may be sequentially sent to the client corresponding to the corresponding task executor in order of priority, so that the client causes the task executor to execute the to-be-executed task.

For example, each of the to-be-executed tasks may be sequentially sent to the client corresponding to the corresponding task executor in order of the task execution time of each task to be executed, so that the client causes the task executor to execute the to-be-executed task.

Step S302: The client controls the corresponding task performer to execute the to-be-executed task by using a shell script according to the to-be-executed task.

The task scheduling method in this embodiment is applicable to a task management center, and the task management center includes a task scheduling center and a plurality of clients. The task scheduling center initiates a call instruction to the task performer according to the task requester or the established policy; the task dispatch center is responsible for controlling each pending task, for example, monitoring the task execution time, and executing the task in the previous zone before the task execution time is not executed or When the execution is not successful, the execution instruction of the next execution task after the execution time is not sent to the corresponding task execution agent, until the execution of the previous execution task is successful, and then the execution instruction of the next execution task is generated and sent to The corresponding client executes the task to be executed through the client control task executive. Through the task management center to control each task to be executed, the scheduling execution of each task to be executed can be performed more safely and accurately.

In one embodiment, the data interaction process between the task requester, the task scheduling center, the client, and the task performer is as follows:

The task requester sends the real-time task request to the task dispatching center. The real-time task is directly requested by the task initiator to the task dispatching center, and the task executing party is immediately called to perform the task to be executed.

After obtaining the real-time task request, the task scheduling center generates a real-time task execution instruction according to the task execution party and the like in the real-time task request, and sends the command to the corresponding client through the interface;

The client controls the corresponding task performer to execute the real-time task in the real-time task execution instruction according to the real-time task execution instruction.

In another embodiment, the data interaction process between the task requester, the task scheduling center, the client, and the task performer is as follows:

The task requester sends the quasi-real-time task request to the task dispatching center, and the quasi-real-time task is the request directly from the task requesting party to the dispatching center, and the dispatching center initiates an execution instruction to the task executing party within a certain time according to the actual situation;

After obtaining the quasi-real-time task request, the task scheduling center generates a quasi-real-time task execution instruction according to the task name, the task execution time, and the client corresponding to the task in the quasi-real-time task request, and passes the interface at a certain time according to the actual situation. Send to the corresponding client. For example, the quasi-real-time task may forward the instruction to invoke the task to the servant within 10 minutes after receiving the requestor system call instruction;

The client controls the task performer to execute the quasi-real-time task in the quasi-real-time task execution instruction according to the quasi-real-time task execution instruction.

The task scheduling method firstly acquires each to-be-executed task sent by each task requester, detects each to-be-executed task, and obtains the current priority order of each to-be-executed task, and sequentially sends each to-be-executed task to the corresponding one according to the priority level. The task executor, so that the corresponding task executor executes each task to be executed; and when the high priority task to be executed is not successfully executed by the corresponding task executor, the low priority task to be executed is not sent to the corresponding task The task executor performs unified control scheduling on each task to be executed of each task requester, so that the scheduling execution of the task to be executed can be performed more safely and accurately.

It should be understood that the size of the sequence of the steps in the above embodiments does not mean that the order of execution is performed. The order of execution of each process should be determined by its function and internal logic, and should not be construed as limiting the implementation process of the embodiments of the present application.

Embodiment 2

Corresponding to the task scheduling method described in the foregoing embodiment, FIG. 4 is a schematic diagram showing an operating environment of the task scheduling program provided by the embodiment of the present application. For the convenience of explanation, only the parts related to the present embodiment are shown.

In the present embodiment, the task scheduler 400 is installed and runs in the server 40. The server 40 can include, but is not limited to, a memory 401 and a processor 402. Figure 4 shows only server 40 with components 401-402, but it should be understood that not all illustrated components may be implemented, and more or fewer components may be implemented instead.

The memory 401 includes at least one type of computer readable storage medium, which in some embodiments may be an internal storage unit of the server 40, such as a hard disk or memory of the server 40. The memory 401 may also be an external storage device of the server 40 in other embodiments, such as a plug-in hard disk equipped on the server 40, a smart memory card (SMC), and a secure digital number (Secure). Digital, SD) cards, flash cards, etc. Further, the memory 401 may also include both an internal storage unit of the server 40 and an external storage device. The memory 401 is configured to store application software and various types of data installed in the server 40, such as program codes of the task scheduler 400. The memory 401 can also be used to temporarily store data that has been output or is about to be output.

The processor 402, in some embodiments, can be a central processor (Central) A processing unit (CPU), a microprocessor or other data processing chip for running program code or processing data stored in the memory 401, such as executing the task scheduler 400 and the like.

Additionally, server 40 may also include a display. The display may be an LED display, a liquid crystal display, a touch liquid crystal display, and an OLED (Organic) in some embodiments. Light-Emitting Diode, organic light-emitting diodes, etc. The display is for displaying information processed in the server 40 and a user interface for displaying visualizations, such as a task scheduling interface or the like. The components 401-42 of the server 40 communicate with one another via a system bus.

Please refer to FIG. 5 , which is a program module diagram of the task scheduler 400 provided by the embodiment of the present application. In this embodiment, the task scheduler 400 may be divided into one or more modules, and the one or more modules are stored in the memory 401 and executed by one or more processors (this implementation) For example, the processor 402) is executed to complete the application. For example, in FIG. 5, the task scheduler 400 can be divided into a task acquisition module 501, a detection module 502, and an execution module 503 to be executed. A module referred to in this application refers to a series of computer readable instruction instruction segments capable of performing a particular function, and is more suitable than the program to describe the execution of the task scheduler 400 in the server 40. The following description will specifically describe the functions of the program modules 501-503.

The task to be executed 501 is configured to acquire each task to be executed sent by each task requester.

The detecting module 502 is configured to detect each of the to-be-executed tasks, and obtain a current priority order of each of the to-be-executed tasks.

The executing module 503 is configured to sequentially send each of the to-be-executed tasks to the corresponding task performers in order of priority, so that the corresponding task performers execute the respective to-be-executed tasks. Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.

Optionally, the detecting module 502 is configured to: detect each of the to-be-executed tasks once every preset time, and obtain a current priority order of each of the to-be-executed tasks.

Optionally, the detecting module 502 can include a time detecting unit and a priority determining unit. The time detecting unit is configured to detect a task execution time of each of the to-be-executed tasks. The priority determining unit is configured to determine a current current priority order of each of the to-be-executed tasks according to a task execution time of each of the to-be-executed tasks.

Optionally, the execution module 503 can include a sending unit and an executing unit. The sending unit is configured to sequentially send each of the to-be-executed tasks to an execution unit corresponding to a corresponding task executor according to a priority level; each execution unit corresponds to one client, and the number of the client is multiple One of the clients corresponds to a task performer. The execution unit is configured to execute, by using a shell script, a corresponding task execution party to execute the to-be-executed task according to the to-be-executed task.

Optionally, the to-be-executed task includes task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients. The sending unit is specifically configured to: send each of the to-be-executed tasks to a client corresponding to the task performer identification information in each of the to-be-executed tasks according to a priority level.

It will be clearly understood by those skilled in the art that, for convenience and brevity of description, only the division of each functional unit and module described above is exemplified. In practical applications, the above functions may be assigned to different functional units according to needs. The module is completed by dividing the internal structure of the device into different functional units or modules to perform all or part of the functions described above. Each functional unit and module in the embodiment may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit, and the integrated unit may be implemented by hardware. Formal implementation can also be implemented in the form of software functional units. In addition, the specific names of the respective functional units and modules are only for the purpose of facilitating mutual differentiation, and are not intended to limit the scope of protection of the present application. For the specific working process of the unit and the module in the foregoing system, reference may be made to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the above embodiments, the descriptions of the various embodiments are different, and the parts that are not detailed or described in the specific embodiments may be referred to the related descriptions of other embodiments.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.

The above-mentioned embodiments are only used to explain the technical solutions of the present application, and are not limited thereto; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still implement the foregoing embodiments. The technical solutions described in the examples are modified or equivalently replaced with some of the technical features; and the modifications or substitutions do not deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in Within the scope of protection of this application.

Claims

A task scheduling method, comprising:

Obtaining each to-be-executed task sent by each task requester;

Detecting each of the to-be-executed tasks, and acquiring a current priority order of each of the to-be-executed tasks;

Sending each of the to-be-executed tasks to the corresponding task performers in order of priority level, so that the corresponding task performers execute each of the to-be-executed tasks;

Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
The task scheduling method according to claim 1, wherein the detecting the respective to-be-executed tasks and obtaining the current priority order of each of the to-be-executed tasks is specifically:

Each of the to-be-executed tasks is detected every preset time, and the current priority order of each of the to-be-executed tasks is obtained.
The task scheduling method according to claim 1, wherein the task to be executed includes task execution time information; the detecting each of the to-be-executed tasks, and obtaining a current priority order of each of the to-be-executed tasks include:

Detecting a task execution time of each of the to-be-executed tasks;

Determining a current current priority order of each of the to-be-executed tasks according to task execution time of each of the to-be-executed tasks.
The task scheduling method according to any one of claims 1 to 3, wherein each of the to-be-executed tasks is sequentially sent to a corresponding task executing party in order of priority level, so that the corresponding task executing party Executing each of the to-be-executed tasks specifically includes:

Sending each of the to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level; the number of the client is multiple, and one of the clients corresponds to one task executor;

The client executes the to-be-executed task by using a shell script to control a corresponding task performer according to the to-be-executed task.
The task scheduling method according to claim 4, wherein the task to be executed includes task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients;

The sending the respective to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level is specifically:

Each of the to-be-executed tasks is sent to a client corresponding to the task performer identification information in each of the to-be-executed tasks in order of priority.
A server, comprising:

The to-be-executed task acquisition module is configured to acquire each to-be-executed task sent by each task requester.

The detecting module is configured to detect each of the to-be-executed tasks, and obtain a current priority order of each of the to-be-executed tasks.

The execution module is configured to sequentially send each of the to-be-executed tasks to the corresponding task performers in order of priority, so that the corresponding task performers execute the respective to-be-executed tasks. Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
The server according to claim 6, wherein the detecting module is configured to: detect each of the to-be-executed tasks once every preset time, and obtain a current priority order of each of the to-be-executed tasks.
The server according to claim 6, wherein the detecting module comprises a time detecting unit and a priority determining unit;

The time detecting unit is configured to detect a task execution time of each of the to-be-executed tasks;

The priority determining unit is configured to determine a current current priority order of each of the to-be-executed tasks according to a task execution time of each of the to-be-executed tasks.
The server according to any one of claims 6-8, wherein the execution module comprises a sending unit and an executing unit;

The sending unit is configured to sequentially send each of the to-be-executed tasks to an execution unit corresponding to a corresponding task executor according to a priority level; each execution unit corresponds to one client, and the number of the client is multiple One of the clients corresponds to a task performer;

The execution unit is configured to execute, by using a shell script, a corresponding task execution party to execute the to-be-executed task according to the to-be-executed task.
The server according to claim 9, wherein the task to be executed includes task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients; And: sending, according to the priority level, each of the to-be-executed tasks to a client corresponding to the task performer identification information in each of the to-be-executed tasks.
A server, comprising: a memory, a processor, and computer readable instructions stored in the memory and executable on the processor, the processor executing the computer readable instructions Implement the following steps:

Obtaining each to-be-executed task sent by each task requester;

Detecting each of the to-be-executed tasks, and acquiring a current priority order of each of the to-be-executed tasks;

Sending each of the to-be-executed tasks to the corresponding task performers in order of priority level, so that the corresponding task performers execute each of the to-be-executed tasks;

Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
The server according to claim 11, wherein the detecting the respective to-be-executed tasks and obtaining the current priority order of each of the to-be-executed tasks is specifically:

Each of the to-be-executed tasks is detected every preset time, and the current priority order of each of the to-be-executed tasks is obtained.
The server according to claim 11, wherein the detecting the respective to-be-executed tasks and obtaining the current priority order of each of the to-be-executed tasks is specifically:

Detecting execution time requirements of each of the to-be-executed tasks;

Determining a current current priority order of each of the to-be-executed tasks according to an execution time requirement of each of the to-be-executed tasks.
The server according to any one of claims 11 to 13, wherein each of the to-be-executed tasks is sequentially sent to a corresponding task executing party in order of priority level, so that the corresponding task executing party executes each The tasks to be executed specifically include:

Sending each of the to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level; the number of the client is multiple, and one of the clients corresponds to one task executor;

The client executes the to-be-executed task by using a shell script to control a corresponding task performer according to the to-be-executed task.
The server according to claim 14, wherein the task to be executed includes task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients;

The sending the respective to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level is specifically:

Each of the to-be-executed tasks is sent to a client corresponding to the task performer identification information in each of the to-be-executed tasks in order of priority.
A computer readable storage medium storing computer readable instructions, wherein the computer readable instructions, when executed by a processor, implement the following steps:

Obtaining each to-be-executed task sent by each task requester;

Detecting each of the to-be-executed tasks, and acquiring a current priority order of each of the to-be-executed tasks;

Sending each of the to-be-executed tasks to the corresponding task performers in order of priority level, so that the corresponding task performers execute each of the to-be-executed tasks;

Wherein, when the high priority pending task is not successfully executed by the corresponding task performer, the low priority pending task is not sent to the corresponding task performer.
The server according to claim 16, wherein the detecting the respective to-be-executed tasks and obtaining the current priority order of each of the to-be-executed tasks is specifically:

Each of the to-be-executed tasks is detected every preset time, and the current priority order of each of the to-be-executed tasks is obtained.
The server according to claim 16, wherein the detecting the respective to-be-executed tasks and obtaining the current priority order of each of the to-be-executed tasks is specifically:

Detecting execution time requirements of each of the to-be-executed tasks;

Determining a current current priority order of each of the to-be-executed tasks according to an execution time requirement of each of the to-be-executed tasks.
The server according to any one of claims 16 to 18, wherein each of the to-be-executed tasks is sequentially sent to a corresponding task executing party in order of priority, so that the corresponding task executing party executes each The tasks to be executed specifically include:

Sending each of the to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level; the number of the client is multiple, and one of the clients corresponds to one task executor;

The client executes the to-be-executed task by using a shell script to control a corresponding task performer according to the to-be-executed task.
The computer readable storage medium according to claim 19, wherein the task to be executed comprises task execution time information and task performer identification information; each task performer identification information corresponds to one of the clients;

The sending the respective to-be-executed tasks to the client corresponding to the corresponding task executor in sequence according to the priority level is specifically:

Each of the to-be-executed tasks is sent to a client corresponding to the task performer identification information in each of the to-be-executed tasks in order of priority.