Skip to content

Author

Cun-Chen Hu

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Energy-Efficient LLM Serving via Disaggregated Attention--FFN and Flexible Frequency Scaling

Large language model (LLM) serving spans diverse applications with stringent service-level objectives (SLOs), often requiring GPUs to run at maximum frequencies and increasing energy consumption. Existing energy-management approaches adapt GPU frequencies only at the request or inference-phase level, overlooking operator-level differences in frequency sensitivity between Attention and feed-forward networks (FFNs). We find that the energy-optimal frequencies of Attention and FFN (A/F) differ and vary with the inference phase, workload, and system configurations. However, runtime variability and independent A/F frequency control create a large search space and high communication overhead. To address these challenges, we present AFlex, a framework that jointly optimizes resource provisioning and GPU frequency scaling for disaggregated A/F serving. AFlex introduces a global scheduler and a local operator-level dynamic voltage and frequency scaling (DVFS) controller to determine A/F resource allocations and frequencies. It further introduces an interleaved A/F pipeline with dynamic microbatch depth and adaptive request batching to reduce pipeline bubbles. We implement AFlex in SGLang and evaluate it on NVIDIA A800 GPUs using Qwen3-32B and Mixtral-8$\times$7B under production Conversation and Coding traces. \AFlex reduces energy per token by up to 49\% over state-of-the-art disaggregated serving and 48\% over frequency-scaling systems while satisfying TTFT and TPOT SLOs.

Cun-Chen Hu, Liangliang Xu, Tianyu Liu et al. · 0 citations
Book Open access Sep 2026

DdlRT: A deterministic data layout for efficient redundancy transitioning in erasure-coded systems

Erasure coding is widely used in distributed storage systems because it provides high reliability with low storage overhead. To adapt to changing performance and reliability requirements, systems may perform redundancy transition on erasure-coded data, i.e., re-encoding existing data on the fly with new coding parameters. However, existing random data layouts incur substantial transition traffic and severe load imbalance. We present DdlRT, a deterministic data layout for redundancy transition in distributed storage systems. DdlRT leverages two orthogonal arrays to build a two-level mapping across racks and nodes, deterministically placing stripes on designated storage nodes. By making data layout transition-aware, DdlRT avoids or significantly reduces transition traffic while preserving load balance at both the rack and node levels. Large-scale simulations and real-system experiments show that, compared with state-of-the-art schemes, DdlRT reduces redundancy transition traffic by 68.13%–92.37% and transition time by 38.32%–94.35%, while also improving load balance.

Xiao-Tong Geng, Hao-Qi Duan, Liangliang Xu et al. · 0 citations

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