Grid non-deterministic job scheduling
AssigneeInternational Business Machines Corporation
InventorsChristopher James Dawson, Craig William Fellenstein, Rick Allen Hamilton, II, Joshy Joseph
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsChristopher James Dawson, Craig William Fellenstein, Rick Allen Hamilton, II, Joshy Joseph
Estimating the term…
The present invention is method for scheduling jobs in a grid computing environment without having to monitor the state of the resource on the gird comprising a Global Scheduling Program (GSP) and a Local Scheduling Program (LSP). The GSP receives jobs submitted to the grid and distributes the job to the closest resource. The resource then runs the LSP to determine if the resource can execute the job under the conditions specified in the job. The LSP either rejects or accepts the job based on the current state of the resource properties and informs the GSP of the acceptance or rejection. If the job is rejected, the GSP randomly selects another resource to send the job to using a resource table. The resource table contains the state-independent properties of every resource on the grid.
A method for scheduling a job on a grid wherein a scheduler does not have to keep track of a plurality of state dependent resource properties, the method comprising:
A method for scheduling a job on a grid wherein a resource determines whether to accept the job, the method comprising:
A computer program product for scheduling a job on a grid wherein a scheduler does not have to keep track of a plurality of state dependent resource properties, the computer program product comprising:
A computer program product for scheduling a job on a grid wherein a resource determines whether to accept the job, the computer program product comprising:
Dependencies are inferred from the claim text.