CN113806038A - Task scheduling method, device, electronic equipment, storage medium and program product - Google Patents
Task scheduling method, device, electronic equipment, storage medium and program product Download PDFInfo
- Publication number
- CN113806038A CN113806038A CN202110891794.5A CN202110891794A CN113806038A CN 113806038 A CN113806038 A CN 113806038A CN 202110891794 A CN202110891794 A CN 202110891794A CN 113806038 A CN113806038 A CN 113806038A
- Authority
- CN
- China
- Prior art keywords
- task
- target
- version
- upstream
- input
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
Abstract
The invention provides a task scheduling method, a task scheduling device, an electronic device, a storage medium and a program product, wherein the method comprises the following steps: receiving an execution input for a target task; responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task; executing the target task upon determining that a task version of an upstream task has run successfully. When a target task is executed, determining a task version of an upstream task which needs to be called by the target task in a task dependency relationship; and executing the target task under the condition that the task version of the upstream task is determined to be successfully operated, so that the task instance with the dependency relationship can be smoothly executed, and the operation and maintenance cost is reduced.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a task scheduling method, an apparatus, an electronic device, a storage medium, and a program product.
Background
In big data ecology, a scheduling system plays an important role, which is a basic component for ensuring that data flow can be executed according to a correct flow, and the sequential execution of tasks ensures the accuracy of data, however, the existing scheduling system cannot completely meet business requirements.
In the prior art, for example, when two task flows commonly depend on a unified task, the two task flows need to be merged into one, which greatly increases the operation and maintenance cost; when the dependent tasks are not in the same time period (minute, hour, day, week and the like), the existing mode has no way to realize the dependent tasks, or can only realize the dependent tasks through hard coding or experience, so that some tasks are not executed and the downstream tasks of the tasks are executed, and inaccurate data occurs; moreover, when a task flow fails, the existing method needs to revise the script to revise the data again.
Therefore, how to provide a task scheduling scheme to smoothly execute task instances with dependency relationships and reduce operation and maintenance costs is a technical problem that needs to be solved by those skilled in the art.
Disclosure of Invention
The invention provides a task scheduling method, a task scheduling device, an electronic device, a storage medium and a program product, which can smoothly execute task instances with dependency relationship and reduce operation and maintenance cost.
In a first aspect, the present invention provides a task scheduling method, including:
receiving an execution input for a target task;
responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises task version information of an upstream task which needs to be called by the target task;
executing the target task upon determining that a task version of an upstream task has run successfully.
In one embodiment, further comprising:
receiving a first input of a user for establishing a target task;
in response to the first input, adding the target task;
receiving a second input of the task dependency relationship of the user on the target task;
and responding to the second input, and adding a task version of an upstream task required to be called when the target task is executed for the target task.
In one embodiment, the task version of the upstream task comprises: time information when the upstream task executes.
In one embodiment, before the receiving the execution input for the target task, the method further comprises:
determining a target task instance with the running time less than the current time in task instances to be executed at intervals of preset time;
and after the target task instance is successfully operated, updating the information of the task version corresponding to the target task instance.
In one embodiment, after the task dependency relationship of the target task is obtained in response to the execution input, the method further includes:
under the condition that the task version of the upstream task is determined not to run successfully, the running of the target task is suspended until the task version of the upstream task runs successfully;
determining missing task versions which are not successfully operated in the task versions of the upstream task;
and sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
In one embodiment, further comprising:
receiving a third input of the user for data restoration of the target task;
responding to the third input, and acquiring task dependency relationship and task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed;
re-executing the target task based on the task dependency upon determining that the task execution information does not conform to the task dependency.
In a second aspect, the present invention provides a task scheduling apparatus, including:
an execution input module for receiving an execution input for a target task;
a relationship obtaining module, configured to obtain a task dependency relationship of the target task in response to the execution input; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task;
and the task execution module is used for executing the target task under the condition that the task version of the upstream task is determined to be successfully operated.
In one embodiment, further comprising:
the first receiving module is used for first receiving a first input of a user for establishing a target task;
a first response module to add the target task in response to the first input;
the second receiving module is used for receiving second input of the task dependency relationship of the user on the target task;
and the second response module is used for responding to the second input and adding the task version of the upstream task required to be called when the target task is executed for the target task.
In one embodiment, the task version of the upstream task comprises: time information when the upstream task executes.
In one embodiment, further comprising:
the task scanning module is used for determining a target task instance with the running time less than the current time in task instances to be executed at intervals of preset time;
and the version updating module is used for updating the information of the task version corresponding to the target task instance after the target task instance is successfully operated.
In one embodiment, further comprising:
the task suspending module suspends the running of the target task under the condition that the task version of the upstream task is determined not to run successfully by English until the task version of the upstream task runs successfully;
the missing determining module is used for determining missing task versions which do not run successfully in the task versions of the upstream tasks;
and the operation reminding module is used for sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
In one embodiment, further comprising:
the third receiving module is used for receiving a third input of the user for data restoration of the target task;
the third response module is used for responding to the third input and acquiring the task dependency relationship and the task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed;
and the re-execution module is used for re-executing the target task based on the task dependency relationship under the condition that the task execution information is determined not to accord with the task dependency relationship.
In a third aspect, the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the task scheduling method according to any one of the above methods when executing the program.
In a fourth aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the task scheduling method as set forth in any of the above.
In a fifth aspect, the present invention also provides a computer program product comprising a computer program/instructions which, when executed by a processor, implement the steps of the task scheduling method as described in any of the above.
According to the task scheduling method, the task scheduling device, the electronic equipment, the storage medium and the program product, when the target task is executed, the task version of the upstream task to be called by the target task in the task dependency relationship is determined; and executing the target task under the condition that the task version of the upstream task is determined to be successfully operated, so that the task instance with the dependency relationship can be smoothly executed, and the operation and maintenance cost is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the present invention or the prior art, the drawings needed for the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a flowchart of a task scheduling method according to an embodiment of the present invention;
fig. 2 is a task dependency diagram of a task scheduling method according to an embodiment of the present invention;
fig. 3 is a schematic diagram of task establishment of a task scheduling method according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a task scheduling device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of another electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms first, second and the like in the description and in the claims of the present invention are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that embodiments of the invention may be practiced otherwise than as specifically illustrated and described herein. In addition, "and/or" in the specification and claims means at least one of connected objects, a character "/" generally means that a preceding and succeeding related objects are in an "or" relationship.
The task scheduling method of the present invention is described below in conjunction with fig. 1-3.
Fig. 1 is a flowchart of a task scheduling method according to an embodiment of the present invention; fig. 2 is a task dependency diagram of a task scheduling method according to an embodiment of the present invention; fig. 3 is a schematic diagram of task establishment of a task scheduling method according to an embodiment of the present invention.
In a specific implementation manner of the present invention, an embodiment of the present invention provides a task scheduling method, including:
step 110: an execution input for a target task is received.
In the embodiment of the invention, firstly, input of execution of the target task needs to be received, in practice, a user can select the target task needing to be executed, an "execution" button can be set, and when the user needs to execute the target task, the user can receive the execution input of the target task by directly clicking the "execution" button.
Step 120: responding to the execution input, and acquiring a task dependency relationship of the target task; and the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task.
After receiving the execution input, the target task is not executed immediately, but a task dependency relationship of the target task needs to be obtained, and the task dependency relationship stores information such as a task version of an upstream task required by the target task to execute, where the upstream task refers to a task from which data required to be called by the target task to execute comes.
Step 130: executing the target task upon determining that a task version of an upstream task has run successfully.
For a task, each task version has one task instance when running, the task instances need to be detected in advance upstream by the task dependency relationship and the time rule when running, and the instances and the related records of the instance dependency are fallen into a database; for example as shown in FIG. 2: task a (run at 12 pm daily), task B (run at 1 pm daily), run at 9/22/2020: while the execution of task version Bver1 depends on the data produced by instance a1 on which task version Aver1 runs. Then task version Bver1 may execute instance B1 corresponding to target task version Bver1 if it is determined that instance a1 corresponding to upstream task version Aver1 has run successfully and that task version Bver1 has been generated. If, for some reason, target task A did not produce task version Aver1, or A1 did not run successfully, target task B would need to wait until task A1 ran successfully.
In another embodiment of the present invention, in order to implement establishment of a task dependency relationship of a target task, a first input of a user for establishing the target task may be specifically received; in response to the first input, adding the target task; receiving a second input of the task dependency relationship of the user on the target task; and responding to the second input, and adding a task version of an upstream task required to be called when the target task is executed for the target task.
Specifically, a "new task" button may be set, and when a user needs to establish a new task, the user may click the "new task" button, although a popup of the new task is popped up, the name of the target task may be filled in, and of course, the user may also fill in a task dependency relationship of the target task in the popup, for example, a certain task dependency relationship may be: the time span can be realized through instance dependency, for example, the task C is an hourly task in period, the task D is a daily task in period, the task D instance is generated to depend on 24 versions (versions of each hour) of the task C on the day in the task instance dependency time, and so on. That is, the task D executed on the same day depends on the 24 task versions executed on each hour on the same day, so that the task dependency relationship is increased.
More specifically, in a specific embodiment, when naming the task version of the upstream task, the task version of the upstream task may include time information of the upstream task when executing. For example, an expression may be run according to the time of an upstream task (which may, of course, be so named for a target task), in the morning 00: 00: 00, calculating the time point when the task can run (the task runs each time, namely a task version), and recording the task version record needing to run into a database; if task A is 12 per day: 00: 00 min, then 22/9/2020, its version is 202009221200, and of course, other contents may be included in the task version, for example, the short name of the project in which the task is located.
Thus, naming of task versions is performed by time information, since different task versions of the same task run with only the relevant time parameters, and since the task versions themselves are time, a generic tool for generating output text HTML pages, e-mails, configuration files, source code, etc. by means of dynamic expressions (e.g. freeMarker, etc., freeMarker is a template engine: a generic tool based on templates and data to be changed and used to generate output text HTML pages, e-mails, configuration files, source code, etc.). ) Or using a regular substitution for a time parameter in the task running parameters; for example: a certain task counts pv (page view) of a website every day, a corresponding date is a dynamic parameter, and the instance runtime calculates and obtains a date parameter today 20200922 through a task version (e.g., 202009221200), that is, the page view of the date parameter today 20200922 may be finally searched in the database.
In another embodiment of the present invention, in order to implement the execution of the target task and ensure that all task versions required by the target task have been successfully run, a target task instance whose running time is less than the current time may be determined in task instances to be executed at preset intervals; and after the target task instance is successfully operated, updating the information of the task version corresponding to the target task instance. For example, records with running time less than the current time in the target task instances may be scanned every minute to find out which task instances need to run, and the success status may be set to the corresponding task version after the target task instances that need to run successfully.
In addition, in a further embodiment of the present invention, in the case where it is determined that the task version of the upstream task has not successfully run, the running of the target task is suspended until the task version of the upstream task has successfully run; determining missing task versions which are not successfully operated in the task versions of the upstream task; and sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
And under the condition that the task version of the upstream task is determined not to be successfully operated, the target task waits until the task version of the upstream task is successful, and the target task starts to operate. That is to say, the task instance to be run not only runs when the time arrives, but also checks whether the upstream dependent task version has been successfully run, and if the task instance has been successfully run, the task instance to be run will be unsuccessful while waiting for all the upstream dependent task versions to be successfully run. For example, after the task instance B1 reaches the running time point, it is further required to check whether the version (2020091200) of the task a is successfully run, and if the version is successfully run, the task a is run, otherwise, the task instance waits for the running, and of course, the tasks that are not run can be prompted to run as soon as possible, and the personnel responsible for the task instance can be prompted.
On the basis of the above embodiment, in practice, the target task may be executed under the condition that the task version of the upstream task is not completed, so that the phenomenon of inaccurate data is caused, and in order to implement data correction of the target task, a third input for performing data repair on the target task by a user may be received; responding to the third input, and acquiring task dependency relationship and task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed; re-executing the target task based on the task dependency upon determining that the task execution information does not conform to the task dependency.
That is, a "one-key repair" button may be set to perform data repair on a target task, and certainly, an "all-repair" button may also be set to perform data repair on all tasks, and since a dynamic parameter of each running task is related to a version, the task can be repaired only by finding a corresponding version one-key; if the task has the downstream dependency, the data can be repaired by re-running all the downstream tasks in a recursive manner.
Referring to fig. 3, a target task needs to be newly created, after the target task is created, a task dependency relationship is configured for the target task, a task version is generated according to a time expression of the task version, a task version depended on by the target task is generated based on the task dependency relationship, whether all task versions required by the target task successfully run is detected through time detection and an upstream task version, if all task versions required by the target task successfully run, the target task can be run, and after a task instance of the target task successfully runs, the target task can be correspondingly marked as successfully run, and naming is performed according to the running success time.
According to the task scheduling method provided by the embodiment of the invention, when a target task is executed, the task version of an upstream task to be called by the target task in a task dependency relationship is determined; and executing the target task under the condition that the task version of the upstream task is determined to be successfully operated, so that the task instance with the dependency relationship can be smoothly executed, and the operation and maintenance cost is reduced.
It should be noted that, in the task scheduling method provided in the embodiment of the present invention, the execution main body may be a task scheduling device, or, a control module in the task scheduling device, configured to execute the load task scheduling method. In the embodiment of the present invention, a task scheduling device is taken as an example to execute a method for scheduling a load task, and the method for scheduling a task provided in the embodiment of the present invention is described.
The task scheduling device provided by the present invention is described below, and the task scheduling device described below and the task scheduling method described above may be referred to correspondingly.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a task scheduling device according to an embodiment of the present invention.
In another embodiment of the present invention, a task scheduling apparatus 400 is provided, including:
an execution input module 410 for receiving an execution input for a target task;
a relationship obtaining module 420, configured to obtain a task dependency relationship of the target task in response to the execution input; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task;
a task execution module 430, configured to execute the target task if it is determined that the task version of the upstream task has run successfully.
In one embodiment, further comprising:
the first receiving module is used for first receiving a first input of a user for establishing a target task;
a first response module to add the target task in response to the first input;
the second receiving module is used for receiving second input of the task dependency relationship of the user on the target task;
and the second response module is used for responding to the second input and adding the task version of the upstream task required to be called when the target task is executed for the target task.
In one embodiment, the task version of the upstream task comprises: time information when the upstream task executes.
In one embodiment, further comprising:
the task scanning module is used for determining a target task instance with the running time less than the current time in task instances to be executed at intervals of preset time;
and the version updating module is used for updating the information of the task version corresponding to the target task instance after the target task instance is successfully operated.
In one embodiment, further comprising:
the task suspending module is used for suspending the operation of the target task under the condition that the task version of the upstream task is determined not to be successfully operated until the task version of the upstream task is successfully operated;
the missing determining module is used for determining missing task versions which do not run successfully in the task versions of the upstream tasks;
and the operation reminding module is used for sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
In one embodiment, further comprising: the third receiving module is used for receiving a third input of the user for data restoration of the target task;
the third response module is used for responding to the third input and acquiring the task dependency relationship and the task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed;
and the re-execution module is used for re-executing the target task based on the task dependency relationship under the condition that the task execution information is determined not to accord with the task dependency relationship.
The task scheduling device provided by the embodiment of the invention determines the task version of the upstream task to be called by the target task in the task dependency relationship when the target task is executed; and executing the target task under the condition that the task version of the upstream task is determined to be successfully operated, so that the task instance with the dependency relationship can be smoothly executed, and the operation and maintenance cost is reduced.
The task scheduling device in the embodiment of the present invention may be a device, or may be a component, an integrated circuit, or a chip in a terminal. The device can be mobile electronic equipment or non-mobile electronic equipment. By way of example, the mobile electronic device may be a mobile phone, a tablet computer, a notebook computer, a palm top computer, a vehicle-mounted electronic device, a wearable device, an ultra-mobile personal computer (UMPC), a netbook or a Personal Digital Assistant (PDA), and the like, and the non-mobile electronic device may be a server, a Network Attached Storage (NAS), a Personal Computer (PC), a Television (TV), a teller machine or a self-service machine, and the like, and the embodiment of the present invention is not particularly limited.
The task scheduling device in the embodiment of the present invention may be a device having an operating system. The operating system may be an Android (Android) operating system, an ios operating system, or other possible operating systems, and embodiments of the present invention are not limited in particular.
The task scheduling device provided in the embodiment of the present invention can implement each process implemented by the task scheduling device in the method embodiment of fig. 1, and is not described here again to avoid repetition.
Fig. 5 is a schematic diagram of a hardware structure of an electronic device implementing an embodiment of the present invention.
The electronic device 500 includes, but is not limited to: a radio frequency unit 501, a network module 502, an audio output unit 503, an input unit 504, a sensor 505, a display unit 506, a user input unit 507, an interface unit 508, a memory 509, a processor 510, and the like.
Those skilled in the art will appreciate that the electronic device 500 may further include a power supply (e.g., a battery) for supplying power to various components, and the power supply may be logically connected to the processor 510 via a power management system, so as to implement functions of managing charging, discharging, and power consumption via the power management system. The electronic device structure shown in fig. 5 does not constitute a limitation of the electronic device, and the electronic device may include more or less components than those shown, or combine some components, or arrange different components, and thus, the description is omitted here.
Wherein, the input unit 504 is used for receiving the execution input of the target task;
a processor 510, configured to obtain a task dependency relationship of the target task in response to the execution input; and the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task.
Executing the target task upon determining that a task version of an upstream task has run successfully.
In one embodiment, the input unit 504 is configured to receive a first input of a user to establish a target task;
a processor 510 for adding the target task in response to the first input;
an input unit 504, configured to receive a second input of a task dependency relationship of the user on the target task;
a processor 510, configured to add, to the target task, a task version of an upstream task that needs to be invoked when the target task is executed, in response to the second output.
In an embodiment, the processor 510 is configured to determine, in the task instances to be executed, a target task instance whose running time is less than the current time every preset time; and after the target task instance is successfully operated, updating the information of the task version corresponding to the target task instance.
In one embodiment, the processor 510 is configured to, in a case where it is determined that the task version of the upstream task is not successfully executed, suspend the execution of the target task until the task version of the upstream task is successfully executed; determining missing task versions which are not successfully operated in the task versions of the upstream task; and sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
In an embodiment, the input unit 504 is configured to receive a third input of data repair performed on the target task by the user;
a processor 510, configured to, in response to the third input, obtain a task dependency relationship and task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed; re-executing the target task based on the task dependency upon determining that the task execution information does not conform to the task dependency.
Fig. 6 illustrates a physical structure diagram of an electronic device, which may include, as shown in fig. 6: a processor (processor)610, a communication Interface (Communications Interface)620, a memory (memory)630 and a communication bus 640, wherein the processor 610, the communication Interface 620 and the memory 630 communicate with each other via the communication bus 640. The processor 610 may invoke logic instructions in the memory 630 to perform a task scheduling method comprising: receiving an execution input for a target task; responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task; executing the target task upon determining that a task version of an upstream task has run successfully.
In addition, the logic instructions in the memory 630 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, the present invention also provides a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions, which when executed by a computer, enable the computer to perform a task scheduling method provided by the above methods, the method comprising: receiving an execution input for a target task; responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task; executing the target task upon determining that a task version of an upstream task has run successfully.
In yet another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor is implemented to perform the task scheduling method provided above, the method comprising: receiving an execution input for a target task; responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task; executing the target task upon determining that a task version of an upstream task has run successfully.
The embodiment of the present invention further provides a chip, where the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is configured to run a program or an instruction to implement each process of the task scheduling method embodiment, and can achieve the same technical effect, and no further description is given here to avoid repetition.
It should be understood that the chips mentioned in the embodiments of the present invention may also be referred to as a system-on-chip, a system-on-chip or a system-on-chip, etc.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention 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 solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for task scheduling, comprising:
receiving an execution input for a target task;
responding to the execution input, and acquiring a task dependency relationship of the target task; the task dependency relationship comprises task version information of an upstream task which needs to be called by the target task;
executing the target task upon determining that a task version of an upstream task has run successfully.
2. The task scheduling method of claim 1, further comprising, prior to said receiving an execution input for a target task:
receiving a first input of a user for establishing a target task;
in response to the first input, adding the target task;
receiving a second input of the task dependency relationship of the user on the target task;
and responding to the second input, and adding a task version of an upstream task required to be called when the target task is executed for the target task.
3. The task scheduling method according to claim 1, wherein the task version of the upstream task comprises: time information when the upstream task executes.
4. The task scheduling method of claim 1, further comprising, prior to said receiving an execution input for a target task:
determining a target task instance with the running time less than the current time in task instances to be executed at intervals of preset time;
and after the target task instance is successfully operated, updating the information of the task version corresponding to the target task instance.
5. The task scheduling method according to claim 1, further comprising, after acquiring the task dependency of the target task in response to the execution input:
under the condition that the task version of the upstream task is determined not to run successfully, the running of the target task is suspended until the task version of the upstream task runs successfully;
determining missing task versions which are not successfully operated in the task versions of the upstream task;
and sending reminding information that the missing task version needs to be operated based on the reserved communication information of the upstream task.
6. The task scheduling method according to any one of claims 1 to 5, further comprising:
receiving a third input of the user for data restoration of the target task;
responding to the third input, and acquiring task dependency relationship and task execution information of the target task; wherein the task execution information includes: a task version of an upstream task used when the target task is executed;
re-executing the target task based on the task dependency upon determining that the task execution information does not conform to the task dependency.
7. A task scheduling apparatus, comprising:
an execution input module for receiving an execution input for a target task;
a relationship obtaining module, configured to obtain a task dependency relationship of the target task in response to the execution input; the task dependency relationship comprises a task version of an upstream task which needs to be called by the target task;
and the task execution module is used for executing the target task under the condition that the task version of the upstream task is determined to be successfully operated.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the task scheduling method according to any of claims 1 to 6 are implemented when the processor executes the program.
9. A non-transitory computer readable storage medium, having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the task scheduling method according to any one of claims 1 to 6.
10. A computer program product comprising computer programs/instructions, characterized in that said computer programs/instructions, when executed by a processor, implement the steps of the task scheduling method according to any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110891794.5A CN113806038A (en) | 2021-08-04 | 2021-08-04 | Task scheduling method, device, electronic equipment, storage medium and program product |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110891794.5A CN113806038A (en) | 2021-08-04 | 2021-08-04 | Task scheduling method, device, electronic equipment, storage medium and program product |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113806038A true CN113806038A (en) | 2021-12-17 |
Family
ID=78893282
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110891794.5A Pending CN113806038A (en) | 2021-08-04 | 2021-08-04 | Task scheduling method, device, electronic equipment, storage medium and program product |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113806038A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114610473A (en) * | 2022-05-11 | 2022-06-10 | 恒生电子股份有限公司 | Task processing method and device and nonvolatile storage medium |
| WO2023213118A1 (en) * | 2022-05-06 | 2023-11-09 | 北京快乐茄信息技术有限公司 | Task scheduling method and apparatus, and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105117286A (en) * | 2015-09-22 | 2015-12-02 | 北京大学 | Task scheduling and pipelining executing method in MapReduce |
| CN110780981A (en) * | 2018-07-31 | 2020-02-11 | 北京科杰信息技术有限公司 | Task scheduling management system and method for hadoop big data platform |
| CN112559161A (en) * | 2021-02-19 | 2021-03-26 | 北京搜狐新媒体信息技术有限公司 | Task scheduling method and system |
| CN113094162A (en) * | 2021-04-09 | 2021-07-09 | 中国工商银行股份有限公司 | Task dependency relationship updating method and device and storage medium |
-
2021
- 2021-08-04 CN CN202110891794.5A patent/CN113806038A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105117286A (en) * | 2015-09-22 | 2015-12-02 | 北京大学 | Task scheduling and pipelining executing method in MapReduce |
| CN110780981A (en) * | 2018-07-31 | 2020-02-11 | 北京科杰信息技术有限公司 | Task scheduling management system and method for hadoop big data platform |
| CN112559161A (en) * | 2021-02-19 | 2021-03-26 | 北京搜狐新媒体信息技术有限公司 | Task scheduling method and system |
| CN113094162A (en) * | 2021-04-09 | 2021-07-09 | 中国工商银行股份有限公司 | Task dependency relationship updating method and device and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023213118A1 (en) * | 2022-05-06 | 2023-11-09 | 北京快乐茄信息技术有限公司 | Task scheduling method and apparatus, and device |
| CN114610473A (en) * | 2022-05-11 | 2022-06-10 | 恒生电子股份有限公司 | Task processing method and device and nonvolatile storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3842948A2 (en) | Method and apparatus for testing edge computing, device, and readable storage medium | |
| CN108804215B (en) | Task processing method and device and electronic equipment | |
| CN109117141B (en) | Method, device, electronic equipment and computer readable storage medium for simplifying programming | |
| CN113806038A (en) | Task scheduling method, device, electronic equipment, storage medium and program product | |
| US8914798B2 (en) | Production control for service level agreements | |
| CN115328759A (en) | Form verification method and device | |
| CN116701053A (en) | Method, device, equipment and medium for restoring data backup of production environment database | |
| CN115421728A (en) | Business code generation method and device, electronic equipment and storage medium | |
| CN115766697A (en) | File downloading method, device, equipment and storage medium | |
| CN114693116A (en) | Method and device for detecting code review validity and electronic equipment | |
| CN113971074A (en) | Transaction processing method and device, electronic equipment and computer readable storage medium | |
| CN109783134B (en) | Front-end page configuration method and device and electronic equipment | |
| CN113656239A (en) | Monitoring method and device for middleware and computer program product | |
| CN112561558A (en) | Express time portrait generation method, generation device, equipment and storage medium | |
| CN111881025A (en) | Automatic test task scheduling method, device and system | |
| CN115525521A (en) | Log data verification method and device, electronic equipment, storage medium and product | |
| CN110674201A (en) | Method and device for checking enterprise credit worthiness calling condition | |
| CN116975200A (en) | Method, device, equipment and medium for controlling working state of server | |
| CN115238212A (en) | Page designated element detection and replacement method, device, equipment and storage medium | |
| CN117520299A (en) | Data processing method, device, equipment and medium during migration of financial system | |
| CN114860312A (en) | Mobile terminal adaptation method, device, equipment and medium based on credit business | |
| CN115454800A (en) | Log data verification method and device, electronic equipment, storage medium and product | |
| CN115934550A (en) | Test method, test device, electronic equipment and storage medium | |
| CN113076320A (en) | Method, device, equipment and computer readable medium for configuring data table | |
| CN117827344A (en) | Unified reminding method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |