Understanding the Energy Cost of Quantized Agents on Shared GPUs
Stephen Abkin, Alex Flesher, Aldric Yang, Nitheesh Kodarapu, Deepak Panigrahy, David Kebo Houngninou
Abstract
Quantization can lower the energy of language-model calls and free memory for serving more agents, but its benefit per completed task remains unclear when agents share a GPU. Measurements of fixed requests or isolated agents leave open how the agents' generated work interact with competition for compute and cache. We present a systematic study of precision and admission limits for two agent models on A100 deployments with 40 or 80 GB of memory, using coding and data-analysis tasks with independently verified outcomes. We replay recorded calls across precisions to isolate execution energy and cap the cache to test the value of freed memory. For both models with four admitted agents where requests fit in the cache, 4-bit weights with 16-bit activations execute the same calls with 10-25% less energy than 8-bit weights and activations. Despite this saving, extra work and fewer completions in live runs raise their energy per verified completion by 49%. Where requests compete for cache on the 40 GB deployment, 4-bit weights cost less, and capping their cache raises energy per verified completion by 34% with 16 agents. These results show how generated work and cache demand change the energy benefit of quantization, providing a practical basis for choosing precision and admission limits together.
Create a lesson
Related papers
The Unreported Variable:Collector Selectivity in Data Placement Evaluation
Nannan Zhao, Jiameng Zhang, Taoyu Zhong et al.
HPC-Bench: A Comprehensive Benchmark for High Performance Computing Codes
Bowen Cui, Junyu Yin, Tejas Ramesh et al.
DIMWIT: Directly Invoking Models Without Intensive Tuning
Saarth Deshpande, Neeraja J. Yadwadkar, Venkat Arun
How Far Are We From On-Device VLM Inference? A Measurement Study on Edge NPUs
Huan Yang, Shiqi Jiang, Yu Mao et al.
Approaching Optimal Scaling of Queue Size for an Input-Queued Switch
Taha Ameen, Weina Wang
EdgePace: Deadline- and Freshness-Aware LLM Scheduling on Unified-Memory Platforms
Teng Mei, Chengxuan Pei, Weijun Wang et al.