Backfill scheduling for embarrassingly parallel jobs
AssigneeInternational Business Machines Corporation
InventorsManish Modani, Giridhar M. Prabhakar, Ravindra R. Sure
Life of this patent
Estimating the term…
Abstract
Backfill scheduling for embarrassingly parallel jobs. A disclosed method includes: receiving an initial schedule having a plurality of jobs scheduled over time on a plurality of nodes, determining that a first job can be split into a plurality of sub-tasks that can respectively be performed in parallel on different nodes, splitting the first job into the plurality of sub-tasks, and moving a first sub-task from its position in the initial schedule to a new position to yield a first revised schedule.
Claims13
1-6. (canceled)
A computer program product comprising software stored on a software storage device, the software comprising:
- first program instructions programmed to receive an initial schedule of jobs, including a plurality of jobs, scheduled over time on a plurality of nodes;
- second program instructions programmed to determine that a first job from the plurality of jobs can be split into a plurality of sub-tasks that can respectively be performed in parallel on different nodes;
- third program instructions programmed to split the first job into the plurality of sub-tasks;
- and
- fourth program instructions programmed to move a first sub-task from its position in the initial schedule to a new position to yield a first revised schedule;
- wherein:
- the software is stored on a software storage device in a manner less transitory than a signal in transit.
A computer system comprising:
- a processor(s) set;
- and
- a software storage device;
- wherein:
- the processor set is structured, located, connected and/or programmed to run software stored on the software storage device;
- and
- the software comprises:
- first program instructions programmed to receive an initial schedule of jobs, including a plurality of jobs, scheduled over time on a plurality of nodes;
- second program instructions programmed to determine that a first job from the plurality of jobs can be split into a plurality of sub-tasks that can respectively be performed in parallel on different nodes;
- third program instructions programmed to split the first job into the plurality of sub-tasks;
- and
- fourth program instructions programmed to move a first sub-task from its position in the initial schedule to a new position to yield a first revised schedule.
Dependencies are inferred from the claim text.