Red HatMaysa De Macedo SouzaTutorial
Configure admission fair sharing in Red Hat build of Kueue 1.4
Summary
Red Hat build of Kueue 1.4 provides admission fair sharing for shared CPU, GPU, and high-performance computing clusters where FIFO admission can starve later workloads. The guide configures the feature through the Kueue custom resource, using either default values—30-minute usage half-life, five-minute sampling interval, and resource weights of 1—or custom settings, then creates a ResourceFlavor, a ClusterQueue using UsageBasedAdmissionFairSharing, and two LocalQueues. Kueue tracks each LocalQueue's historical consumption, adds a temporary penalty when a workload is admitted, and compares usage adjusted by queue weight to choose the lowest-use pending workload when quota returns. In the example, lq-a receives the first job, lq-b is admitted after job1 is deleted, and usage decays or grows on sampling ticks; usage ordering takes precedence over priority classes, which only break ties.
Context
Shared clusters with constrained GPUs or high-spec CPUs can have multiple tenants competing for limited quota. The source states that FIFO admission may cause long-term starvation for workloads submitted later and reduce service predictability.
Approach / What changed
Enable admissionFairSharing in the Kueue custom resource with Default or Custom settings, create a uniform ResourceFlavor and a ClusterQueue using UsageBasedAdmissionFairSharing, then place workloads in LocalQueues sharing that ClusterQueue. Kueue uses historical LocalQueue consumption, temporary admission penalties, sampling, half-life decay, and optional weights to order pending workloads.
Takeaways
Admission fair sharing reorders workloads at admission time without evicting running workloads; fair sharing-based preemption can evict them.
The default configuration uses a 30-minute usage half-life, a five-minute sampling interval, and a resource weight of 1 for each resource; these defaults may change.
Usage-based ordering across LocalQueues takes precedence over priority classes, with priority used as a tiebreaker when usage is equal.
Source and freshness
- Source
- developers.redhat.com
- Published
- Added to Yomu
- Last updated
Summaries are generated from the original by a language model. Check the original before relying on it.
Keep reading
Related reading
The Good Stuff
Paid picks we use ourselves. Links carry a referral code — a subscription through one earns us a commission at no extra cost to you.
The best engineering reads, once a week
One useful email. Unsubscribe anytime.