Job scheduling with optimization of power consumption
AssigneeInternational Business Machines Corporation
InventorsGiuseppe Longobardi, Scot MacLellan
Life of this patent
Estimating the term…
Abstract
A scheduler is provided, which takes into account the location of the data to be accessed by a set of jobs. Once all the dependencies and the scheduling constraints of the plan are respected, the scheduler optimizes the order of the remaining jobs to be run, also considering the location of the data to be accessed. Several jobs needing an access to a dataset on a specific disk may be grouped together so that the grouped jobs are executed in succession, e.g., to prevent activating and deactivating the storage device several times, thus improving the power consumption and also avoiding input output performances degradation.
Claims10
A computer program product to schedule submission of work units for execution on a data processing system having a plurality of resources, comprising:
- computer readable memory having computer readable program code embodied therewith, the computer readable program code comprising:
- computer readable program code configured to identify a plan of execution of a first stream of work units and a second stream of work units, the plan including a set of precedence rules according to which time constraints are imposed in the order of execution of the work units of the first stream and the second stream, each work unit requiring at least one resource for the execution and having at least one attribute indicative of the resource requirement for the work unit;
- computer readable program code configured to inspect the attributes of the first stream of work units and the second stream of work units to identify those work units that access a predetermined common resource, wherein the inspection occurs independently of whether the predetermined common resource is active;
- computer readable program code configured to perform a check, using the set of precedence rules, to verify whether dependencies or constraints exist that affect an execution order;
- computer readable program code configured to determine whether rearrangement of the plan of execution is possible based on the indentified work units accessing the same resource and their dependencies or constrains that exist;
- computer readable program code configured to, if rearrangement is possible, rearrange the plan of execution so that the identified work units are executed in succession provided the precedence rules are respected such that a work unit from the first stream that accesses the common resource is pulled in to be executed before a work unit from the second stream that also accesses the common resource but must wait on a work unit from the second stream that does not access the common resource to complete, wherein the work unit from the second stream that accesses the common resource was originally scheduled to be executed before the work unit from the first stream that accesses the common resource;
- and
- computer readable program code configured to submit the rearranged plan for execution;
- computer readable program code configured to, if rearrangement is not possible, submit the identified plan for execution.
Dependencies are inferred from the claim text.