CN109634728B - Job scheduling method and device, terminal equipment and readable storage medium - Google Patents

Job scheduling method and device, terminal equipment and readable storage medium Download PDF

Info

Publication number
CN109634728B
CN109634728B CN201811364934.8A CN201811364934A CN109634728B CN 109634728 B CN109634728 B CN 109634728B CN 201811364934 A CN201811364934 A CN 201811364934A CN 109634728 B CN109634728 B CN 109634728B
Authority
CN
China
Prior art keywords
task
scheduling
node
information
execution
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.)
Active
Application number
CN201811364934.8A
Other languages
Chinese (zh)
Other versions
CN109634728A (en
Inventor
张球龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Yunzhirong Technology Co ltd
Original Assignee
Shenzhen Yunzhirong Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Yunzhirong Technology Co ltd filed Critical Shenzhen Yunzhirong Technology Co ltd
Priority to CN201811364934.8A priority Critical patent/CN109634728B/en
Publication of CN109634728A publication Critical patent/CN109634728A/en
Application granted granted Critical
Publication of CN109634728B publication Critical patent/CN109634728B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/3003Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/3017Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is implementing multitasking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/30Monitoring
    • G06F11/32Monitoring with visual or acoustical indication of the functioning of the machine
    • G06F11/323Visualisation of programs or trace data

Abstract

The invention is suitable for the technical field of job scheduling, and provides a job scheduling method, a job scheduling device, terminal equipment and a readable storage medium, wherein the job scheduling method comprises the steps of acquiring scheduling task information corresponding to a timing task from a preset task table according to an identifier of the timing task when a trigger timing task is detected; acquiring task node information matched with the scheduling task information from a preset task node table; generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information; sequentially executing the scheduling instruction of each task node based on the execution sequence of all task nodes; and displaying and managing the timing task in execution and the execution state of each task node of the timing task. By the method and the system, developers only need to concentrate on writing the logical codes of the job tasks, do not need to care about the development work of the timed scheduling tasks, and simultaneously do not need to care about the test and version release of the scheduling part for both testing and operation and maintenance, thereby greatly saving the work of development, testing, operation and maintenance and the like.

Description

Job scheduling method and device, terminal equipment and readable storage medium
Technical Field
The invention belongs to the technical field of job scheduling, and particularly relates to a job scheduling method, a job scheduling device, terminal equipment and a readable storage medium.
Background
With the continuous expansion of the existing services, the number of transaction parties is continuously increased, the system scale is larger and larger, the services are more and more complex, and the data volume is rapidly increased, so that for a team with a small scale, a scheduling system is required to be configured with a large number of timing scheduling tasks to realize the automatic processing of events, but the existing system has the following defects: 1) the method has the advantages that visual pages are not available, dynamic addition, modification or offline operation tasks cannot be achieved, and a new version needs to be released every time modification is carried out; 2) the operation tasks are strongly coupled with the service codes, so that great repeated workload is brought to development, test, operation and maintenance, and the management of the operation tasks is inconvenient; 3) the monitoring of the running condition of each task and the troubleshooting of abnormal problems are very complex and time-consuming.
Disclosure of Invention
In view of this, embodiments of the present invention provide a job scheduling method, an apparatus, a terminal device, and a readable storage medium, and aim to solve the problem that a scheduling system in the prior art has no visual scheduling page and cannot operate a scheduling task without modifying a software version.
A first aspect of an embodiment of the present invention provides a job scheduling method, including:
when a timing task is detected to be triggered, acquiring scheduling task information corresponding to the timing task from a preset task table according to an identifier of the timing task;
task node information matched with the scheduling task information is obtained from a preset task node table;
generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes;
and displaying and managing the timing task in execution and the execution state of each task node of the timing task.
A second aspect of an embodiment of the present invention provides a job scheduling apparatus, including:
the acquisition unit is used for acquiring scheduling task information corresponding to the timing task from a preset task table according to the identifier of the timing task and acquiring task node information matched with the scheduling task information from the preset task node table when the triggering of the timing task is detected;
the generating unit is used for generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
the execution unit is used for sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes;
and the management unit is used for displaying and managing the timing task in execution and the execution state of each task node of the timing task.
A third aspect of the embodiments of the present invention provides a terminal device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the job scheduling method provided in the first aspect when executing the computer program.
A fourth aspect of the embodiments of the present invention provides a readable storage medium, which stores a computer program that, when executed by a processor, implements the steps of the job scheduling method provided in the first aspect.
Compared with the prior art, the embodiment of the invention has the following beneficial effects:
the invention realizes the on-line checking of the timing tasks, the suspension and the off-line of the timing tasks and can edit and newly add the timing tasks by displaying and managing the timing tasks in execution and the execution conditions of each task node of the timing tasks; through the task batch table and the task node batch table, history checking can be performed, and the execution state of each timing task in each task node can be checked. Meanwhile, the invention also supports the scheduling of various protocol tasks and the scheduling modes of single node, serial node tasks and the like.
By the method and the system, developers only need to concentrate on writing the logical codes of the job tasks, do not need to care about the development work of the timed scheduling tasks, and simultaneously do not need to care about the test and version release of the scheduling part in both test and operation and maintenance. The work of development, test, operation and maintenance and the like is greatly saved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating a job scheduling method according to a first embodiment of the present invention;
fig. 2 is a schematic detailed flow diagram of S105 in the job scheduling method according to the embodiment of the present invention;
fig. 3 is a flowchart illustrating a job scheduling method according to a second embodiment of the present invention;
fig. 4 is a flowchart illustrating a job scheduling method according to a third embodiment of the present invention;
fig. 5 is a flowchart illustrating a job scheduling method according to a fourth embodiment of the present invention;
fig. 6 is a schematic system structure diagram of a job scheduling apparatus according to a first embodiment of the present invention;
fig. 7 is a schematic system configuration diagram of a job scheduling apparatus according to a second embodiment of the present invention;
FIG. 8 is a schematic diagram of a system configuration of a job scheduling apparatus according to a third embodiment of the present invention
Fig. 9 is a schematic diagram of a hardware structure of a terminal device according to an embodiment of the present invention.
Detailed Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
In the embodiment of the present invention, the main execution body of the process is a terminal device, and the terminal device includes, but is not limited to, a notebook computer, a server, a tablet computer, a smart phone, and the like.
In order to explain the technical means of the present invention, the following description will be given by way of specific examples.
Fig. 1 is a flowchart illustrating a job scheduling method according to a first embodiment of the present invention, where an execution subject of the job scheduling method is a terminal device, and the detailed description is as follows:
s101: when a timing task is detected to be triggered, acquiring scheduling task information corresponding to the timing task from a preset task table according to an identifier of the timing task;
in this embodiment, a job scheduling application is provided in the terminal device, the job scheduling application includes a human-computer interaction module and a scheduling module, and an operator interacts with the scheduling module through the human-computer interaction module. The scheduling module is used for scheduling execution of each task, interacting with the third-party operating system and acquiring operating condition information of the third-party operating system. The job scheduling application program also comprises a database, wherein a task table and a task node table are preset in the database, and the task table is used for storing scheduling task information of all timing tasks, such as time expressions, execution processing types and the like. It can be understood that an execution plan module is arranged in the scheduling module, and when the job scheduling application program is started, the execution plan module loads all timing tasks in the database and stores the timing tasks in a plan task list, monitors the execution time of each task, and triggers the execution of the timing tasks according to the execution sequence of each task.
In this embodiment, the job scheduling application is developed based on the quartz timed task framework and the rabbitMQ asynchronous message queue. Schedule job () based on the quartz framework puts timed task loads in the database into the execution plan module at application startup. And when the execution planning module triggers the timing task, a triggering instruction is sent out, and when the triggering instruction triggering the timing task is detected, an execution processor in quartz acquires the identifier of the timing task and acquires scheduling task information corresponding to the timing task from a preset task table.
For example, the task a and the scheduling task information corresponding to the task a are stored in the database, and when the application program is started, the execution planning module loads the task a from the database and detects the trigger time of the task a in real time. When the triggering time of the task A is reached, the execution planning module triggers the task A, and the execution processor acquires scheduling task information corresponding to the task A from a task table in the database according to the identification of the task A.
S102: task node information matched with the scheduling task information is obtained from a preset task node table;
and after the scheduling task information corresponding to the timing task is acquired from the task table in the database according to the identifier of the timing task, continuing to acquire the task node information matched with the scheduling task information from the task node table in the database. The task node tables are used for storing node information corresponding to each task table, such as scheduling modes of the task nodes, father nodes of the task nodes, child nodes of the task nodes, calling parameters of the nodes and the like.
The task A comprises three task nodes, namely a node a1, a node a2 and a node a3, and can be completed only by executing the three task nodes. After acquiring the scheduling task information corresponding to the task a from the task table, the execution processor continues to acquire the three pieces of task node information of the task a, i.e., the scheduling information and the execution order of the node a1, the node a2, the node a3, and each node, from the task node table.
S103: generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
and the execution processor generates a scheduling instruction of the timing task at each task node according to the acquired scheduling task information and the task node information. After acquiring the scheduling task information of the task A and the task node information of the node a1, the node a2 and the node a3, the execution processor generates scheduling instructions of three task nodes, namely the node a1, the node a2 and the node a 3.
S104: and sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes.
And executing the scheduling instruction of each task node according to the execution sequence of each task node of the timing task so as to complete the timing task. It should be noted that the scheduling instruction may be sent to the third-party operating system by the terminal device, and executed by the third-party operating system, or the scheduling instruction may be executed by the terminal device.
S105: and displaying and managing the timing task in execution and the execution state of each task node of the timing task.
In order to realize the visualization of the timing tasks, a certain timing task is newly added, modified, suspended or offline online. And displaying and managing the timing task in execution and the execution state of each task node of the timing task through a man-machine interaction module. In this embodiment, the job scheduling application further includes an instruction sending module, and after the scheduling instruction of each task node is generated, the scheduling instruction is stored in the message queue, and is sent to the corresponding third-party job system by the instruction sending module according to the scheduling information included in the scheduling instruction. Meanwhile, the job scheduling application program further comprises an instruction result receiving module, wherein the instruction result receiving module is used for receiving an instruction execution result fed back by the third-party job system and correspondingly storing the execution state information of the timing task and the execution state information of each task node corresponding to the timing task in the database according to the instruction execution result.
Meanwhile, the timing task in execution and the execution condition of each task node of the timing task are obtained from the execution planning module through an operation interface between the man-machine interaction module and the scheduling module and are displayed on the man-machine interaction interface. In the embodiment, a group map component. And through the selection operation of the human-computer interaction interface, the task in the execution planning module is checked and maintained (such as suspension, failure, manual triggering and the like) by using a scheduler tool class of quartz.
In addition, timing tasks and various task nodes can be acquired from a task table and a task node table in a database through an operation interface between a man-machine interaction module and a scheduling module based on a group dispatcher.
In this embodiment, by presetting a task table and a task node table in a database, when timing task information is detected, scheduling task information is determined according to the preset task table, task node information matched with the scheduling task information is acquired according to the preset task node table, a scheduling instruction of each task node is generated, and the scheduling instruction is executed based on an execution sequence of each task node. Meanwhile, the timing tasks in execution and the execution states of all task nodes of the timing tasks can be displayed and managed, and the functions of checking the timing tasks, pausing, offline all timing tasks, editing and adding new timing tasks on line are achieved. By the method and the system, developers only need to concentrate on writing the logical codes of the job tasks, do not need to care about the development work of the timed scheduling tasks, and simultaneously do not need to care about the test and version release of the scheduling part for both testing and operation and maintenance, thereby greatly saving the work of development, testing, operation and maintenance and the like.
Fig. 2 is a detailed flowchart of S105 in the first embodiment of the job scheduling method of the present invention, which is detailed as follows:
s1051: acquiring operation condition information of a third-party operation system, and displaying the timing task in execution and the execution condition of each task node of the timing task based on the operation condition information;
s1052: and configuring the scheduling task information and the task node information according to the displayed execution conditions of the timing task and each task node of the timing task in execution, so that the execution conditions of the timing task in execution and each task node of the timing task are matched with the scheduling task information and the task node information.
In this embodiment, the execution status of the timing task and each task node in execution shown on the human-computer interaction interface includes the job status information of the third-party job system, and since the job status information of the third-party job system can reflect the execution status of the corresponding timing task, an operator can know whether the task is successfully completed or not, and when the task is not successfully completed or the execution result is not the target execution result, the scheduling task information and the task node information corresponding to the timing task are reconfigured, so that the execution status of each task node corresponding to the timing task and the timing task is matched with the reconfigured scheduling task information and task node information, and errors occurring in the task execution process are corrected.
Fig. 3 is a flowchart illustrating a job scheduling method according to a second embodiment of the present invention, including S201 to S207, where the contents of S203 to S207 are the same as those of S101 to S105, which are not repeated herein, and S201 and S202 are detailed as follows:
s201: establishing the task table based on the scheduling task information, wherein the scheduling task information comprises task identification, running time and a running mode:
s202: and establishing the task node table based on the task node information, wherein the task node information comprises a node identifier, a node task, a scheduling mode and a calling function.
It will be appreciated that the task table and task node table are built into the data prior to the execution of the timed task. The task table stores a plurality of timing tasks and scheduling task information corresponding to each timing task, wherein the scheduling task information comprises a task identifier, running time and a running mode, and the task identifier is used for identifying and searching the timing tasks. The task node table stores node identification, node tasks, scheduling modes and calling functions. When the task table and the task node table are established, the task table is established according to information such as task identification, running time and running mode contained in preset scheduling task information, and the task node table is established according to information such as node identification, node tasks, scheduling tasks and calling functions contained in the preset task node information. The node identification is used for searching the task node and providing the execution sequence of the task node, and the node task is used for indicating the specific task of the current node.
Fig. 4 is a flowchart illustrating a job scheduling method according to a third embodiment of the present invention, including S301 to S306, where S301 to S304 are the same as S101 to S104, and S306 is the same as S105, which are not described herein again, and S305 is further included after S304, which is detailed as follows:
s305: storing the execution status information of the timed task to a task batch table, and storing the execution status information of the timed task at each task node to a task node batch table; the execution status information of the timed task and the execution status information of the timed task at each task node comprise the job status information of a third-party job system.
In this embodiment, after the scheduling instruction of each task node is executed according to the execution sequence of the task nodes, the execution status information of the timed task is stored in the task batch table, and the execution status information of the timed task at each task node is stored in the task node batch table to record the execution state of the current timed task, so as to know whether the timed task is executed. It should be noted that the execution status information of the timing task and the task node includes an execution status and a feedback result, where the execution status indicates whether the instruction sending module has sent the corresponding scheduling instruction to the third-party operating system, and the feedback result indicates the job status information of the task after the third-party operating system receives the corresponding scheduling instruction, that is, the execution result. The progress and the state of each task can be clearly reflected by setting the task batch table and the task node batch table.
For example, after the instruction sending module sends the scheduling instructions of the three task nodes, namely the node a1, the node a2 and the node a3, of the task a to the third-party operating system, the instruction sending module records that the task a, the node a1, the node a2 and the node a3 are executed and sent successfully or failed correspondingly in the column of the execution state in the task batch table and the task node batch table; after receiving the dispatching command of each task node, the third-party operating system feeds back the execution result to the dispatching system, and records that the task a, the node a1, the node a2 and the node a3 are corresponding to the execution status column in the task batch table and the task node batch table as the execution success or the execution failure. The successful execution indicates that the third-party operating system successfully executes the current task node, and the failure execution marks that the third-party operating system does not successfully execute the current task node.
Fig. 5 is a schematic flow chart of a job scheduling method in a fourth embodiment of the present invention, including S401 to S405, where the contents of S401 to S403 are the same as S101 to S103, S405 is the same as S105, and are not repeated here, and S404 is a refinement flow of S104, which is detailed as follows:
s404: and executing the scheduling instructions of the timed tasks at each task node in a parallel or serial scheduling mode.
In the embodiment, the scheduling instructions of the timed tasks at the task nodes are executed according to a parallel or serial scheduling mode. When the scheduling instructions are executed according to the parallel scheduling mode, the scheduling instructions of the plurality of task nodes are executed simultaneously. When the scheduling instructions are executed according to the serial scheduling mode, the scheduling instructions of the plurality of task nodes are executed according to the execution sequence.
It should be understood that, the sequence numbers of the steps in the foregoing embodiments do not imply an execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
Fig. 6 is a schematic system configuration diagram of a job scheduling apparatus 5 according to a first embodiment of the present invention, including:
an obtaining unit 51, configured to, when a trigger timing task is detected, obtain scheduling task information corresponding to the timing task from a preset task table according to an identifier of the timing task, and obtain task node information matched with the scheduling task information from the preset task node table;
a generating unit 52, configured to generate a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
the execution unit 53 is configured to sequentially execute the scheduling instruction of each task node based on the execution sequence of all task nodes;
the management unit 54 is configured to show and manage the timing task during execution and the execution status of each task node of the timing task.
Fig. 7 is a schematic structural diagram of a second embodiment of the job scheduling apparatus 5 according to the present invention, wherein the job scheduling apparatus 5 further includes:
the establishing unit 55 is configured to establish the task table based on the scheduling task information before acquiring scheduling task information corresponding to the timing task from a preset task table according to the identifier of the timing task, and establish the task node table based on the task node information, where the scheduling task information includes a task identifier, an operation time, and an operation mode, and the task node information includes a node identifier, a node task, a scheduling mode, and a call function.
Fig. 8 is a schematic structural diagram of a third embodiment of the job scheduling apparatus 5 according to the present invention, wherein the job scheduling apparatus 5 further includes:
a saving unit 56, configured to, after the scheduling instruction of each task node is sequentially executed, save the execution status information of the timed task to a task batch table, and save the execution status information of the timed task at each task node to a task node batch table; wherein the execution status information of the timed task and the execution status information of the timed task at each task node comprise job status information of a third-party job system
Further, the management unit 54 is further configured to:
acquiring operation condition information of a third-party operation system, and displaying the timing task in execution and the execution condition of each task node of the timing task based on the operation condition information;
and configuring the scheduling task information and the task node information according to the displayed execution conditions of the timing task and each task node of the timing task in execution, so that the execution conditions of the timing task in execution and each task node of the timing task are matched with the scheduling task information and the task node information.
Further, the execution unit 3 is further configured to execute the scheduling instruction of the timed task at each task node in a parallel or serial scheduling mode.
Fig. 9 is a schematic diagram of a terminal device according to an embodiment of the present invention. As shown in fig. 9, the terminal device 6 of this embodiment includes: a processor 60, a memory 61 and a computer program 62, such as a data display program, stored in said memory 61 and executable on said processor 60. The processor 60, when executing the computer program 62, implements the steps in the various job scheduling method embodiments described above, such as steps 101 to 104 shown in fig. 1. Alternatively, the processor 60, when executing the computer program 62, implements the functions of the modules/units in the above-mentioned device embodiments, such as the functions of the units 51 to 56 shown in fig. 6.
Illustratively, the computer program 62 may be partitioned into one or more modules/units that are stored in the memory 61 and executed by the processor 60 to implement the present invention. The one or more modules/units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program 62 in the terminal device 6. For example, the computer program 62 may be divided into an acquisition module, a generation module, an execution module, and a management module (module in a virtual device), and each module has the following specific functions:
the acquisition module is used for acquiring scheduling task information corresponding to the timing task from a preset task table according to the identifier of the timing task and acquiring task node information matched with the scheduling task information from the preset task node table when the triggering of the timing task is detected;
the generating module is used for generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
the execution module is used for sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes;
and the management module is used for displaying and managing the timing task in execution and the execution state of each task node of the timing task.
The terminal device 6 may be a desktop computer, a notebook, a palm computer, a cloud server, or other computing devices. The terminal device may include, but is not limited to, a processor 60, a memory 61. Those skilled in the art will appreciate that fig. 9 is merely an example of a terminal device 6 and does not constitute a limitation of terminal device 6 and may include more or fewer components than shown, or some components may be combined, or different components, for example, the terminal device may also include input output devices, network access devices, buses, etc.
The Processor 60 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 61 may be an internal storage unit of the terminal device 6, such as a hard disk or a memory of the terminal device 6. The memory 61 may also be an external storage device of the terminal device 6, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are provided on the terminal device 6. Further, the memory 61 may also include both an internal storage unit and an external storage device of the terminal device 6. The memory 61 is used for storing the computer program and other programs and data required by the terminal device. The memory 61 may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present invention, it should be understood that the disclosed terminal device and method may be implemented in other ways. For example, the above-described terminal device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical function division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
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 units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a readable storage medium and used by a processor to implement the steps of the above-described embodiments of the method. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; 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; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.

