You are here
WEBINAR JULY 19: How Jobs are Scheduled to Run on Graham & Cedar
Interested in using Compute Canada's newest supercomputers, Graham and Cedar, but unsure how to use a scheduler to submit your jobs? This introductory webinar will walk through the basics of how a scheduler works and explain how Graham and Cedar's Slurm scheduler determines how jobs are dispatched within their systems.
Wednesday, July 19
9:00 - 10:00 am Pacifc // 12:00 - 1:00 pm Eastern
Canadian research teams have massive workloads to accomplish on Compute Canada's newest national general purpose systems - Cedar and Graham. The scheduler is the part of the system that accepts resource requests for the execution of computation procedures (jobs) and dispatches the procedures to the compute resources.
On national general purpose systems like Cedar and Graham, there are typically requests for more resources in the job queue than there are available resources at any given time on the cluster. Because of this, the scheduler needs to make decisions about the priority of each queued job in order to determine its eligibility to be dispatched to available resources compared to other jobs in the queue.
This webinar will describe the configuration of the national systems' Slurm scheduler and explain how it determines how jobs are dispatched to resources. Understanding the scheduler at this level provides several benefits to researchers including:
- better prediction of queue wait times
- potential wait time reductions due to informed job resource requests
- a clear definition of the difference between general purpose Rapid Access Service (RAS) and Resource for Research Groups (RRG) allocations
Beyond describing the scheduler configuration, this webinar will also provide recommended best practices when submitting jobs and demonstrate tools for monitoring jobs and the job queue on Graham and Cedar.
How to Join the Webinar
At the time of the session, click this link:
For more information or to ask questions about this session, contact email@example.com.