paper-with-me

Papers

Prefill vs. Decode Bottlenecks: SRAM-Frequency Tradeoffs and the Memory-Bandwidth Ceiling

2025-12-26 · Hannah Atmer, Yuan Yao, Thiemo Voigt, Stefanos Kaxiras arxiv

Energy consumption dictates the cost and environmental impact of deploying Large Language Models. This paper investigates the impact of on-chip SRAM size and operating frequency on the energy efficiency and performance of LLM inference, focusing on the distinct behaviors of the compute-bound prefill and memory-bound decode phases. Our simulation methodology combines OpenRAM for energy modeling, LLMCompass for latency simulation, and ScaleSIM for systolic array operational intensity. Our findings show that total energy use is predominantly determined by SRAM size in both phases, with larger buffers significantly increasing static energy due to leakage, which is not offset by corresponding latency benefits. We quantitatively explore the memory-bandwidth bottleneck, demonstrating that while high operating frequencies reduce prefill latency, their positive impact on memory-bound decode latency is capped by the external memory bandwidth. Counter-intuitively, high compute frequency can reduce total energy by reducing execution time and consequently decreasing static energy consumption more than the resulting dynamic power increase. We identify an optimal hardware configuration for the simulated workload: high operating frequencies (1200MHz-1400MHz) and a small local buffer size of 32KB to 64KB. This combination achieves the best energy-delay product, balancing low latency with high energy efficiency. Furthermore, we demonstrate how memory bandwidth acts as a performance ceiling, and that increasing compute frequency only yields performance gains up to the point where the workload becomes memory-bound. This analysis provides concrete architectural insights for designing energy-efficient LLM accelerators, especially for datacenters aiming to minimize their energy overhead.

📄 PDF Abstract BibTeX arXiv:2512.22066

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

OverFill: Two-Stage Models for Efficient Language Model Decoding

2025-08-11 · Woojeong Kim, Junxiong Wang, Jing Nathan Yan, Mohamed Abdelfattah 외 arxiv

Large language models (LLMs) excel across diverse tasks but face significant deployment challenges due to high inference costs. LLM inference comprises prefill (compute-bound) and decode (memory-bound) stages, with decod…

Revisiting Disaggregated Large Language Model Serving for Performance and Energy Implications

2025-11-14 · Jiaxi Li, Yue Zhu, Eun Kyung Lee, Klara Nahrstedt arxiv

Different from traditional Large Language Model (LLM) serving that colocates the prefill and decode stages on the same GPU, disaggregated serving dedicates distinct GPUs to prefill and decode workload. Once the prefill G…

LAPS: A Length-Aware-Prefill LLM Serving System

2026-01-04 · Jianshu She, Zonghang Li, Hongchao Du, Shangyu Wu 외 arxiv

LAPS identifies and disaggregates requests with different prompt lengths in LLM serving to reduce TTFT latency. While recent systems have decoupled the prefill and decode stages to improve throughput, they still rely on …

Taming the Chaos: Coordinated Autoscaling for Heterogeneous and Disaggregated LLM Inference

2025-08-27 · Rongzhi Li, Ruogu Du, Zefang Chu, Sida Zhao 외 arxiv

Serving Large Language Models (LLMs) is a GPU-intensive task where traditional autoscalers fall short, particularly for modern Prefill-Decode (P/D) disaggregated architectures. This architectural shift, while powerful, i…

HALO: Memory-Centric Heterogeneous Accelerator with 2.5D Integration for Low-Batch LLM Inference

2025-10-03 · Shubham Negi, Kaushik Roy arxiv

The rapid adoption of Large Language Models (LLMs) has driven a growing demand for efficient inference, particularly in latency-sensitive applications such as chatbots and personalized assistants. Unlike traditional deep…