CN110633914A - Batch job scheduling processing method and device - Google Patents
Batch job scheduling processing method and device Download PDFInfo
- Publication number
- CN110633914A CN110633914A CN201910892275.3A CN201910892275A CN110633914A CN 110633914 A CN110633914 A CN 110633914A CN 201910892275 A CN201910892275 A CN 201910892275A CN 110633914 A CN110633914 A CN 110633914A
- Authority
- CN
- China
- Prior art keywords
- job
- jobs
- execution
- scheduling
- state
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 19
- 230000001960 triggered effect Effects 0.000 claims abstract description 14
- 238000004590 computer program Methods 0.000 claims description 14
- 238000010586 diagram Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000000547 structure data Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Accounting & Taxation (AREA)
- Educational Administration (AREA)
- Technology Law (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a batch job scheduling processing method and a device, wherein the method comprises the following steps: obtaining an execution status tag of each of a plurality of jobs and execution sequence data of the plurality of jobs, wherein the execution status tag is: an executed state tag or an unexecuted state tag; determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data; scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label: determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label. The method and the device can realize accurate scheduling of batch operation, correspond to the actual operation condition, avoid the problem that the operation is started when the follow-up operation is not completed in the prior operation, and ensure the normal operation of the system.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a batch job scheduling processing method and device.
Background
At present, the distributed batch Job scheduling of the core bank X86 system adopts an Elastic-Job-Lite framework to set the time for starting execution of each Job, and then the Job is scheduled and executed in sequence according to the timing sequence of each Job. However, the method cannot accurately correspond to the actual operation condition, the problems that the subsequent operation starts after the previous operation is not completed easily occur, the scheduling accuracy of the batch operation is low, and the normal operation of the system is seriously influenced.
Disclosure of Invention
The embodiment of the invention provides a batch job scheduling processing method, which is used for realizing accurate scheduling of batch jobs, avoiding the problem that the subsequent jobs begin to run without being completed by the previous jobs corresponding to the running condition of actual jobs and ensuring the normal running of a system and comprises the following steps:
obtaining an execution status tag of each of a plurality of jobs and execution sequence data of the plurality of jobs, wherein the execution status tag is: an executed state tag or an unexecuted state tag;
determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data;
scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
The embodiment of the invention provides a batch job scheduling processing device, which is used for realizing accurate scheduling of batch jobs, accurately corresponding to the running condition of actual jobs, avoiding the problem that the subsequent jobs begin to run without completing the subsequent jobs in the prior jobs and ensuring the normal running of a system, and comprises the following components:
a data obtaining module, configured to obtain an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs, where the execution status tag is: an executed state tag or an unexecuted state tag;
the forward job determining module is used for determining one or more forward jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data;
the scheduling processing module is used for scheduling the job corresponding to each unexecuted state label according to the following steps until the execution state label of each job is the executed state label:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the batch job scheduling processing method is realized when the processor executes the computer program.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the batch job scheduling processing method is realized when the processor executes the computer program.
Compared with the scheme that the execution starting time of each job is set in the prior art, and then the execution is scheduled according to the timing sequence of each job, the embodiment of the invention obtains the execution state label of each job in a plurality of jobs and the execution sequence data of the plurality of jobs, wherein the execution state label is as follows: an executed state tag or an unexecuted state tag; determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data; scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label: determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label. The embodiment of the invention determines the tandem relation of the operation through the execution sequence data, and then determines whether to trigger the scheduling of the operation according to the execution state label of the tandem operation corresponding to each operation, thereby avoiding the problem that the operation is started when the tandem operation is not completed, realizing the accurate scheduling of batch operation corresponding to the actual operation condition, and ensuring the normal operation of the system.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
FIG. 1 is a schematic diagram illustrating a batch job scheduling method according to an embodiment of the present invention;
FIG. 2 is a block diagram of a batch job scheduling apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
As mentioned above, the distributed batch Job scheduling of the core bank X86 system is realized by adopting an Elastic-Job-Lite framework which is a lightweight decentralized solution and provides a coordination service of distributed tasks in the form of jar packages. Under the framework, the time for starting execution of each job is set, and then the jobs are scheduled to be executed in sequence according to the timing sequence of each job. However, the method cannot accurately correspond to the actual operation condition, the problems that the subsequent operation starts after the previous operation is not completed easily occur, the scheduling accuracy of the batch operation is low, and the normal operation of the system is seriously influenced.
In order to implement accurate scheduling of batch jobs, corresponding to an actual job running situation, avoid a problem that a preceding job starts running without completing the following job, and ensure normal running of a system, an embodiment of the present invention provides a batch job scheduling processing method, as shown in fig. 1, which may include:
102, determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data;
103, scheduling each job corresponding to the unexecuted status label until the executed status label of each job is the executed status label, according to the following steps:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
As shown in fig. 1, in the embodiment of the present invention, an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs are obtained, where the execution status tag is: an executed state tag or an unexecuted state tag; determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data; scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label: determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label. According to the method and the device, the front-back relation of the operation is determined through the execution sequence data, and then whether the scheduling of the operation is triggered or not is determined according to the execution state label of the front-back operation corresponding to each operation, so that the problem that the operation is started when the front-back operation is not completed is solved, the accurate scheduling of batch operation is realized corresponding to the actual operation condition of the operation, and the normal operation of the system is guaranteed.
In specific implementation, an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs are obtained, wherein the execution status tag is: an executed state tag or an unexecuted state tag.
In an embodiment, the executed state tag comprises: an executed tag and a timestamp, wherein the timestamp is an execution date.
In specific implementation, one or more previous jobs of the jobs corresponding to each unexecuted state label are determined according to the execution sequence data.
In an embodiment, after obtaining the execution status tag of each of the plurality of jobs and the execution order data of the plurality of jobs, one or more subsequent jobs of each unexecuted status tag corresponding to the job may be determined according to the execution order data. The execution sequence data is association structure data obtained from the context between jobs.
In an embodiment, the execution state tag of each of the plurality of jobs and the execution order data of the plurality of jobs are stored in a data table. The data table field includes: job name, execution date, unique serial number, execution state tag, current execution state start time, current execution state end time, list of successor job serial numbers, executed flag, and/or unexecuted flag. By the data table, the execution sequence data of the operation can be obtained, and the maintenance is convenient; and secondly, the execution state label of each job can be obtained, and the execution state of the tracking job is convenient to implement.
In specific implementation, scheduling processing is performed on the job corresponding to each unexecuted status tag according to the following steps until the execution status tag of each job is an executed status tag:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
The inventor finds that the existing batch job scheduling method cannot accurately correspond to the actual job running condition, the problem that the subsequent job starts to run when the previous job is not completed easily occurs, and the normal running of the system is seriously influenced due to low batch job scheduling accuracy. Therefore, the embodiment of the invention determines the tandem relation of the operation through the execution sequence data, and then determines whether to trigger the scheduling of the operation according to the execution state label of the tandem operation corresponding to each operation, thereby avoiding the problem that the operation is started when the tandem operation is not completed, realizing the accurate scheduling of batch operation corresponding to the actual operation condition, and ensuring the normal operation of the system.
In an embodiment, for each job corresponding to the unexecuted status tag, after determining one or more jobs preceding the job, determining whether to trigger job scheduling is as follows:
if the execution state label of one previous job corresponding to the job is an executed state label, or the execution state labels of a plurality of previous jobs corresponding to the job are all executed state labels, triggering job scheduling;
and if the execution state label of one previous job corresponding to the job is an unexecuted state label or at least one of the execution state labels of the multiple previous jobs corresponding to the job is the unexecuted state label, not triggering the job scheduling.
In the embodiment, before scheduling processing is carried out on each job corresponding to the unexecuted state label, whether the execution state labels of one or more previous jobs corresponding to the job are updated or not is determined; and if the execution status labels of one or more previous jobs corresponding to the jobs are updated, scheduling the jobs. If the execution status tags of one or more previous jobs corresponding to the job are updated, which indicates that the execution status tags of the previous jobs are updated from the unexecuted status tags to the executed status tags, the job has a chance to be scheduled, and if the execution status tags of one or more previous jobs corresponding to the job are not updated, which indicates that the unexecuted status tags in the previous jobs are not updated to the executed status tags on the basis that the previous scheduling is not triggered, the job is not scheduled at this time, so that the scheduling process can be omitted, and the redundant processing process can be effectively reduced.
In an embodiment, the execution state tag update of the job may be implemented by using a Zookeeper cluster. Zookeeper is a piece of software that provides a consistent service for distributed applications, using Watcher to perceive event information, such as: connection timeouts, node data changes, node changes, etc. Each job has a corresponding node on the Zookeeper, and the data in the corresponding node is modified when the job updates the execution state label each time, and the modification also triggers the scheduling processing of the job corresponding to each unexecuted state label.
It should be noted that, in the initial state, the execution status tags of all jobs are all unexecuted status tags, and the Job without a preceding Job uses the timing interface provided by Elastic-Job to time-trigger one or more jobs whose execution sequence is the top one. After the one or more jobs are scheduled, the execution status tag is updated to the executed status tag, and at this time, the batch job scheduling processing method in the embodiment of the present invention is applied to the jobs which are still the unexecuted status tag for processing until the execution status tag of each job is the executed status tag.
Based on the same inventive concept, an embodiment of the present invention further provides a batch job scheduling processing apparatus, as described in the following embodiments. Because the principles of solving the problems are similar to the batch job scheduling processing method, the implementation of the device can refer to the implementation of the method, and repeated details are not repeated.
Fig. 2 is a structural diagram of a batch job scheduling processing apparatus according to an embodiment of the present invention, and as shown in fig. 2, the apparatus includes:
a data obtaining module 201, configured to obtain an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs, where the execution status tag is: an executed state tag or an unexecuted state tag;
a subsequent job determining module 202, configured to determine, according to the execution sequence data, one or more subsequent jobs corresponding to the jobs for which each unexecuted status tag corresponds;
the scheduling processing module 203 is configured to perform scheduling processing on the job corresponding to each unexecuted status tag according to the following steps until the execution status tag of each job is an executed status tag:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
In one embodiment, the scheduling processing module is further configured to:
if the execution state label of one previous job corresponding to the job is an executed state label, or the execution state labels of a plurality of previous jobs corresponding to the job are all executed state labels, triggering job scheduling;
and if the execution state label of one previous job corresponding to the job is an unexecuted state label or at least one of the execution state labels of the multiple previous jobs corresponding to the job is the unexecuted state label, not triggering the job scheduling.
In one embodiment, the batch job scheduling processing apparatus further includes:
the updating judging module is used for determining whether the execution state tags of one or more previous jobs corresponding to the jobs are updated before scheduling processing is carried out on the jobs corresponding to each unexecuted state tag;
the scheduling processing module is further configured to: and if the execution status labels of one or more previous jobs corresponding to the jobs are updated, scheduling the jobs.
In one embodiment, the executed state tag comprises: marking and time stamping has been performed.
In summary, the embodiment of the present invention obtains an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs, where the execution status tag is: an executed state tag or an unexecuted state tag; determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data; scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label: determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs; and if the job scheduling is triggered, updating the execution state label of the job to the executed state label. According to the method and the device, the front-back relation of the operation is determined through the execution sequence data, and then whether the scheduling of the operation is triggered or not is determined according to the execution state label of the front-back operation corresponding to each operation, so that the problem that the operation is started when the front-back operation is not completed is solved, the accurate scheduling of batch operation is realized corresponding to the actual operation condition of the operation, and the normal operation of the system is guaranteed.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A batch job scheduling processing method is characterized by comprising the following steps:
obtaining an execution status tag of each of a plurality of jobs and execution sequence data of the plurality of jobs, wherein the execution status tag is: an executed state tag or an unexecuted state tag;
determining one or more previous jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data;
scheduling the job corresponding to each unexecuted state label until the executed state label of each job is an executed state label:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs;
and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
2. The method of claim 1, wherein determining whether to trigger job scheduling is performed by:
if the execution state label of one previous job corresponding to the job is an executed state label, or the execution state labels of a plurality of previous jobs corresponding to the job are all executed state labels, triggering job scheduling;
and if the execution state label of one previous job corresponding to the job is an unexecuted state label or at least one of the execution state labels of the multiple previous jobs corresponding to the job is the unexecuted state label, not triggering the job scheduling.
3. The method of claim 1, further comprising:
before scheduling processing is carried out on each job corresponding to the unexecuted state label, whether the executed state labels of one or more previous jobs corresponding to the jobs are updated or not is determined;
and if the execution status labels of one or more previous jobs corresponding to the jobs are updated, scheduling the jobs.
4. The method of claim 1, wherein the executed state tag comprises: marking and time stamping has been performed.
5. A batch job scheduling processing apparatus comprising:
a data obtaining module, configured to obtain an execution status tag of each job in a plurality of jobs and execution sequence data of the plurality of jobs, where the execution status tag is: an executed state tag or an unexecuted state tag;
the forward job determining module is used for determining one or more forward jobs of the jobs corresponding to each unexecuted state label according to the execution sequence data;
the scheduling processing module is used for scheduling the job corresponding to each unexecuted state label according to the following steps until the execution state label of each job is the executed state label:
determining whether to trigger job scheduling according to the execution state tags of one or more previous jobs corresponding to the jobs;
and if the job scheduling is triggered, updating the execution state label of the job to the executed state label.
6. The apparatus of claim 5, wherein the schedule processing module is further to:
if the execution state label of one previous job corresponding to the job is an executed state label, or the execution state labels of a plurality of previous jobs corresponding to the job are all executed state labels, triggering job scheduling;
and if the execution state label of one previous job corresponding to the job is an unexecuted state label or at least one of the execution state labels of the multiple previous jobs corresponding to the job is the unexecuted state label, not triggering the job scheduling.
7. The apparatus of claim 5, further comprising:
the updating judging module is used for determining whether the execution state tags of one or more previous jobs corresponding to the jobs are updated before scheduling processing is carried out on the jobs corresponding to each unexecuted state tag;
the scheduling processing module is further configured to: and if the execution status labels of one or more previous jobs corresponding to the jobs are updated, scheduling the jobs.
8. The apparatus of claim 5, wherein the executed state tag comprises: marking and time stamping has been performed.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 4 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program for executing the method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910892275.3A CN110633914A (en) | 2019-09-20 | 2019-09-20 | Batch job scheduling processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910892275.3A CN110633914A (en) | 2019-09-20 | 2019-09-20 | Batch job scheduling processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110633914A true CN110633914A (en) | 2019-12-31 |
Family
ID=68971880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910892275.3A Pending CN110633914A (en) | 2019-09-20 | 2019-09-20 | Batch job scheduling processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110633914A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114661014A (en) * | 2022-04-27 | 2022-06-24 | 西安热工研究院有限公司 | Switching value control method and system |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040225394A1 (en) * | 2003-04-28 | 2004-11-11 | Palo Alto Research Center, Incorporated. | Predictive and preemptive planning and scheduling for different jop priorities system and method |
| US20050010608A1 (en) * | 2003-07-08 | 2005-01-13 | Shigeru Horikawa | Job scheduling management method, system and program |
| US20100186020A1 (en) * | 2009-01-20 | 2010-07-22 | Sap Ag | System and method of multithreaded processing across multiple servers |
| CN103197960A (en) * | 2013-04-12 | 2013-07-10 | 中国银行股份有限公司 | Scheduling method and scheduling system for batch job system |
| CN104536811A (en) * | 2014-12-26 | 2015-04-22 | 广州华多网络科技有限公司 | HIVE task based task scheduling method and device |
| US20160011912A1 (en) * | 2014-07-10 | 2016-01-14 | Oracle International Corporation | Process scheduling and execution in distributed computing environments |
| CN105791354A (en) * | 2014-12-23 | 2016-07-20 | 中兴通讯股份有限公司 | Job scheduling method and cloud scheduling server |
| CN106547613A (en) * | 2016-10-20 | 2017-03-29 | 西北工业大学 | The scheduling of task handling process and fault recovery method |
| CN106648842A (en) * | 2016-12-27 | 2017-05-10 | 中国建设银行股份有限公司 | Method and device for continuous running of batch jobs |
-
2019
- 2019-09-20 CN CN201910892275.3A patent/CN110633914A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040225394A1 (en) * | 2003-04-28 | 2004-11-11 | Palo Alto Research Center, Incorporated. | Predictive and preemptive planning and scheduling for different jop priorities system and method |
| US20050010608A1 (en) * | 2003-07-08 | 2005-01-13 | Shigeru Horikawa | Job scheduling management method, system and program |
| US20100186020A1 (en) * | 2009-01-20 | 2010-07-22 | Sap Ag | System and method of multithreaded processing across multiple servers |
| CN103197960A (en) * | 2013-04-12 | 2013-07-10 | 中国银行股份有限公司 | Scheduling method and scheduling system for batch job system |
| US20160011912A1 (en) * | 2014-07-10 | 2016-01-14 | Oracle International Corporation | Process scheduling and execution in distributed computing environments |
| CN105791354A (en) * | 2014-12-23 | 2016-07-20 | 中兴通讯股份有限公司 | Job scheduling method and cloud scheduling server |
| CN104536811A (en) * | 2014-12-26 | 2015-04-22 | 广州华多网络科技有限公司 | HIVE task based task scheduling method and device |
| CN106547613A (en) * | 2016-10-20 | 2017-03-29 | 西北工业大学 | The scheduling of task handling process and fault recovery method |
| CN106648842A (en) * | 2016-12-27 | 2017-05-10 | 中国建设银行股份有限公司 | Method and device for continuous running of batch jobs |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114661014A (en) * | 2022-04-27 | 2022-06-24 | 西安热工研究院有限公司 | Switching value control method and system |
| CN114661014B (en) * | 2022-04-27 | 2023-07-25 | 西安热工研究院有限公司 | Switching value control method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106844055B (en) | Task execution method and device | |
| CN109656725B (en) | Message consumer switching method and device, storage medium and electronic equipment | |
| CN110611707B (en) | Task scheduling method and device | |
| CN108710532B (en) | Dependency realization method, device, equipment and storage medium of cross-dispatching platform | |
| CN112549029A (en) | Robot behavior control method and device based on behavior tree | |
| CN110704185B (en) | Cluster system fragmentation timing task scheduling method and cluster system | |
| US20220326927A1 (en) | Abort installation of firmware bundles | |
| CN110633914A (en) | Batch job scheduling processing method and device | |
| CN109739539B (en) | Cross-environment application release method, device, equipment and storage medium | |
| CN111459629A (en) | Azkaban-based project operation method and device and terminal equipment | |
| CN109960571B (en) | Multi-module scheduling method, device and system | |
| CN111373369A (en) | Software build using cloud system | |
| CN111158889A (en) | Batch task processing method and system | |
| CN107832461B (en) | Data migration method and system | |
| CN111147541A (en) | Node processing method, device and equipment based on parameter server and storage medium | |
| JP5387083B2 (en) | Job management system and method | |
| CN113419829B (en) | Job scheduling method, device, scheduling platform and storage medium | |
| CN112131188B (en) | Batch file distribution processing method and device | |
| EP3637262B1 (en) | Verification device for vehicle control device and vehicle control device | |
| CN114647491A (en) | Task scheduling method, device, equipment and storage medium | |
| CN103092692A (en) | Job management machine achieving method and job management machine applicable to software batch processing jobs | |
| CN109144967B (en) | Maintenance system and method for improving distributed computing system | |
| CN114153427A (en) | Optimization method and system of continuous integration assembly line | |
| CN112084014A (en) | Data processing method, device, equipment and medium | |
| CN113342499B (en) | Distributed task calling method, device, equipment, storage medium and program product |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191231 |