Pith. sign in

REVIEW 1 cited by

Optimal Resource Efficiency with Fairness in Heterogeneous GPU Clusters

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.18545 v1 pith:ILMQEAT2 submitted 2024-03-27 cs.DC

classification cs.DC
keywords fairnessefficiencyresourceheterogeneoustrainingclusterspropertiesthroughput
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Ensuring the highest training throughput to maximize resource efficiency, while maintaining fairness among users, is critical for deep learning (DL) training in heterogeneous GPU clusters. However, current DL schedulers provide only limited fairness properties and suboptimal training throughput, impeding tenants from effectively leveraging heterogeneous resources. The underlying design challenge stems from inherent conflicts between efficiency and fairness properties. In this paper, we introduce OEF, a new resource allocation framework specifically developed for achieving optimal resource efficiency and ensuring diverse fairness properties in heterogeneous GPU clusters. By integrating resource efficiency and fairness within a global optimization framework, OEF is capable of providing users with maximized overall efficiency, as well as various guarantees of fairness, in both cooperative and non-cooperative environments. We have implemented OEF in a cluster resource manager and conducted large-scale experiments, showing that OEF can improve the overall training throughput by up to 32% while improving fairness compared to state-of-the-art heterogeneity-aware schedulers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MQFQ-Sticky: Fair Queueing For Serverless GPU Functions

    cs.DC 2025-07 conditional novelty 6.0 of 10

    MQFQ-Sticky applies multi-queue fair queuing and anticipatory scheduling to GPU serverless functions, reporting 2x-20x latency reductions and fairer GPU service than FCFS, batching, or SJF policies.

Pith tools