Claims (9)

1. A job scheduling method, comprising:
when a timing task is detected to be triggered, acquiring scheduling task information corresponding to the timing task from a preset task table according to an identifier of the timing task;
task node information matched with the scheduling task information is obtained from a preset task node table;
generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes;
displaying and managing the timing task in execution and the execution state of each task node of the timing task;
the displaying and managing the timing task in execution and the execution status of each task node of the timing task includes:
acquiring operation condition information of a third-party operation system, and displaying the timing task in execution and the execution condition of each task node of the timing task based on the operation condition information;
and configuring the scheduling task information and the task node information according to the displayed execution conditions of the timing task and each task node of the timing task in execution, so that the execution conditions of the timing task in execution and each task node of the timing task are matched with the scheduling task information and the task node information.
2. The job scheduling method according to claim 1, wherein before acquiring scheduling task information corresponding to the timing task from a preset task table according to an identifier of the timing task when the triggering of the timing task is detected, the method further comprises:
establishing the task table based on the scheduling task information, wherein the scheduling task information comprises a task identifier, running time and a running mode;
and establishing the task node table based on the task node information, wherein the task node information comprises a node identifier, a node task, a scheduling mode and a calling function.
3. The job scheduling method according to claim 1 or 2, wherein after the sequentially executing the scheduling instruction of each task node based on the execution order of all the task nodes, the method further comprises:
storing the execution status information of the timed task to a task batch table, and storing the execution status information of the timed task at each task node to a task node batch table; the execution status information of the timed task and the execution status information of the timed task at each task node comprise the job status information of a third-party job system.
4. The job scheduling method according to claim 1, wherein the sequentially executing the scheduling instruction of each task node based on the execution order of all the task nodes comprises:
and executing the scheduling instructions of the timed tasks at each task node in a parallel or serial scheduling mode.
5. A job scheduling apparatus, characterized by comprising:
the acquisition unit is used for acquiring scheduling task information corresponding to the timing task from a preset task table according to the identifier of the timing task and acquiring task node information matched with the scheduling task information from the preset task node table when the triggering of the timing task is detected;
the generating unit is used for generating a scheduling instruction of the timing task at each task node according to the scheduling task information and the task node information;
the execution unit is used for sequentially executing the scheduling instruction of each task node based on the execution sequence of all the task nodes;
the management unit is used for displaying and managing the timing task in execution and the execution state of each task node of the timing task;
the management unit is further configured to acquire job status information of a third-party job system, and show the timing task in execution and the execution status of each task node of the timing task based on the job status information;
and configuring the scheduling task information and the task node information according to the displayed execution conditions of the timing task and each task node of the timing task in execution, so that the execution conditions of the timing task in execution and each task node of the timing task are matched with the scheduling task information and the task node information.
6. The job scheduling apparatus according to claim 5, further comprising:
the establishing unit is used for establishing the task table based on the scheduling task information before acquiring the scheduling task information corresponding to the timing task from a preset task table according to the identifier of the timing task, and establishing the task node table based on the task node information, wherein the scheduling task information comprises a task identifier, running time and a running mode, and the task node information comprises a node identifier, a node task, a scheduling mode and a calling function.
7. The job scheduling device according to claim 5 or 6, further comprising:
the storage unit is used for storing the execution status information of the timed task to a task batch table after the dispatching instruction of each task node is executed in sequence, and storing the execution status information of the timed task at each task node to a task node batch table; the execution status information of the timed task and the execution status information of the timed task at each task node comprise the job status information of a third-party job system.
8. A terminal device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any of claims 1 to 4 when executing the computer program.
9. A readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 4.
CN201811364934.8A 2018-11-16 2018-11-16 Job scheduling method and device, terminal equipment and readable storage medium Active CN109634728B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811364934.8A CN109634728B (en) 2018-11-16 2018-11-16 Job scheduling method and device, terminal equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811364934.8A CN109634728B (en) 2018-11-16 2018-11-16 Job scheduling method and device, terminal equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN109634728A CN109634728A (en) 2019-04-16
CN109634728B true CN109634728B (en) 2021-02-23

