Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 17 Next »


Equivalence classes are a way to group similar jobs together.  Once one job in a class can not run, the scheduler knows the rest of the jobs in that class can not run.  This allows the scheduler to be more efficient by not having to consider all the jobs in the system.


Similar is defined by the following attributes and resources:

euser: If there are any user limits(soft or hard)

egroup: If there are any group limits(soft or hard)

project: If there are any project limits(soft or hard)

queue: If the job is in a queue

  • with limits (hard or soft)
  • with nodes associated to it
  • which is a prime time queue
  • which is a nonprime time queue
  • which is a dedicated time queue

All resources in the sched_config resources line in the select statement

All resources in the sched_config resources line from Resource_List (qsub -l)

Time based resources such as walltime, cput, max_walltime, and min_walltime from Resource_List

If preempt_targets_enable is true, Resource_List.preempt_targets

The place statement


How equivalence classes work:

  1. The scheduler sorts jobs into priority order.  This may include sorting algorithms such as the job_sort_formula or fairshare. 
  2. The scheduler starts considering jobs in sorted order
  3. When a job can't run, we mark the equivalence class as can't run.  We stash the reason the job can't run.
  4. In the future when we consider a job from this class, we already know it can't run.  We use the stashed reason.


There are no external interface changes for this feature.  The only outward sign of this feature working is a faster scheduling cycle.

  • No labels