<?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>Kv-Cache on LLM Stories</title><link>https://wgzesg.github.io/llm_stories/tags/kv-cache/</link><description>Recent content in Kv-Cache on LLM Stories</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 09 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wgzesg.github.io/llm_stories/tags/kv-cache/index.xml" rel="self" type="application/rss+xml"/><item><title>ORCA and Chunked Prefill: Evening Out the Iteration</title><link>https://wgzesg.github.io/llm_stories/posts/05-orca-and-chunked-prefill/</link><pubDate>Wed, 06 May 2026 00:00:00 +0000</pubDate><guid>https://wgzesg.github.io/llm_stories/posts/05-orca-and-chunked-prefill/</guid><description>How iteration-level scheduling (ORCA) and chunked prefill flatten per-iteration cost. We walk the cost variance, see what ORCA fixes and what it leaves open, and watch chunked prefill bound the longest iteration.</description></item><item><title>Prefill and Decode Disaggregation: Two Phases on Opposite Sides of the Roofline</title><link>https://wgzesg.github.io/llm_stories/posts/06-prefill-decode-disaggregation/</link><pubDate>Sat, 09 May 2026 00:00:00 +0000</pubDate><guid>https://wgzesg.github.io/llm_stories/posts/06-prefill-decode-disaggregation/</guid><description>A roofline-first argument for prefill/decode disaggregation. Defines arithmetic intensity, derives that intensity ≈ tokens-per-iteration for transformers, sweeps context length to show decode falling further below the ridge as L grows, then walks through the split and the KV-transfer cost it introduces.</description></item></channel></rss>