FACILITY FOR SCHEDULING THE EXECUTION OF JOBS BASED ON LOGIC PREDICATES

• US 20090158286A1
• Filed: 11/04/2008
• Published: 06/18/2009
• Est. Priority Date: 12/18/2007
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Carteri, Francesco Maria, Ferrara, Filomena, MacLellan, Scot
• Application Number:
  US12/264,409
• Publication Number:
  US 20090158286A1
• Time in Patent Office: Days
• US Class Current: 718/102
• CPC Class Codes: G06F 2209/506 Constraint
• CPC Class Codes: G06F 9/5038 considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration scheduling strategies G06F9/4881 and subgroups

Abstract

A solution for scheduling execution of jobs in a data processing system is disclosed. One method for implementing such a solution may start by providing a scheduling structure for scheduling the execution of jobs. Such a scheduling structure may include a workflow plan defining a flow of execution for planned jobs and/or a workflow model defining static policies for execution of modeled jobs. A set of rules for updating the scheduling structure is provided. The method may continue by updating the scheduling structure according to the rules, such as by adding or removing jobs for rules evaluated to be true. The execution of the jobs may then be scheduled according to the updated scheduling structure. A corresponding system and computer program product are also disclosed.

Claims

1. A method for scheduling the execution of jobs in a data processing system, the method comprising:

providing a scheduling structure for scheduling the execution of jobs;

providing a set of rules for updating the scheduling structure;

updating the scheduling structure according to the rules; and

scheduling the execution of the jobs according to the updated scheduling structure.

2. The method of claim 1, wherein:

the scheduling structure includes a workload plan defining a flow of execution for a set of planned jobs; and

scheduling the execution of the jobs includes submitting planned jobs for execution according to an updated workload plan.

3. The method of claim 1, wherein:

the scheduling structure includes a workload model defining static policies for executing a set of modeled jobs; and

scheduling the execution of the jobs includes creating a workload plan defining a flow of execution for a set of planned jobs according to an updated workload model, and submitting the planned jobs for execution according to the workload plan.

4. The method of claim 2, wherein:

the rules define conclusions depending on dynamic conditions based on the planned jobs; and

updating the scheduling structure includes resolving the rules to assert the conclusions according to an evaluation of the dynamic conditions, and updating the scheduling structure according to the asserted conclusions.

5. The method of claim 4, wherein:

providing a set of rules includes providing a set of atomic logic formulas, each atomic logic formula comprising a logic predicate of the planned jobs, and providing a set of compound logic formulas, each compound logic formula comprising a plurality of logic formulas combined with logic connectives; and

resolving the rules includes evaluating a truth-value of the logic predicate of each atomic logic formula, the truth-value being one of true and false, and evaluating the truth-value of each compound logic formula by applying predefined inference rules.

6. The method of claim 5, wherein:

at least one compound logic formula includes an antecedent proposition implying a consequent proposition;

resolving the rules includes determining a truth-value of the antecedent proposition, and setting the consequent proposition to true in response to the antecedent proposition being true; and

updating the scheduling structure includes updating the scheduling structure according to the consequent proposition in response to the consequent proposition being true.

7. The method of claim 6, wherein:

at least one compound logic formula includes an antecedent proposition based on a set of preexistence jobs; and

determining the truth-value of the antecedent proposition includes verifying that the preexistence jobs are included in the scheduling structure.

8. The method of claim 7, wherein:

at least one compound logic formula includes an antecedent proposition based on a set of preexistence conditions for the preexistence jobs; and

determining the truth-value of the antecedent proposition includes verifying fulfillment of the preexistence conditions by the preexistence jobs included in the scheduling structure.

9. The method of claim 8, wherein:

at least one compound logic formula includes an antecedent proposition based on a set of quantitative conditions for the scheduling structure; and

determining the truth-value of the antecedent proposition includes verifying fulfillment of the quantitative conditions by the planned jobs.

10. The method of claim 9, wherein:

at least one compound logic formula includes a consequent proposition including an indication of a set of inclusion inferred jobs; and

updating the scheduling structure includes adding the inclusion inferred jobs to the scheduling structure in response to the conclusion proposition being evaluated as true.

11. The method of claim 10, wherein:

at least one compound logic formula includes a consequent proposition including an indication of a set of exclusion inferred jobs; and

updating the scheduling structure includes removing the exclusion inferred jobs from the scheduling structure in response to a conclusion proposition being evaluated as true.

12. The method of claim 11, wherein:

the scheduling structure includes constraints of execution for a set of constrained jobs; and

updating the scheduling structure includes updating the constraints according to one of;

addition of the inclusion inferred jobs and removal of the exclusion inferred jobs.

13. A computer program product for scheduling the execution of jobs in a data processing system, the computer program product comprising a computer-usable medium having computer-usable program code embodied therein, the computer-usable program code comprising:

computer-usable program code for providing a scheduling structure for scheduling the execution of jobs;

computer-usable program code for providing a set of rules for updating the scheduling structure;

computer-usable program code for updating the scheduling structure according to the rules; and

computer-usable program code for scheduling the execution of the jobs according to the updated scheduling structure.

14. The computer program product of claim 13, wherein:

the scheduling structure includes a workload plan defining a flow of execution for a set of planned jobs; and

scheduling the execution of the jobs includes submitting planned jobs for execution according to an updated workload plan.

15. The computer program product of claim 13, wherein:

the scheduling structure includes a workload model defining static policies for executing a set of modeled jobs; and

scheduling the execution of the jobs includes creating a workload plan defining a flow of execution for a set of planned jobs according to an updated workload model, and submitting the planned jobs for execution according to the workload plan.

16. A system for scheduling the execution of jobs in a data processing system, the system comprising:

a planner to generate a scheduling structure for scheduling the execution of jobs;

a repository for storing a set of rules for updating the scheduling structure;

a controller for updating the scheduling structure according to the rules; and

a handler to execute the jobs according to the updated scheduling structure.