<?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 Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%97%A0%E9%94%81/</link><description>Recent content in 无锁 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Sat, 24 Jan 2026 13:08:42 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%97%A0%E9%94%81/index.xml" rel="self" type="application/rss+xml"/><item><title>什么是 Wait-Free 算法：并发中的最高进度保证</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/wait-free-algorithms/</link><pubDate>Sat, 24 Jan 2026 13:08:42 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/wait-free-algorithms/</guid><description>解释 wait-free 的含义，与 lock-free/obstruction-free 的区别，并给出实践理解。</description></item></channel></rss>