co-authors not extracted
academic team
arXiv:2605.28302 · 2026-05-27
Maps the design space of Attention-FFN Disaggregation (AFD) for MoE serving — placing memory-bound attention work and compute-intensive expert-FFN work on physically distinct resource pools, with the MoE dispatch/combine pattern as the communication layer between them. The contribution isn't claiming AFD wins everywhere; it's a rigorous exploration of when AFD beats the simpler prefill-decode disaggregation and when it doesn't. Practical relevance: vendors building MoE inference appliances (Cerebras, Groq, FuriosaAI) all need this design-space analysis before committing silicon partitions.
对MoE服务下「注意力-FFN解耦(AFD)」的设计空间进行刻画:把内存受限的注意力工作与计算密集的专家FFN工作放在物理上不同的资源池,MoE的dispatch/combine作为两者之间的通信层。本文贡献并非「AFD处处取胜」,而是一次严谨探索:何时AFD优于更简单的「预填充-解码解耦」、何时不优。实际意义:搭建MoE推理设备的厂商(Cerebras、Groq、FuriosaAI)在做硅片分区承诺之前,都需要这种设计空间分析。
co-authors not extracted
academic team
arXiv:2605.29135 · 2026-05-27
Asks an under-discussed question: once large MoE models exist, can they run usefully on the much smaller hardware that organizations under budget, security, or air-gap constraints actually have? Proposes a 'rotary' execution pattern that pages experts in and out of limited GPU memory rather than requiring resident parameter counts. Not glamorous, but practical — and tracks the same disaggregation thesis as the AFD work above, just from the on-prem-deployment angle rather than the hyperscaler angle.
提出一个被低估的问题:当大型MoE模型已经存在,它们能否在那些受预算、安全或气隙约束、硬件远小于超大规模客户的组织中跑出实用价值?论文提出一种「旋转」执行模式,把专家在有限GPU内存中分页换入换出,避免要求所有参数常驻。不性感但实用——与上面AFD工作指向同一解耦命题,只是切入点从超大规模客户变成本地部署。
Google infrastructure team
Google
arXiv:2605.27963 · 2026-05-27
Treats TPU v4/v5p topology, routing, and collectives as a joint optimization problem and shows the existing deployed networks leave 'terabytes per second' of throughput on the table. The work matters less for the specific TPU result and more for the methodology: this is the first paper to demonstrate that the reconfigurable-fabric design point can be optimized at scale with publishable end-to-end metrics. Watch for whether the same approach migrates to GB200 / Rubin NVL fabrics, where reconfigurability is more limited but the optimization opportunity is just as large.
把TPU v4/v5p的拓扑、路由与集合通信视作联合优化问题,并表明现有部署网络在吞吐量上存在「每秒TB级」的留白。本文意义不在TPU具体结果,而在方法论:这是首次有论文证明,可重构织物设计点在规模下可被优化、并发布端到端可比较指标。值得关注的是:同一方法能否迁移到可重构性更弱、但优化空间同样巨大的GB200/Rubin NVL织物。