<?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/%E7%B3%BB%E7%BB%9F%E8%AE%BE%E8%AE%A1/</link><description>Recent content in 系统设计 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Sat, 28 Feb 2026 11:03:15 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E7%B3%BB%E7%BB%9F%E8%AE%BE%E8%AE%A1/index.xml" rel="self" type="application/rss+xml"/><item><title>手写一个基础消息代理：发布、订阅、重试与失败契约</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-message-broker/</link><pubDate>Sat, 28 Feb 2026 11:03:15 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-message-broker/</guid><description>从发布订阅到重试与失败契约，系统讲解基础消息代理的实现与工程边界。</description></item><item><title>如何设计去中心化 P2P 系统：节点、发现与一致性</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/design-decentralized-p2p-system/</link><pubDate>Sat, 24 Jan 2026 13:27:25 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/design-decentralized-p2p-system/</guid><description>从节点发现、路由与一致性角度介绍 P2P 系统设计。</description></item><item><title>为什么 CGI 的扩展性不好：进程模型的代价</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/cgi-scalability-issues/</link><pubDate>Sat, 24 Jan 2026 13:27:25 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/architecture/cgi-scalability-issues/</guid><description>解释 CGI 进程模型的性能瓶颈与扩展性问题。</description></item><item><title>如何设计磁盘碎片整理：目标、步骤与权衡</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/filesystem-defragmentation-design/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/filesystem-defragmentation-design/</guid><description>从工程角度设计碎片整理流程，并给出简化可运行示例。</description></item><item><title>写一个基础 Web 服务器：最小可用实现</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-web-server/</link><pubDate>Sat, 24 Jan 2026 13:20:24 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/algorithm/basic-web-server/</guid><description>用最小可运行示例解释 HTTP 服务的核心流程。</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><item><title>缓存大小如何确定：命中率、成本与稳定性</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/cache-sizing-principles/</link><pubDate>Sat, 24 Jan 2026 11:06:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/cache-sizing-principles/</guid><description>从命中率、成本与一致性风险出发，给出缓存大小的工程化确定方法与示例。</description></item><item><title>什么是流式处理（Streaming）：概念与实现方式</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/streaming-basics/</link><pubDate>Sat, 24 Jan 2026 11:06:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/streaming-basics/</guid><description>解释流式处理的核心概念与实现方式，并给出可运行的最小示例。</description></item><item><title>什么是实时系统：与普通系统的关键区别</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/real-time-systems-basics/</link><pubDate>Sat, 24 Jan 2026 11:06:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/real-time-systems-basics/</guid><description>从时限约束与确定性出发，解释实时系统与普通系统的区别，并给出落地实践与示例。</description></item><item><title>实时语言与堆内存分配：为什么动态分配会破坏实时性</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/real-time-language-heap-allocation/</link><pubDate>Sat, 24 Jan 2026 11:06:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/system/real-time-language-heap-allocation/</guid><description>解释实时系统为什么回避堆分配与 GC，并给出可落地的内存管理策略。</description></item><item><title>任务编排为什么要放后端：让流程可控、可变、可回放</title><link>https://shio-chan-dev.github.io/jeanblog/zh/dev/python/pipeline-orchestration/</link><pubDate>Tue, 13 Jan 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/dev/python/pipeline-orchestration/</guid><description>用通俗语言解释“后端任务编排”的必要性：把流程顺序从前端移到后端，用配置驱动步骤与等待点。给出最小可运行示例、落地步骤与常见坑。</description></item></channel></rss>