跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 08:49 — 2026-11-19 08:49(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v6arXiv:2610.03228

Reference-Compatible Parallel Execution for Quantized LLM Inference

Chengzhan Li

原文摘要

Batching a quantized large language model (LLM) can change full-vocabulary outputs and the key-value (KV) cache even when token positions and causal masks are unchanged. We introduce reference-derived phase plans: per-call execution descriptions that preserve a fixed deployment's producer, physical attention range, arithmetic and state ownership while exposing parallel work. Whole-graph plans split the complete computation at compatibility boundaries; local-attention plans split only attention and retain wider projection and feed-forward work. Independent arithmetic groups can also be packed into one operation without changing each group's reduction. We implement and qualify these paths on CUDA and Vulkan for Qwen, Llama and SmolLM2. On Linux/RTX A5000, compatible speculative execution reduces resident-service time by 17.21 percent, 25.54 percent and 11.52 percent relative to the fastest measured fixed target-only control for Qwen3-8B, Qwen3-14B and Llama-8B. Balanced experiments isolate an increment of 0.80 to 1.64 percent from Q8 projection packing and smaller, geometry-dependent gains from local cuts. For Qwen3-32B with mixed Q4_K/Q6_K weights, independent-channel grouping reduces ordinary service time by 5.61 percent against a graph-level scalar-column loop. Equal-work tests favor eight-query execution in aggregate, whereas complete live requests favor shorter proposals because longer proposals increase target work. The results show how to exploit known-query parallelism within an established numerical reference and how complete-request costs determine the useful execution strategy.

cs.PF