<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>序列并行 on Answer</title>
    <link>https://answer.freetools.me/tags/%E5%BA%8F%E5%88%97%E5%B9%B6%E8%A1%8C/</link>
    <description>Recent content in 序列并行 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Mon, 09 Mar 2026 05:36:18 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%BA%8F%E5%88%97%E5%B9%B6%E8%A1%8C/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>梯度检查点如何让大模型训练突破显存瓶颈：从时间换空间到选择性重计算的技术进化</title>
      <link>https://answer.freetools.me/%E6%A2%AF%E5%BA%A6%E6%A3%80%E6%9F%A5%E7%82%B9%E5%A6%82%E4%BD%95%E8%AE%A9%E5%A4%A7%E6%A8%A1%E5%9E%8B%E8%AE%AD%E7%BB%83%E7%AA%81%E7%A0%B4%E6%98%BE%E5%AD%98%E7%93%B6%E9%A2%88%E4%BB%8E%E6%97%B6%E9%97%B4%E6%8D%A2%E7%A9%BA%E9%97%B4%E5%88%B0%E9%80%89%E6%8B%A9%E6%80%A7%E9%87%8D%E8%AE%A1%E7%AE%97%E7%9A%84%E6%8A%80%E6%9C%AF%E8%BF%9B%E5%8C%96/</link>
      <pubDate>Mon, 09 Mar 2026 05:36:18 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%A2%AF%E5%BA%A6%E6%A3%80%E6%9F%A5%E7%82%B9%E5%A6%82%E4%BD%95%E8%AE%A9%E5%A4%A7%E6%A8%A1%E5%9E%8B%E8%AE%AD%E7%BB%83%E7%AA%81%E7%A0%B4%E6%98%BE%E5%AD%98%E7%93%B6%E9%A2%88%E4%BB%8E%E6%97%B6%E9%97%B4%E6%8D%A2%E7%A9%BA%E9%97%B4%E5%88%B0%E9%80%89%E6%8B%A9%E6%80%A7%E9%87%8D%E8%AE%A1%E7%AE%97%E7%9A%84%E6%8A%80%E6%9C%AF%E8%BF%9B%E5%8C%96/</guid>
      <description>深入解析Gradient Checkpointing的核心原理：从2016年Tianqi Chen的开创性论文到NVIDIA的选择性重计算技术，揭示大模型训练如何通过&amp;#34;用计算换内存&amp;#34;突破显存瓶颈。涵盖O(√n)内存复杂度的数学证明、Transformer激活内存的精确公式、Sequence Parallelism与Selective Recomputation的协同优化，以及PyTorch/DeepSpeed/Megatron-LM的实战配置。</description>
    </item>
    <item>
      <title>Ring Attention如何让大模型突破百万Token上下文从环形通信到计算重叠的技术突围</title>
      <link>https://answer.freetools.me/ring-attention%E5%A6%82%E4%BD%95%E8%AE%A9%E5%A4%A7%E6%A8%A1%E5%9E%8B%E7%AA%81%E7%A0%B4%E7%99%BE%E4%B8%87token%E4%B8%8A%E4%B8%8B%E6%96%87%E4%BB%8E%E7%8E%AF%E5%BD%A2%E9%80%9A%E4%BF%A1%E5%88%B0%E8%AE%A1%E7%AE%97%E9%87%8D%E5%8F%A0%E7%9A%84%E6%8A%80%E6%9C%AF%E7%AA%81%E5%9B%B4/</link>
      <pubDate>Mon, 09 Mar 2026 05:30:47 +0800</pubDate>
      <guid>https://answer.freetools.me/ring-attention%E5%A6%82%E4%BD%95%E8%AE%A9%E5%A4%A7%E6%A8%A1%E5%9E%8B%E7%AA%81%E7%A0%B4%E7%99%BE%E4%B8%87token%E4%B8%8A%E4%B8%8B%E6%96%87%E4%BB%8E%E7%8E%AF%E5%BD%A2%E9%80%9A%E4%BF%A1%E5%88%B0%E8%AE%A1%E7%AE%97%E9%87%8D%E5%8F%A0%E7%9A%84%E6%8A%80%E6%9C%AF%E7%AA%81%E5%9B%B4/</guid>
      <description>深入解析Ring Attention如何通过分布式计算突破GPU内存瓶颈，实现百万乃至千万级Token上下文训练。从Blockwise Parallel Transformer的基础原理出发，系统阐述Online Softmax的分块计算、环形拓扑的通信计算重叠、Striped Attention的负载均衡优化，以及在World Model和长上下文LLM中的实际应用。涵盖内存复杂度分析、最小序列长度要求、NVLink/InfiniBand带宽约束，以及与DeepSpeed Ulysses、All-Gather等方案的工程对比。</description>
    </item>
  </channel>
</rss>
