arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.09752cs.DCcs.AI
收藏

A-IO:面向内存受限NPUs的自适应推断编排

A-IO: Adaptive Inference Orchestration for Memory-Bound NPUs

Hunan University(湖南大学)

Chen Zhang, Yan Ding, Haotian Wang, Chubo Liu, Keqin Li, Kenli Li

AI总结:

本文针对异构NPUs上大语言模型部署中的内存瓶颈问题,提出A-IO框架,解决静态模型部署导致的模型扩展悖论及细粒度推测解码的同步开销问题。

摘要:

在部署大型语言模型(LLMs)时,异构NPU平台(如Ascend 910B)上的自回归解码阶段面临严重的内存受限挑战。本研究揭示了由单尺寸模型静态部署导致的『模型扩展悖论』。同时指出了在NPU计算图编译下,细粒度推测解码(如Leviathan2023Fast、Chen2023Speculative)的内核同步开销,以及单纯依赖微粒级加速算法如Prompt LookUp Decoding(PLD)的严重局限性。

英文摘要:

During the deployment of Large Language Models (LLMs), the autoregressive decoding phase on heterogeneous NPU platforms (e.g., Ascend 910B) faces severe memory-bound challenges. This study reveals the ``Model Scaling Paradox'' caused by the static deployment of single-sized models. It also points out the kernel synchronization overhead of fine-grained speculative decoding \cite{leviathan2023fast, chen2023speculative} under NPU computational graph compilation, and the severe limitations of purely relying on micro-level acceleration algorithms like Prompt LookUp Decoding (PLD)

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