Scheduling of computer jobs employing dynamically determined top job party
US7926057B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 15, 2005 |
| Grant date | Apr 12, 2011 |
| Priority date | — |
| Expiry date | Oct 14, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2209/483
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A facility is presented for scheduling computer jobs of a computing environment having a plurality of computing nodes. The facility includes scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧2, and the number of jobs in the top job party is dynamically determined by monitoring backfill window coverage of the computing nodes by the N scheduled jobs and automatically closing membership in the top job party once (i) all computing nodes are covered by at least one backfill window, or (ii) a backfill end time of at least one computing node is greater than or equal to a maximum wallclock limit of a set of job classes having the N scheduled jobs. Responsive to determining the top job party, the facility then backfill schedules jobs of the job queue around the top job party for execution.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.