Skip to content
Book Open access

DEFT: Joint Task Placement and DVFS for Energy-Efficient Multi-GPU Runtimes

Jul 2026 · International Conference on Supercomputing · 0 citations · 52 references
Computer Science

TL;DR

DEFT is presented, an energy-aware scheduling framework that jointly optimizes task-to-device assignment and per-GPU DVFS configuration for task-based multi-GPU applications and employs a cost-model–driven strategy that integrates slack awareness, throughput awareness, and explicit modeling of task execution cost, inter-GPU data movement, and DVFS transition overheads, enabling coordinated placement and frequency decisions under dynamic runtime conditions.

Abstract

Energy efficiency has become a first-order concern in modern high-performance computing systems, as it directly determines achievable throughput under fixed power budgets. Although Dynamic Voltage and Frequency Scaling (DVFS) provides an effective mechanism for reducing GPU energy consumption, existing runtime systems decouple DVFS from task placement and inter-GPU communication, focus on single-GPU execution, or cannot adapt frequency to task granularity and runtime contention in multi-GPU environments. Consequently, current schedulers fail to capture the tight coupling between task placement, frequency selection, and inter-GPU data movement that fundamentally governs energy–performance trade-offs on multi-GPU systems. This paper presents DEFT, an energy-aware scheduling framework that jointly optimizes task-to-device assignment and per-GPU DVFS configuration for task-based multi-GPU applications. DEFT employs a cost-model–driven strategy that integrates slack awareness, throughput awareness, and explicit modeling of task execution cost, inter-GPU data movement, and DVFS transition overheads, enabling coordinated placement and frequency decisions at task granularity under dynamic runtime conditions. We prototype DEFT within the CUDASTF runtime and demonstrate its effectiveness across five optimization objectives. The evaluation shows that DEFT reduces energy consumption by 14.8% and 4.8% on average on NVIDIA L40S and L4, and reduces EDP by 9.9% and 3.7%, respectively, while maintaining performance within 1.5% of the fastest baseline.

Read PDF

Similar papers

Jun 2026

Energy-Aware Scheduling for Serverless LLM Serving on Shared GPUs

Festina is presented, a profiling-guided, power-aware control plane to minimize cluster-wide energy for serverless LLM serving and performs energy-aware workload consolidation to reduce GPUs'static power consumption via SLO-aware migration.

Tianyu Wang, Gourav Rattihalli, A. Dhakal et al. · 0 citations
Open access Aug 2026

Structure-Derived Bottleneck-Aware Scheduling for Multitasking MCM-GPUs

SA-Scheduler is presented, a structure-derived bottleneck-aware scheduling framework for multitasking MCM-GPUs that determines chip placement without hardware modification or runtime bottleneck profiling, and provides a principled and scalable foundation for multitasking on future MCM-GPUs.

Tie-Jian Zhang, Guangda Zhang, Lu Wang et al. · 0 citations
Conference Jul 2026

Energy-Efficient LLM Inference with SLA-Constrained Adaptive GPU Power Capping

GPU energy consumption represents a primary operational cost for Large Language Model (LLM) inference services. Despite the inherent variability of production workloads, most deployments rely on static power configurations that fail to exploit the non-linear relationship between power limits and performance. Consequent...

Alex F. R. Trajano, C. Costa, Francisco V. J. Nobre et al. · 0 citations
Preprint Jul 2026

EMO: Energy Efficiency Modeling and Optimization for AI Workloads

EMO combines graph analysis and pack-level models to formulate energy optimization as a constrained combinatorial problem, efficiently solving for optimal frequency policies under given latency targets.

Jiyu Luo, Shaoyu Chen, Jingwei Sun et al. · 0 citations
Preprint Jul 2026

Modeling and Chasing the Energy-Efficiency Sweet Spots in Modern GPUs

Overall, energy-efficient HPC execution is a configuration-dependent problem with identifiable regime shifts, and a model-driven guidance for selecting operating points is provided, and an interpretable analytical model is introduced that decomposes GPU power into linear and nonlinear components.

Ayesha Afzal, Markus Manfred Li, Michael Panzlaff · 0 citations
Jul 2026

A Power‐Efficient Scheduling Approach in a CPU–GPU Computing System by Thread‐Based Parallel Programming

A power‐efficient scheduling methodology leveraging thread‐based parallel programming to optimize resource utilization across CPU–GPU architectures using the taskflow framework and a dynamic programming algorithm is introduced to optimize computing task assignment and computational resource allocation.

Xulong Wu, Biao Hu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.