DPSM: Fine-Grained GPU Resource Management via Kernel Interception and TPC Control

Modern deep learning workloads are increasingly co-located on a single GPU to improve hardware utilization, yet existing MPS-based sharing mechanisms expose concurrency without providing QoS-aware control. Deadline-constrained training jobs can suffer severe slowdown when co-executed with best-effort workloads, because MPS does not reason about job urgency or deadline slack. This paper presents DPSM, a transparent runtime system for QoS-first, throughput-aware co-scheduling of concurrent deep learning jobs on a single NVIDIA GPU. DPSM does not replace the native GPU scheduler, generate deadlines, or assign deadlines to individual kernels. Instead, it intercepts CUDA kernel launches, tracks job-level progress and slowdown online, and identifies the most urgent job using a slack-based scoring model. DPSM then enforces the scheduling decision through two complementary mechanisms: launch-timing control for large-grid best-effort kernels, and TPC-mask control that limits the TPC budget of selected small-grid best-effort kernels. Under MPS, DPSM treats TPC masks as budget controls that limit the number of available TPCs. This design preserves the MPS execution model while mitigating temporal and resource-budget interference among co-running jobs. We evaluate DPSM on NVIDIA RTX A6000 GPUs using representative two-job and three-job deep learning co-location workloads. Across 1260 job-deadline instances, DPSM achieves the highest all-job deadline completion rate (DCR) of 39.2%, compared with 37.6% for TGS, 28.7% for MPS, and 18.6% for Orion. DPSM also maintains competitive normalized iteration throughput of 0.471, close to the highest-throughput baseline Orion at 0.499, while providing substantially better deadline satisfaction. We envision DPSM as a valuable tool for the community and have open-sourced it to facilitate future research at https://github.com/HIT-CeeCG/DPSM.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2026-10-08
DOI
https://doi.org/10.1145/3857801
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DPSM: Fine-Grained GPU Resource Management via Kernel Interception and TPC Control

Sichao Chen, Hongwei Yang, Meng Hao, Shuo Si et al.
ACM Transactions on Architecture and Code Optimization
Parallel Computing and Optimization Techniques
article

DPSM: Fine-Grained GPU Resource Management via Kernel Interception and TPC Control

Sichao Chen, Hongwei Yang, Meng Hao, Shuo Si, Wei Zhang, Desheng Wang, Fuzhen Yong
article en

Abstract

Modern deep learning workloads are increasingly co-located on a single GPU to improve hardware utilization, yet existing MPS-based sharing mechanisms expose concurrency without providing QoS-aware control. Deadline-constrained training jobs can suffer severe slowdown when co-executed with best-effort workloads, because MPS does not reason about job urgency or deadline slack. This paper presents DPSM, a transparent runtime system for QoS-first, throughput-aware co-scheduling of concurrent deep learning jobs on a single NVIDIA GPU. DPSM does not replace the native GPU scheduler, generate deadlines, or assign deadlines to individual kernels. Instead, it intercepts CUDA kernel launches, tracks job-level progress and slowdown online, and identifies the most urgent job using a slack-based scoring model. DPSM then enforces the scheduling decision through two complementary mechanisms: launch-timing control for large-grid best-effort kernels, and TPC-mask control that limits the TPC budget of selected small-grid best-effort kernels. Under MPS, DPSM treats TPC masks as budget controls that limit the number of available TPCs. This design preserves the MPS execution model while mitigating temporal and resource-budget interference among co-running jobs. We evaluate DPSM on NVIDIA RTX A6000 GPUs using representative two-job and three-job deep learning co-location workloads. Across 1260 job-deadline instances, DPSM achieves the highest all-job deadline completion rate (DCR) of 39.2%, compared with 37.6% for TGS, 28.7% for MPS, and 18.6% for Orion. DPSM also maintains competitive normalized iteration throughput of 0.471, close to the highest-throughput baseline Orion at 0.499, while providing substantially better deadline satisfaction. We envision DPSM as a valuable tool for the community and have open-sourced it to facilitate future research at https://github.com/HIT-CeeCG/DPSM.

ACM Transactions on Architecture and Code Optimization
Harbin Institute of Technology (CN)
Openalex Percentile: Top 8%
Parallel Computing and Optimization Techniques
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.