Skip to content

Job Scheduling

Job Execution Priority

Scheduler gives each job an execution priority and then uses this job execution priority to select which job(s) to run.

Job execution priority is determined by these job properties (in order of importance):

  1. queue priority
  2. fair-share priority
  3. eligible time

Queue Priority

Queue priority is priority of queue where job is queued before execution.

Queue priority has the biggest impact on job execution priority. Execution priority of jobs in higher priority queues is always greater than execution priority of jobs in lower priority queues. Other properties of job used for determining job execution priority (fair-share priority, eligible time) cannot compete with queue priority.

Queue priorities can be seen here.

Fair-Share Priority

Fair-share priority is priority calculated on recent usage of resources. Fair-share priority is calculated per project, all members of project share same fair-share priority. Projects with higher recent usage have lower fair-share priority than projects with lower or none recent usage.

Fair-share priority is used for ranking jobs with equal queue priority.

Fair-share priority is calculated as

MAX\_FAIRSHARE * ( 1 - \frac{usage_{Project}}{usage_{Total}} )

where MAX_FAIRSHARE has value 1E6, usageProject is cumulated usage by all members of selected project, usageTotal is total usage by all users, by all projects.

Usage counts allocated core-hours (ncpus x walltime). Usage is decayed, or cut in half periodically, at the interval 168 hours (one week).

Jobs Queued in Queue qexp Are Not Calculated to Project's Usage.


Calculated usage and fair-share priority can be seen here.

Calculated fair-share priority can be also seen as Resource_List.fairshare attribute of a job.

Eligible Time

Eligible time is amount (in seconds) of eligible time job accrued while waiting to run. Jobs with higher eligible time gains higher priority.

Eligible time has the least impact on execution priority. Eligible time is used for sorting jobs with equal queue priority and fair-share priority. It is very, very difficult for eligible time to compete with fair-share priority.

Eligible time can be seen as eligible_time attribute of job.


Job execution priority (job sort formula) is calculated as:

1000*queue\_priority + \frac{fairshare\_priority}{1000} + \frac{eligible\_time}{864000}

Job backfilling

The scheduler uses job backfilling.

Backfilling means fitting smaller jobs around the higher-priority jobs that the scheduler is going to run next, in such a way that the higher-priority jobs are not delayed. Backfilling allows us to keep resources from becoming idle when the top job (job with the highest execution priority) cannot run.

The scheduler makes a list of jobs to run in order of execution priority. Scheduler looks for smaller jobs that can fit into the usage gaps around the highest-priority jobs in the list. The scheduler looks in the prioritized list of jobs and chooses the highest-priority smaller jobs that fit. Filler jobs are run only if they will not delay the start time of top jobs.

It means, that jobs with lower execution priority can be run before jobs with higher execution priority.


It is very beneficial to specify the walltime when submitting jobs.

Specifying more accurate walltime enables better scheduling, better execution times and better resource usage. Jobs with suitable (small) walltime could be backfilled - and overtake job(s) with higher priority.

Job Placement

Job placement can be controlled by flags during submission.