跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+6403新增论文
+5442其中 AI 相关
+112已有论文修订
+122新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-05 10:10最近发现新增版本:2026-11-05 10:10库内论文最新更新时间:2026-11-04 12:53

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

15,080 已收录论文13,117 AI 相关3,141 有修订112 HF 社区发现

浏览论文库

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

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-05 10:08(北京时间)
版本更新 · v2arXiv:2604.14993

服务具有大内存足迹的链式结构作业:面向大型基础模型服务

Serving Chain-structured Jobs with Large Memory Footprints with Application to Large Foundation Model Serving

Tingyang Sun, Ting He, I-Hong Hou

AI 速览:针对大内存足迹的链式结构作业服务,提出“服务器链组合”问题,通过块放置与缓存分配建模流水线并行下的大模型服务,并给出可扩展且具性能保证的算法。

As a current trend in Artificial Intelligence (AI), large foundation models are increasingly employed as the core of AI services. However, even after training, serving such models at scale remains a challenging task due to their heavy resource footprints, particularly in terms of GPU memory. While recent works revealed unique characteristics of systems serving foundation models that distinguish them from traditional distributed computing systems, there is still a lack of fundamental understanding of the underlying system management problems. This work aims at addressing this gap by extracting a novel problem of "server chain composition" via block placement and cache allocation for serving chainstructured jobs with large memory footprints, which models a fundamental problem in serving large foundation models through pipeline parallelism. After showing the NP-hardness of the optimal solution, the focus is turned to developing scalable algorithms with guaranteed performance under state-of-the-art load balancing. Application of the proposed solution to a distributed large language model (LLM) serving system shows significant reduction of response times compared to state-of-the-art solutions.

cs.DC · cs.PF
arXiv ↗PDF ↗