<?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%B7%A5%E4%BD%9C%E7%AA%83%E5%8F%96/</link>
    <description>Recent content in 工作窃取 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Tue, 10 Mar 2026 17:01:32 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E5%B7%A5%E4%BD%9C%E7%AA%83%E5%8F%96/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>工作窃取算法为何能用O(PD)次窃取完成并行计算：从理论证明到工程实现的二十年演进</title>
      <link>https://answer.freetools.me/%E5%B7%A5%E4%BD%9C%E7%AA%83%E5%8F%96%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8opd%E6%AC%A1%E7%AA%83%E5%8F%96%E5%AE%8C%E6%88%90%E5%B9%B6%E8%A1%8C%E8%AE%A1%E7%AE%97%E4%BB%8E%E7%90%86%E8%AE%BA%E8%AF%81%E6%98%8E%E5%88%B0%E5%B7%A5%E7%A8%8B%E5%AE%9E%E7%8E%B0%E7%9A%84%E4%BA%8C%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B/</link>
      <pubDate>Tue, 10 Mar 2026 17:01:32 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%B7%A5%E4%BD%9C%E7%AA%83%E5%8F%96%E7%AE%97%E6%B3%95%E4%B8%BA%E4%BD%95%E8%83%BD%E7%94%A8opd%E6%AC%A1%E7%AA%83%E5%8F%96%E5%AE%8C%E6%88%90%E5%B9%B6%E8%A1%8C%E8%AE%A1%E7%AE%97%E4%BB%8E%E7%90%86%E8%AE%BA%E8%AF%81%E6%98%8E%E5%88%B0%E5%B7%A5%E7%A8%8B%E5%AE%9E%E7%8E%B0%E7%9A%84%E4%BA%8C%E5%8D%81%E5%B9%B4%E6%BC%94%E8%BF%9B/</guid>
      <description>深入解析工作窃取调度算法的数学原理与实践权衡：从Blumofe-Leiserson 1999年的理论奠基，到Chase-Lev无锁双端队列，再到Java ForkJoinPool、Go GMP、Tokio的工程实现。涵盖期望窃取次数O(PD)的证明思路、窃取策略对比（steal-one vs steal-half）、缓存局部性挑战、NUMA架构困境，以及从Cilk到现代运行时的完整技术演进。</description>
    </item>
  </channel>
</rss>
