Scheduling of computer jobs employing dynamically determined top job party

A computer system for scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the computer system comprising:

• a memory;
• and
• a processor in communications with the memory, wherein the computer system is configured to perform a method, said 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
• 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.

A computer program product for scheduling computer jobs of a computing environment comprising a plurality of computing nodes, the computer program product comprising;

• a non-transitory storage medium readable by a processor and storing instructions for execution by the processor to perform a 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.