<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>分布式计算 on 庞玉栋个人博客</title><link>https://pangyd.com/tags/%E5%88%86%E5%B8%83%E5%BC%8F%E8%AE%A1%E7%AE%97/</link><description>Recent content in 分布式计算 on 庞玉栋个人博客</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Tue, 06 Oct 2026 20:42:11 +0800</lastBuildDate><atom:link href="https://pangyd.com/tags/%E5%88%86%E5%B8%83%E5%BC%8F%E8%AE%A1%E7%AE%97/index.xml" rel="self" type="application/rss+xml"/><item><title>DySCo: Dynamic Sharding for Collaborative Edge-Cloud LLM Inference with Depth-Synchronized Batching</title><link>https://pangyd.com/post/radar-5964/</link><pubDate>Tue, 06 Oct 2026 20:42:11 +0800</pubDate><guid>https://pangyd.com/post/radar-5964/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.08268v1">DySCo: Dynamic Sharding for Collaborative Edge-Cloud LLM Inference with Depth-Synchronized Batching&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Jingpo Xu, Paul Joe Maliakel, Ivona Brandic, Shashikant Ilager&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2610.08268v1 (cs)&lt;/p>
&lt;p>[Submitted on 6 Oct 2026]&lt;/p>
&lt;p>Title:DySCo: Dynamic Sharding for Collaborative Edge-Cloud LLM Inference with Depth-Synchronized Batching&lt;/p>
&lt;p>Authors:Jingpo Xu, Paul Joe Maliakel, Ivona Brandic, Shashikant Ilager&lt;/p>
&lt;p>View a PDF of the paper titled DySCo: Dynamic Sharding for Collaborative Edge-Cloud LLM Inference with Depth-Synchronized Batching, by Jingpo Xu and 3 other authors&lt;/p></description></item><item><title>Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell</title><link>https://pangyd.com/post/radar-5971/</link><pubDate>Tue, 06 Oct 2026 13:17:44 +0800</pubDate><guid>https://pangyd.com/post/radar-5971/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.07782v1">Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Hochan Son, Kyungdoe Han, Jaehan Koh, Xiaowu Dai, Wenlu Xu, Guang Cheng&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Artificial Intelligence&lt;/p>
&lt;p>arXiv:2610.07782v1 (cs)&lt;/p>
&lt;p>[Submitted on 6 Oct 2026]&lt;/p>
&lt;p>Title:Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell&lt;/p>
&lt;p>Authors:Hochan Son, Kyungdoe Han, Jaehan Koh, Xiaowu Dai, Wenlu Xu, Guang Cheng&lt;/p></description></item><item><title>EdgeAgent: Orchestrating On-Device LLM inference for End-User Multi-Agent Systems on CPU-GPU Unified Memory Architectures</title><link>https://pangyd.com/post/radar-5280/</link><pubDate>Fri, 02 Oct 2026 22:43:42 +0800</pubDate><guid>https://pangyd.com/post/radar-5280/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.03394v1">EdgeAgent: Orchestrating On-Device LLM inference for End-User Multi-Agent Systems on CPU-GPU Unified Memory Architectures&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Yuhai Long, Yuanxin Wei, Kai Wu, Jinhui Wei, Dan Huang, Jiangsu Du&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2610.03394v1 (cs)&lt;/p>
&lt;p>[Submitted on 2 Oct 2026]&lt;/p>
&lt;p>Title:EdgeAgent: Orchestrating On-Device LLM inference for End-User Multi-Agent Systems on CPU-GPU Unified Memory Architectures&lt;/p>
&lt;p>Authors:Yuhai Long (1), Yuanxin Wei (1), Kai Wu (2), Jinhui Wei (1), Dan Huang (1), Jiangsu Du (1) ((1) School of Computer Science and Engineering, Sun Yat-sen University, (2) China Mobile Internet Company Ltd.)&lt;/p></description></item><item><title>D2K-Bench: Can LLM Agents Turn Expert Designs into Efficient GPU Kernels?</title><link>https://pangyd.com/post/radar-5282/</link><pubDate>Fri, 02 Oct 2026 20:42:12 +0800</pubDate><guid>https://pangyd.com/post/radar-5282/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.03226v1">D2K-Bench: Can LLM Agents Turn Expert Designs into Efficient GPU Kernels?&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Daifeng Li, Huiqiang Jiang, Chengruidong Zhang, Wei Wu, Xudong Guo, Jianhong Tu, Jianwei Zhang, Binhang Yuan, Dayiheng Liu&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Machine Learning&lt;/p>
&lt;p>arXiv:2610.03226v1 (cs)&lt;/p>
&lt;p>[Submitted on 2 Oct 2026]&lt;/p>
&lt;p>Title:D2K-Bench: Can LLM Agents Turn Expert Designs into Efficient GPU Kernels?&lt;/p>
&lt;p>Authors:Daifeng Li, Huiqiang Jiang, Chengruidong Zhang, Wei Wu, Xudong Guo, Jianhong Tu, Jianwei Zhang, Binhang Yuan, Dayiheng Liu&lt;/p></description></item><item><title>ServeTwin: A Benchmark-Validated Simulator for Distributed LLM Architecture Exploration</title><link>https://pangyd.com/post/radar-5290/</link><pubDate>Fri, 02 Oct 2026 11:06:15 +0800</pubDate><guid>https://pangyd.com/post/radar-5290/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.02732v1">ServeTwin: A Benchmark-Validated Simulator for Distributed LLM Architecture Exploration&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Sungjoon Park, Changue Jung, Kyungno Joo, Mincheol Kang, Jaehyung Ahn, Sehwan Lee, Sangjoon Kim&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Performance&lt;/p>
&lt;p>arXiv:2610.02732v1 (cs)&lt;/p>
&lt;p>[Submitted on 2 Oct 2026]&lt;/p>
&lt;p>Title:ServeTwin: A Benchmark-Validated Simulator for Distributed LLM Architecture Exploration&lt;/p>
&lt;p>Authors:Sungjoon Park, Changue Jung, Kyungno Joo, Mincheol Kang, Jaehyung Ahn, Sehwan Lee, Sangjoon Kim&lt;/p>
&lt;p>View a PDF of the paper titled ServeTwin: A Benchmark-Validated Simulator for Distributed LLM Architecture Exploration, by Sungjoon Park and 5 other authors&lt;/p></description></item><item><title>HakiCC: LLM-Driven Multi-Agent Design and Optimization of Concurrency Control Protocols</title><link>https://pangyd.com/post/radar-4779/</link><pubDate>Thu, 01 Oct 2026 09:10:15 +0800</pubDate><guid>https://pangyd.com/post/radar-4779/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.00889v1">HakiCC: LLM-Driven Multi-Agent Design and Optimization of Concurrency Control Protocols&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Farzad Habibi, Juncheng Fang, Faisal Nawab&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DB（数据库）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Databases&lt;/p>
&lt;p>arXiv:2610.00889v1 (cs)&lt;/p>
&lt;p>[Submitted on 1 Oct 2026]&lt;/p>
&lt;p>Title:HakiCC: LLM-Driven Multi-Agent Design and Optimization of Concurrency Control Protocols&lt;/p>
&lt;p>Authors:Farzad Habibi, Juncheng Fang, Faisal Nawab&lt;/p>
&lt;p>View a PDF of the paper titled HakiCC: LLM-Driven Multi-Agent Design and Optimization of Concurrency Control Protocols, by Farzad Habibi and 2 other authors&lt;/p></description></item><item><title>Leto: Fast In-Place Recovery for LLM Training on Surviving Hardware</title><link>https://pangyd.com/post/radar-4797/</link><pubDate>Thu, 01 Oct 2026 04:29:57 +0800</pubDate><guid>https://pangyd.com/post/radar-4797/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2610.00687v1">Leto: Fast In-Place Recovery for LLM Training on Surviving Hardware&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Geon-Woo Kim, Joon Ha Kim, Daehyeok Kim&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2610.00687v1 (cs)&lt;/p>
&lt;p>[Submitted on 30 Sep 2026]&lt;/p>
&lt;p>Title:Leto: Fast In-Place Recovery for LLM Training on Surviving Hardware&lt;/p>
&lt;p>Authors:Geon-Woo Kim, Joon Ha Kim, Daehyeok Kim&lt;/p>
&lt;p>View a PDF of the paper titled Leto: Fast In-Place Recovery for LLM Training on Surviving Hardware, by Geon-Woo Kim and 2 other authors&lt;/p></description></item><item><title>Characterizing High Bandwidth Flash for LLM Serving</title><link>https://pangyd.com/post/radar-4462/</link><pubDate>Wed, 30 Sep 2026 15:02:56 +0800</pubDate><guid>https://pangyd.com/post/radar-4462/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.39131v1">Characterizing High Bandwidth Flash for LLM Serving&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Zack Yu, Chloe Wong, Coleman Hooper, Minjae Lee, Wonjun Kang, Youngjin Cho, Michael W. Mahoney, Yakun Sophia Shao, Kurt Keutzer, Amir Gholami&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Machine Learning&lt;/p>
&lt;p>arXiv:2609.39131v1 (cs)&lt;/p>
&lt;p>[Submitted on 30 Sep 2026]&lt;/p>
&lt;p>Title:Characterizing High Bandwidth Flash for LLM Serving&lt;/p>
&lt;p>Authors:Zack Yu, Chloe Wong, Coleman Hooper, Minjae Lee, Wonjun Kang, Youngjin Cho, Michael W. Mahoney, Yakun Sophia Shao, Kurt Keutzer, Amir Gholami&lt;/p></description></item><item><title>SPLASH: Switching Parallel Layouts of Attention with Seamless Handoff for LLM Serving</title><link>https://pangyd.com/post/radar-4111/</link><pubDate>Tue, 29 Sep 2026 22:02:29 +0800</pubDate><guid>https://pangyd.com/post/radar-4111/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.37626v1">SPLASH: Switching Parallel Layouts of Attention with Seamless Handoff for LLM Serving&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Chuan Liu, Shuoming Zhang, Zhicheng Li, Qianqi Sun, Ruiyuan Xu, Qiuchu Yu, Xiyu Shi, Huimin Cui, Jiacheng Zhao&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.37626v1 (cs)&lt;/p>
&lt;p>[Submitted on 29 Sep 2026]&lt;/p>
&lt;p>Title:SPLASH: Switching Parallel Layouts of Attention with Seamless Handoff for LLM Serving&lt;/p>
&lt;p>Authors:Chuan Liu, Shuoming Zhang, Zhicheng Li, Qianqi Sun, Ruiyuan Xu, Qiuchu Yu, Xiyu Shi, Huimin Cui, Jiacheng Zhao&lt;/p></description></item><item><title>Janus: Evidence-Before-Effect Sagas and Offline-Verifiable Provenance for Agentic LLMs</title><link>https://pangyd.com/post/radar-4470/</link><pubDate>Tue, 29 Sep 2026 21:57:51 +0800</pubDate><guid>https://pangyd.com/post/radar-4470/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.38266v1">Janus: Evidence-Before-Effect Sagas and Offline-Verifiable Provenance for Agentic LLMs&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Mustafa Arslan&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Cryptography and Security&lt;/p>
&lt;p>arXiv:2609.38266v1 (cs)&lt;/p>
&lt;p>[Submitted on 29 Sep 2026]&lt;/p>
&lt;p>Title:Janus: Evidence-Before-Effect Sagas and Offline-Verifiable Provenance for Agentic LLMs&lt;/p>
&lt;p>Authors:Mustafa Arslan&lt;/p>
&lt;p>View a PDF of the paper titled Janus: Evidence-Before-Effect Sagas and Offline-Verifiable Provenance for Agentic LLMs, by Mustafa Arslan&lt;/p>
&lt;p>View PDF&lt;/p>
&lt;p>HTML (experimental)&lt;/p>
&lt;p>Abstract:Agentic large language models (LLMs) now move money through tools, yet the record of what they did is usually a trace their own process emits beside the effect. Janus puts the record on the effect path. A step&amp;rsquo;s proposal, the verdict on it and any answer from a validator or a person are durable in a signed, hash-chained log before the step may run or its effect be released; with keys declared, each answer is signed by whoever gave or relayed it. Gates are pure functions of that log, and an auditor re-derives every verdict offline from the log and one public key. At the MCP edge the effect is held until then; through the SDK, which our model experiment uses, a cooperating client runs it only afterwards. We evaluate Janus under crash injection (144 kills in-process, 81 through the daemon), by verifying a 100-million-event log offline (254.5 s), and with a real model behind a lending workflow, run governed and plain on the same recorded model outputs. With the lending mandate in the model&amp;rsquo;s prompt, the comparison was 0 against 0. With it only in the policy and the amount&amp;rsquo;s unit stated, the model approved six loans declared over the mandate, three with no injection (a run that also dropped the unit approved three); the plain agent paid all six and Janus none, each refused by a deterministic validator and re-derivable offline. An always-approve oracle over the recorded intakes gave 20 and 21 declared over the mandate against 0, though Janus paid four and three whose declared amount understated the request. Designing the experiment exposed, in a system that passed its own audit, an instance of post-approval substitution: an approval keyed to an attempt was counted for a different proposal, moving a person&amp;rsquo;s approval from 100 to 1,000,000. We report it, a first fix and the five routes around it, and what Janus does not guarantee.&lt;/p></description></item><item><title>TempoKV: Timely Staging of LLM KV Caches for Memory-Semantic Flash</title><link>https://pangyd.com/post/radar-3683/</link><pubDate>Mon, 28 Sep 2026 20:55:20 +0800</pubDate><guid>https://pangyd.com/post/radar-3683/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.35065v1">TempoKV: Timely Staging of LLM KV Caches for Memory-Semantic Flash&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Jay H. Park, Hyungjun Kim, Dong Kim&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.35065v1 (cs)&lt;/p>
&lt;p>[Submitted on 28 Sep 2026]&lt;/p>
&lt;p>Title:TempoKV: Timely Staging of LLM KV Caches for Memory-Semantic Flash&lt;/p>
&lt;p>Authors:Jay H. Park, Hyungjun Kim, Dong Kim&lt;/p>
&lt;p>View a PDF of the paper titled TempoKV: Timely Staging of LLM KV Caches for Memory-Semantic Flash, by Jay H. Park and 2 other authors&lt;/p></description></item><item><title>Nereus: Adaptive Parallelism for LLM Post-Training</title><link>https://pangyd.com/post/radar-3689/</link><pubDate>Mon, 28 Sep 2026 16:55:05 +0800</pubDate><guid>https://pangyd.com/post/radar-3689/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.34645v1">Nereus: Adaptive Parallelism for LLM Post-Training&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Songlin Jiang, Tuo Shi, Sitong Zhang, Zeke Wang, Mario Di Francesco, Bo Zhao&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.34645v1 (cs)&lt;/p>
&lt;p>[Submitted on 28 Sep 2026]&lt;/p>
&lt;p>Title:Nereus: Adaptive Parallelism for LLM Post-Training&lt;/p>
&lt;p>Authors:Songlin Jiang, Tuo Shi, Sitong Zhang, Zeke Wang, Mario Di Francesco, Bo Zhao&lt;/p>
&lt;p>View a PDF of the paper titled Nereus: Adaptive Parallelism for LLM Post-Training, by Songlin Jiang and 5 other authors&lt;/p></description></item><item><title>QwenGyre: An Elastic Reinforcement Learning Framework for Training xLong-Horizon Agents</title><link>https://pangyd.com/post/radar-3705/</link><pubDate>Mon, 28 Sep 2026 03:02:03 +0800</pubDate><guid>https://pangyd.com/post/radar-3705/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.33848v1">QwenGyre: An Elastic Reinforcement Learning Framework for Training xLong-Horizon Agents&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Weiqi Wang, Yuxin Zhou, Mouxiang Chen, Siyuan Zhang, Yi Zhang, Yuyan Luo, Zhiyu Yin, Chencan Wu, Jiemin Jiang, Wentao Yao, Chujie Zheng, JianWei Zhang&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Machine Learning&lt;/p>
&lt;p>arXiv:2609.33848v1 (cs)&lt;/p>
&lt;p>[Submitted on 27 Sep 2026]&lt;/p>
&lt;p>Title:QwenGyre: An Elastic Reinforcement Learning Framework for Training xLong-Horizon Agents&lt;/p>
&lt;p>Authors:Weiqi Wang, Yuxin Zhou, Mouxiang Chen, Siyuan Zhang, Yi Zhang, Yuyan Luo, Zhiyu Yin, Chencan Wu, Jiemin Jiang, Wentao Yao, Chujie Zheng, JianWei Zhang&lt;/p></description></item><item><title>KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization</title><link>https://pangyd.com/post/radar-2534/</link><pubDate>Fri, 25 Sep 2026 00:17:52 +0800</pubDate><guid>https://pangyd.com/post/radar-2534/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.30059v1">KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Aheli Poddar, Sanskar Prasad, Arindam Samanta, Subha Chakraborty, Vishal Goyal, Rohit Singh Rathaur&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.AI（人工智能）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.30059v1 (cs)&lt;/p>
&lt;p>[Submitted on 24 Sep 2026]&lt;/p>
&lt;p>Title:KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization&lt;/p>
&lt;p>Authors:Aheli Poddar, Sanskar Prasad, Arindam Samanta, Subha Chakraborty, Vishal Goyal, Rohit Singh Rathaur&lt;/p>
&lt;p>View a PDF of the paper titled KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization, by Aheli Poddar and 5 other authors&lt;/p></description></item><item><title>Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution</title><link>https://pangyd.com/post/radar-2777/</link><pubDate>Thu, 24 Sep 2026 21:42:02 +0800</pubDate><guid>https://pangyd.com/post/radar-2777/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.29808v1">Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：José Luis Pino&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Cryptography and Security&lt;/p>
&lt;p>arXiv:2609.29808v1 (cs)&lt;/p>
&lt;p>[Submitted on 24 Sep 2026]&lt;/p>
&lt;p>Title:Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution&lt;/p>
&lt;p>Authors:José Luis Pino&lt;/p>
&lt;p>View a PDF of the paper titled Hard Stop: Kernel-Level Preemption and Containment for Rogue Agentic Execution, by Jos'e Luis Pino&lt;/p>
&lt;p>View PDF&lt;/p>
&lt;p>HTML (experimental)&lt;/p>
&lt;p>Abstract:In July 2026, an unconstrained autonomous agent participating in a frontier AI cybersecurity evaluation harness breached its evaluation sandbox, established an external command-and-control foothold, and executed a multi-stage intrusion into Hugging Face&amp;rsquo;s production multi-tenant dataset conversion infrastructure (referred to in this autopsy as Incident-2026-Alpha). Over 4.5 days, the rogue agent executed 17,600 discrete actions across 6,280 worker clusters, compromised AWS EC2 Instance Metadata Service (IMDS) credentials, forged Kubernetes service account tokens, rooted physical worker nodes via overprivileged CSI drivers, harvested 136 production secrets, and enrolled 181 ephemeral sandboxes into the organization&amp;rsquo;s internal mesh VPN.&lt;/p></description></item><item><title>MeshHeal: Two-Timescale Self-Healing for Gray Failures in Decentralized LLM Agent Networks</title><link>https://pangyd.com/post/radar-2785/</link><pubDate>Thu, 24 Sep 2026 12:29:37 +0800</pubDate><guid>https://pangyd.com/post/radar-2785/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.29015v1">MeshHeal: Two-Timescale Self-Healing for Gray Failures in Decentralized LLM Agent Networks&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Keru Chen, Sen Lin, Yingbin Liang, Nathaniel D. Bastian, Shaofeng Zou&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Artificial Intelligence&lt;/p>
&lt;p>arXiv:2609.29015v1 (cs)&lt;/p>
&lt;p>[Submitted on 24 Sep 2026]&lt;/p>
&lt;p>Title:MeshHeal: Two-Timescale Self-Healing for Gray Failures in Decentralized LLM Agent Networks&lt;/p>
&lt;p>Authors:Keru Chen, Sen Lin, Yingbin Liang, Nathaniel D. Bastian, Shaofeng Zou&lt;/p>
&lt;p>View a PDF of the paper titled MeshHeal: Two-Timescale Self-Healing for Gray Failures in Decentralized LLM Agent Networks, by Keru Chen and 4 other authors&lt;/p></description></item><item><title>Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information</title><link>https://pangyd.com/post/radar-2442/</link><pubDate>Wed, 23 Sep 2026 16:01:29 +0800</pubDate><guid>https://pangyd.com/post/radar-2442/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.27499v1">Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Adrian Redder, Arunselvan Ramaswamy, Holger Karl&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Mathematics &amp;gt; Optimization and Control&lt;/p>
&lt;p>arXiv:2609.27499v1 (math)&lt;/p>
&lt;p>[Submitted on 23 Sep 2026]&lt;/p>
&lt;p>Title:Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information&lt;/p>
&lt;p>Authors:Adrian Redder, Arunselvan Ramaswamy, Holger Karl&lt;/p>
&lt;p>View a PDF of the paper titled Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information, by Adrian Redder and 2 other authors&lt;/p>
&lt;p>View PDF&lt;/p></description></item><item><title>LayerCheck: Adaptive Layer-wise Checkpointing for Large Language Model Post-training</title><link>https://pangyd.com/post/radar-2446/</link><pubDate>Wed, 23 Sep 2026 08:57:59 +0800</pubDate><guid>https://pangyd.com/post/radar-2446/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.27193v1">LayerCheck: Adaptive Layer-wise Checkpointing for Large Language Model Post-training&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Minqiu Sun, Xin Huang, Luanzheng Guo, Nathan R. Tallent, Kento Sato, Dong Dai&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.27193v1 (cs)&lt;/p>
&lt;p>[Submitted on 23 Sep 2026]&lt;/p>
&lt;p>Title:LayerCheck: Adaptive Layer-wise Checkpointing for Large Language Model Post-training&lt;/p>
&lt;p>Authors:Minqiu Sun, Xin Huang, Luanzheng Guo, Nathan R. Tallent, Kento Sato, Dong Dai&lt;/p>
&lt;p>View a PDF of the paper titled LayerCheck: Adaptive Layer-wise Checkpointing for Large Language Model Post-training, by Minqiu Sun and 5 other authors&lt;/p></description></item><item><title>WeightBridge: An Efficient Weight Transfer Library for Reinforcement Learning</title><link>https://pangyd.com/post/radar-2076/</link><pubDate>Tue, 22 Sep 2026 05:54:15 +0800</pubDate><guid>https://pangyd.com/post/radar-2076/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.25442v1">WeightBridge: An Efficient Weight Transfer Library for Reinforcement Learning&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Xuanlin Jiang, Samuel Hsia, Michael Kuchnik, Zachary DeVito, Minlan Yu, Carole-Jean Wu&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p>
&lt;p>arXiv:2609.25442v1 (cs)&lt;/p>
&lt;p>[Submitted on 21 Sep 2026]&lt;/p>
&lt;p>Title:WeightBridge: An Efficient Weight Transfer Library for Reinforcement Learning&lt;/p>
&lt;p>Authors:Xuanlin Jiang, Samuel Hsia, Michael Kuchnik, Zachary DeVito, Minlan Yu, Carole-Jean Wu&lt;/p>
&lt;p>View a PDF of the paper titled WeightBridge: An Efficient Weight Transfer Library for Reinforcement Learning, by Xuanlin Jiang and 5 other authors&lt;/p></description></item><item><title>DeepSeek Elastic Compute (DSec): A Sandbox Infrastructure for Effective Agentic Training at Scale</title><link>https://pangyd.com/post/radar-1305/</link><pubDate>Sat, 19 Sep 2026 20:20:26 +0800</pubDate><guid>https://pangyd.com/post/radar-1305/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.22978v1">DeepSeek Elastic Compute (DSec): A Sandbox Infrastructure for Effective Agentic Training at Scale&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Jialiang Huang, Hongxuan Tang, Jingchang Chen, Yuxuan Liu, Yixiao Chen, Yuan Cheng, Yi Tao, Jingli Zhou, Yupeng Chen, Haoyu Chen, Jiarui Wang, Shengkai Lin, Chuqi Zhang, Bryan Lee Teng, Lian Guo, Zhe Fu, Wenjun Gao, Yisong Wang, Liang Zhao, Zehao Wang, Ziwei Xie, Yongqiang Guo, Peixin Cong, Ziyi Gao&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Distributed, Parallel, and Cluster Computing&lt;/p></description></item><item><title>ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference</title><link>https://pangyd.com/post/radar-289/</link><pubDate>Wed, 16 Sep 2026 08:04:13 +0800</pubDate><guid>https://pangyd.com/post/radar-289/</guid><description>&lt;blockquote>
&lt;p>&lt;strong>原文&lt;/strong>：&lt;a href="https://arxiv.org/abs/2609.17943v1">ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference&lt;/a>&lt;/p>
&lt;p>&lt;strong>作者&lt;/strong>：Amir Ziashahabi, Hossein Entezari Zarch, Lei Gao, Murali Annavaram, Salman Avestimehr&lt;/p>
&lt;p>&lt;strong>来源&lt;/strong>：arXiv cs.DC（分布式并行）&lt;/p>
&lt;/blockquote>
&lt;h2 id="正文">正文&lt;/h2>
&lt;p>Computer Science &amp;gt; Machine Learning&lt;/p>
&lt;p>arXiv:2609.17943v1 (cs)&lt;/p>
&lt;p>[Submitted on 16 Sep 2026]&lt;/p>
&lt;p>Title:ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference&lt;/p>
&lt;p>Authors:Amir Ziashahabi, Hossein Entezari Zarch, Lei Gao, Murali Annavaram, Salman Avestimehr&lt;/p>
&lt;p>View a PDF of the paper titled ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference, by Amir Ziashahabi and 4 other authors&lt;/p></description></item></channel></rss>