<?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/categories/%E5%B9%B6%E5%8F%91/</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:27:25 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/categories/%E5%B9%B6%E5%8F%91/index.xml" rel="self" type="application/rss+xml"/><item><title>如何向祖母解释线程：一个厨房的类比</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/explain-thread-to-grandma/</link><pubDate>Sat, 24 Jan 2026 13:27:25 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/explain-thread-to-grandma/</guid><description>用生活类比解释线程与并发的基本概念。</description></item><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><item><title>线程饿死（Starvation）：为什么有线程永远拿不到资源</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/starvation-basics/</link><pubDate>Sat, 24 Jan 2026 13:08:42 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/starvation-basics/</guid><description>解释线程饿死的成因、影响与工程预防策略。</description></item><item><title>什么是竞争条件：Race Condition 的本质与示例</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/race-condition-basics/</link><pubDate>Sat, 24 Jan 2026 11:11:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/race-condition-basics/</guid><description>用可运行示例解释竞态条件的形成原因，并给出工程层面的规避策略。</description></item><item><title>什么是死锁：成因、示例与规避策略</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/deadlock-basics-general/</link><pubDate>Sat, 24 Jan 2026 11:11:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/deadlock-basics-general/</guid><description>用可运行示例解释死锁的成因，并给出工程上的规避策略。</description></item><item><title>为什么并发测试很难：非确定性与时序爆炸</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/testing-concurrency-is-hard/</link><pubDate>Sat, 24 Jan 2026 11:11:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/testing-concurrency-is-hard/</guid><description>从非确定性、时序组合爆炸与可复现性角度解释并发测试的难点，并给出缓解策略。</description></item><item><title>为什么需要并发：吞吐、延迟与资源利用率</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/why-concurrency/</link><pubDate>Sat, 24 Jan 2026 11:11:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/concurrency/why-concurrency/</guid><description>从 I/O 等待、吞吐与响应时间出发解释并发的必要性，并给出可运行示例与落地建议。</description></item></channel></rss>