arXiv Computation and Language By Quan Nguyen-Tri, Mukul Ranjan, Zhiqiang Shen

Flash-dLLM: IO-Aware KV Caching and Parallel Decoding for Fast, Memory-Efficient Diffusion LLMs

Read the original on arXiv Computation and Language →

Flash-dLLM is a training‑free inference acceleration framework that improves the speed and memory efficiency of Diffusion Large Language Models (dLLMs). It tackles GPU memory I/O bottlenecks by introducing an I/O‑aware fused KV‑cache kernel and then employs a draft‑and‑verify decoding strategy that uses the dLLM itself as both drafter and verifier. Experiments on mathematical reasoning and code‑generation tasks show Flash‑dLLM outperforms existing acceleration methods, achieving up to 11.0× speedups over the Elastic‑Cache baseline.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Machine Learning
Jun 26

Dynamic-dLLM: Dynamic Cache-Budget and Adaptive Parallel Decoding for Training-Free Acceleration of Diffusion LLM

arXiv:2606. 26120v1 Announce Type: cross Abstract: Diffusion Large Language Models (dLLMs) offer a promising alternative to autoregressive models, excelling in text generation tasks due to their bidirectional attention mechanisms.

By Tianyi Wu, Xiaoxi Sun, Yanhua Jiao, Yulin Li, Yixin Chen, YunHao Cao, YiQi Hu, Zhuotao Tian
arXiv Machine Learning
Sep 16

LLM Inference in a Flash!

The paper "LLM Inference in a Flash!" proposes an integer‑only quantization scheme and a dictionary‑based KV cache compression technique to enable large language model inference on compute‑in‑flash (CIF) devices. By eliminating floating‑point operations and reducing KV cache traffic through sparse dictionary coding, the authors achieve minimal accuracy loss while cutting dynamic KV cache traffic by 15× on Llama‑3.1‑8B and Qwen‑2.5‑7B models.

By Sebastian Zhao, Minseo Kim, Coleman Hooper, Luca Manolache, Michael W. Mahoney, Yakun Sophia Shao, Kurt Keutzer, Amir Gholami
arXiv AI
3d ago

FlashOffloading: Low-Latency KV Cache Offloading for Long-Context LLM Serving

FlashOffloading is a host‑DRAM‑centric inference architecture that fully offloads the key‑value (KV) cache for large language model serving, addressing the high‑bandwidth memory (HBM) capacity wall that limits concurrency. It introduces a rolling HBM cache for prefill, a hot cache for decode, a reverse sparse index with zero miss‑lookup overhead, and a compute–load overlapped kernel to reduce KV offloading latency across the pipeline. Experiments on an Ascend910C platform with GLM‑5.2 show up to 1.38× prefill throughput and 1.91× decode throughput gains under a 30 ms time‑per‑output‑token constraint.

By Xuan Wang, Zhuanhao Wu, Tingzhu Fang, Xushi Li, Sicheng Zhang, Zhenyu Yang, Feng Liu, Zhaohui Fan, Qiang Xie, Huayi Zou, Yuncong Liu, Zeyu Song, Ke Zhu, Yanjia Zeng, Jingchun Gao, Yan Shi, Kui Luo, Gezi Li, Liangjun Feng, Cheng Li
Hugging Face Trending Papers
4d ago

FlashOffloading: Low-Latency KV Cache Offloading for Long-Context LLM Serving

FlashOffloading is a host-DRAM-centric inference architecture that fully offloads the key-value cache for large language model serving, addressing the high-bandwidth memory capacity wall that limits concurrency. It introduces a rolling HBM cache for prefill, a hot cache for decode, a reverse sparse index, and a compute–load overlapped kernel to minimize offloading latency across the pipeline. Experiments with GLM‑5.2 on an Ascend910C platform show up to 1.38× higher prefill throughput and 1.91× higher decode throughput under a 30 ms time‑per‑output‑token constraint.