Abstract: A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

Abstract: A method and system for job scheduling (including backfill scheduling) dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes in the computing environment are first discovered and grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule is created so that the number of free nodes in the sub-pool may be charted over time. For each job in order of priority, using the free node schedules of only those sub-pools having nodes which may be used by a particular job, to determine the earliest time range capable of running the job. Once the earliest time range is determined for a particular job, scheduling the job to run in that earliest time range.