跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 00:30 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 00:30最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 00:28(北京时间)
版本更新 · v2arXiv:2609.25949

Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training

Arno Troch, Seyyidahmed Lahmer, Abubakr Nada, Roger Sanchez-Vital, Jeroen Famaey, Michael Peeters

原文摘要

Optical Circuit Switching (OCS) offers high bandwidth density and energy efficiency for LLM training, but incurs a non-negligible reconfiguration delay. Prior work typically schedules optical circuit switches independently of compute, using aggregate traffic demand to determine which circuits to provision and when. We argue that this separation creates a fundamental inefficiency: reconfigurations that ignore the compute timeline can stall communication, resulting in low circuit utilization and large buffer requirements. In this paper, we present Flux, a scheduler that optimally schedules optical circuit switches based on the structure of the entire workload. Flux remains effective across a wide range of switching speeds by reusing circuits and amortizing reconfiguration delay behind compute and communication. We show that Flux reduces training iteration time by up to $10\times$ and peak NIC buffer requirements by more than three orders of magnitude compared to traditional periodic schedulers.

cs.NI · cs.DC

新论文 · v1arXiv:2611.20893

Disaggregated LLM Inference in Space: A Communication Feasibility Study

Arno Troch, Roger Sanchez-Vital, Seyyidahmed Lahmer, Bartek Kozicki, Jeroen Famaey, Michael Peeters

原文摘要

Orbital data centers could enable large-scale AI inference, but efficiently serving a frontier language model to many users may require several compute satellites to cooperate over optical links. While disaggregated inference, which splits large language model (LLM) serving across machines, is well established in terrestrial data centers, its viability under the unique constraints of orbital deployments remains an open question. This article investigates how link capacity and satellite separation affect two types of disaggregated LLM serving, in both compact satellite formations and distributed constellations. Prefill-decode disaggregation (PDD) migrates a large KV cache once per request, while attention-FFN disaggregation (AFD) exchanges small activations at every mixture-of-experts layer for every generated token. The two respond to distance in different ways. PDD is limited mainly by link capacity and, with fast enough links, tolerates separations of up to a thousand kilometers. AFD is limited mainly by propagation delay, which accumulates layer by layer and forces attention and expert instances within about a kilometer of each other. Based on these results, we propose a hierarchical orbital inference architecture and provide network design guidelines for future orbital data centers, including the role of ground access latency.

cs.NI