The queue algorithm is a simple first-in, first-out system. Jobs are queued out in the order in which they are submitted. In this queuing scheme, jobs are sorted by their IDs, so jobs with lower IDs will be dispatched to run before jobs with higher IDs.
| Note |
|---|
If priority and cluster specification are the same, the job ID will be used to determine priority as the ultimate "tiebreaker." |