Family

ID=66068228

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811364934.8A Active CN109634728B (en) 2018-11-16 2018-11-16 Job scheduling method and device, terminal equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN109634728B (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110058930A (en) * 2019-04-18 2019-07-26 中国联合网络通信集团有限公司 Method for scheduling task and equipment
CN110597605A (en) * 2019-08-13 2019-12-20 武汉联影医疗科技有限公司 Job scheduling method and device, computer equipment and readable storage medium
CN110532114B (en) * 2019-09-04 2022-06-14 浪潮云信息技术股份公司 Timed task management system and distribution method based on message queue
CN110569257B (en) * 2019-09-16 2022-04-01 上海达梦数据库有限公司 Data processing method, corresponding device, equipment and storage medium
CN111026526B (en) * 2019-11-12 2024-01-30 珠海格力电器股份有限公司 Timer configuration method and device for program, storage medium and terminal equipment
CN111061518A (en) * 2019-11-18 2020-04-24 智器云南京信息科技有限公司 Data processing method, system, terminal device and storage medium based on drive node
CN111026530A (en) * 2019-11-29 2020-04-17 珠海随变科技有限公司 Task scheduling method and device, computer equipment and storage medium
CN111160873B (en) * 2019-12-31 2023-08-22 中国银行股份有限公司 Running batch processing device and method based on distributed architecture
CN111830895B (en) * 2020-07-14 2022-03-15 上海海得自动化控制软件有限公司 Data scheduling method, medium, PLC device and scheduling system based on PLC array
CN112150262B (en) * 2020-09-29 2023-09-19 中国银行股份有限公司 Account checking data processing method and device
CN112445597B (en) * 2020-11-27 2024-02-02 中国工商银行股份有限公司 Timing task scheduling method and device
CN112910952B (en) * 2021-01-13 2022-08-23 叮当快药科技集团有限公司 Distributed task scheduling method and device, storage medium and electronic device
CN113760529A (en) * 2021-01-15 2021-12-07 北京沃东天骏信息技术有限公司 Interface execution method, device, equipment and readable storage medium
CN112925622A (en) * 2021-02-26 2021-06-08 北信源系统集成有限公司 System timing task processing method and device, electronic equipment and storage medium
CN112988355B (en) * 2021-03-31 2023-12-15 深圳市优必选科技股份有限公司 Program task scheduling method and device, terminal equipment and readable storage medium
CN117193990B (en) * 2023-11-08 2024-02-23 建信金融科技有限责任公司 Scheduling management method, device, equipment and storage medium of http interface

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106874094A (en) * 2017-02-17 2017-06-20 广州爱九游信息技术有限公司 timed task processing method, device and computing device

Also Published As

Publication number Publication date
CN109634728A (en) 2019-04-16

Similar Documents

Publication Publication Date Title
CN109634728B (en) Job scheduling method and device, terminal equipment and readable storage medium
CN108600029B (en) Configuration file updating method and device, terminal equipment and storage medium
CN104252481A (en) Dynamic check method and device for consistency of main and salve databases
JPWO2008146677A1 (en) Virtual machine management apparatus, virtual machine management method, and virtual machine management program
CN113220431B (en) Cross-cloud distributed data task scheduling method, device and storage medium
CN106126403A (en) Oracle database failure analysis methods and device
CN104615486B (en) For searching for the multi-task scheduling of Extension Software Platform and executing methods, devices and systems
CN112115044A (en) Automatic testing method and system for electric power information communication equipment
CN112631919A (en) Comparison test method and device, computer equipment and storage medium
CN110569154B (en) Chip interface function testing method, system, terminal and storage medium
CN113658351B (en) Method and device for producing product, electronic equipment and storage medium
CN112559525B (en) Data checking system, method, device and server
CN110868330B (en) Evaluation method, device and evaluation system for CPU resources which can be divided by cloud platform
CN115729679A (en) Task processing method and device, computer readable storage medium and electronic device
CN114996081A (en) Batch job progress monitoring method and device, electronic equipment and storage medium
CN115617480A (en) Task scheduling method, device and system and storage medium
CN112367205B (en) Processing method and scheduling system for HTTP scheduling request
CN114675930A (en) Host computer simulation communication instrument
CN113535560A (en) Test execution method and device, storage medium and computing equipment
CN113434382A (en) Database performance monitoring method and device, electronic equipment and computer readable medium
CN112650815A (en) Method and device for synchronizing environmental data, storage medium and electronic device
CN112070391A (en) Workshop production task management system, method and device
JP2010224812A (en) Job management system and method
CN110113181A (en) Node configuration method, device, computer installation and readable storage medium storing program for executing
CN112950138B (en) Collaborative development state management method, device and server

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
GR01 Patent grant
GR01 Patent grant