Scheduling of computer jobs employing dynamically determined top job party
First Claim
1. A method of scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the method comprising:
- scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧
2, and the number N of computer jobs in the top job party is dynamically determined by monitoring backfill window coverage of the plurality of computing nodes by the N sequentially scheduled computer jobs and automatically closing membership in the top job party once (i) all computing nodes of the plurality of computing nodes are covered by at least one backfill window of at least one computer job of the N computer jobs in the top job party, or (ii) a backfill end time of at least one computing node of the plurality of computing nodes is greater than or equal to a maximum wallclock limit of a job class in a set of job classes comprising the N sequentially scheduled computer jobs; and
responsive to determination of the top job party, backfill scheduling at least one computer job of the job queue around the N computer jobs of the top job party for execution by the plurality of computing nodes.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
20 Claims
-
1. A method of scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the method comprising:
-
scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧
2, and the number N of computer jobs in the top job party is dynamically determined by monitoring backfill window coverage of the plurality of computing nodes by the N sequentially scheduled computer jobs and automatically closing membership in the top job party once (i) all computing nodes of the plurality of computing nodes are covered by at least one backfill window of at least one computer job of the N computer jobs in the top job party, or (ii) a backfill end time of at least one computing node of the plurality of computing nodes is greater than or equal to a maximum wallclock limit of a job class in a set of job classes comprising the N sequentially scheduled computer jobs; and
responsive to determination of the top job party, backfill scheduling at least one computer job of the job queue around the N computer jobs of the top job party for execution by the plurality of computing nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system for scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the system comprising:
-
means for scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧
2, and the number N of computer jobs in the top job party is dynamically determined by monitoring backfill window coverage of the plurality of computing nodes by the N sequentially scheduled computer jobs and automatically closing membership in the top job party once (i) all computing nodes of the plurality of computing nodes are covered by at least one backfill window of at least one computer job of the N computer jobs in the top job party, or (ii) a backfill end time of at least one computing node of the plurality of computing nodes is greater than or equal to a maximum wallclock limit of a job class in a set of job classes comprising the N sequentially scheduled computer jobs; and
means for backfill scheduling, responsive to determination of the top job party, at least one computer job of the job queue around the N computer jobs of the top job party for execution by the plurality of computing nodes. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. At least one program storage device readable by at least one computer, tangibly embodying at least one program of instructions executable by the at least one computer to perform a method of scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the method comprising:
-
scheduling N sequential computer jobs of a job queue until achieving a top job party, wherein N≧
2, and the number N of computer jobs in the top job party is dynamically determined by monitoring backfill window coverage of the plurality of computing nodes by the N sequentially scheduled computer jobs and automatically closing membership in the top job party once (i) all computing nodes of the plurality of computing nodes are covered by at least one backfill window of at least one computer job of the N computer jobs in the top job party, or (ii) a backfill end time of at least one computing node of the plurality of computing nodes is greater than or equal to a maximum wallclock limit of a job class in a set of job classes comprising the N sequentially scheduled computer jobs; and
responsive to determination of the top job party, backfill scheduling at least one computer job of the job queue around the N computer jobs of the top job party for execution by the plurality of computing nodes. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification