<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>Vllm on k4i's blog</title><link>https://k4i.top/zh/tags/vllm/</link><description>Recent content in Vllm on k4i's blog</description><generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>sky_io@outlook.com (K4i)</managingEditor><webMaster>sky_io@outlook.com (K4i)</webMaster><copyright>All content is subject to the license of &lt;a rel="license noopener" href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank"&gt;CC BY-NC-SA 4.0&lt;/a&gt; .</copyright><lastBuildDate>Wed, 22 Apr 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://k4i.top/zh/tags/vllm/index.xml" rel="self" type="application/rss+xml"/><item><title>Paged Attention：GPU 上的虚拟内存</title><link>https://k4i.top/zh/posts/paged-attention/</link><pubDate>Wed, 22 Apr 2026 10:00:00 +0800</pubDate><author>sky_io@outlook.com (K4i)</author><atom:modified>Sat, 30 May 2026 00:04:33 +0800</atom:modified><guid>https://k4i.top/zh/posts/paged-attention/</guid><description>&lt;h2 id="memory-management-problem"&gt;显存管理问题&lt;/h2&gt;
&lt;h3 id="fragmentation"&gt;碎片化问题&lt;/h3&gt;
&lt;p&gt;上一篇 &lt;a href="https://k4i.top/zh/posts/kv-cache/"&gt;KV cache&lt;/a&gt; 解释了为什么自回归解码可以缓存 key 和 value。KV cache 帮我们避免了大量重复计算，但也引出了一个新的系统问题：&lt;strong&gt;这些不断增长的缓存到底放在哪里？&lt;/strong&gt;&lt;/p&gt;</description><dc:creator>K4i</dc:creator><media:content url="https://k4i.top//images/posts/paged-attention/cover.svg" medium="image"><media:title type="html">featured image</media:title></media:content><category>llm</category><category>推理</category><category>systems</category><category>vllm</category><category>memory</category><category>AI</category><category>LLM Inference Internals</category></item></channel></rss>