Dike: Enhancing Fairness and Efficiency in GPU Clusters for Deep Learning

The advent of deep learning (DL) has transformed signal interpretation, enabling more efficient solutions to complex signal processing problems. DL workloads in signal processing typically share the computational resources of GPU clusters. However, the unpredictable nature of the duration of the DL job introduces a dynamic environment in these clusters. Existing GPU cluster schedulers rely heavily on prior knowledge, overlooking the system’s evolving dynamism. Balancing individual job quality of service (QoS) with overall cluster efficiency is critical from a fairness perspective. Unfortunately, most current schedulers prioritize minimizing job completion time (JCT) at the expense of fairness. This paper introduces Dike, an information-agnostic framework. We propose discrete mixed-priority feedback queues and a communication-aware job placement strategy to balance fairness and efficiency. Large-scale trace-driven experiments demonstrate that Dike improves cluster efficiency by over 1.65 × compared to state-of-the-art resource schedulers.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10890635
Primary Topic
Advanced Neural Network Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dike: Enhancing Fairness and Efficiency in GPU Clusters for Deep Learning

Zhuo Tang, Bingting Jiang, Xin Su, Hong-Na Mu et al.
Advanced Neural Network Applications
article

Dike: Enhancing Fairness and Efficiency in GPU Clusters for Deep Learning

Zhuo Tang, Bingting Jiang, Xin Su, Hong-Na Mu, Jing Yao
article en

Abstract

The advent of deep learning (DL) has transformed signal interpretation, enabling more efficient solutions to complex signal processing problems. DL workloads in signal processing typically share the computational resources of GPU clusters. However, the unpredictable nature of the duration of the DL job introduces a dynamic environment in these clusters. Existing GPU cluster schedulers rely heavily on prior knowledge, overlooking the system’s evolving dynamism. Balancing individual job quality of service (QoS) with overall cluster efficiency is critical from a fairness perspective. Unfortunately, most current schedulers prioritize minimizing job completion time (JCT) at the expense of fairness. This paper introduces Dike, an information-agnostic framework. We propose discrete mixed-priority feedback queues and a communication-aware job placement strategy to balance fairness and efficiency. Large-scale trace-driven experiments demonstrate that Dike improves cluster efficiency by over 1.65 × compared to state-of-the-art resource schedulers.

Central South University (CN), Hunan University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 97%
Advanced Neural Network Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dike: Enhancing Fairness and Efficiency in GPU Clusters for Deep Learning — Zhuo Tang, Bingting Jiang, et al. · (2025) | TGRS Research Map | TGRS