Skip to content
RTFM HPC - Why Jobs Wait episode artwork

EPISODE · Oct 13, 2026 · 21 MIN

RTFM HPC - Why Jobs Wait

from RTFM: High-Performance Computing Edition

Hey! I'd love to hear your thoughts, send me a voice note. #SLURM101: Why Jobs Wait (and Why They Sometimes Don't) You submit a job. Then someone else submits a job after you, and it starts first. Is Slurm broken? Is somebody cheating the queue? No. This is Slurm working exactly as designed. In this episode we follow one job, job 42, through its life in Slurm and look at the quiet decisions the scheduler makes along the way. No command syntax, no config files: just the concepts, so the commands and options stop looking like magic spells. What you will learn: - Backfill scheduling: why a small job can start before a big one - Partitions: separate pools of nodes with their own rules - Features (constraints): labels on nodes, like the GPU model or local storage - Topology-aware scheduling: keeping a job's nodes close together on the network - TRES (trackable resources): GPUs, memory, licenses and other countable things - QoS (quality of service): fair sharing when one group floods the queue - Plugins: adding your own logic, for example Pyxis for containers More info about HPC in the book https://a.co/d/b03YNBn

Episode metadata supplied by the publisher feed · Published Oct 13, 2026

Embed this episode

Ready to play

RTFM HPC - Why Jobs Wait

0:00 21:13

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of RTFM: High-Performance Computing Edition?

This episode is 21 minutes long.

When was this RTFM: High-Performance Computing Edition episode published?

This episode was published on October 13, 2026.

Can I download this RTFM: High-Performance Computing Edition episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!