<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Efficient Memory Management for Large Language Model Serving with PagedAttention · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2309.06180/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2309.06180/feed.xml" rel="self" type="application/rss+xml" /><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — mentioned by jbarrow</title><link>https://news.ycombinator.com/item?id=46856317</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.06180:46856317</guid><pubDate>Mon, 02 Feb 2026 14:18:19 GMT</pubDate><description>&lt;p&gt;The whole thing feels AI written, generated from the codebase.* *this is incorrect per the author’s response, my apologies. For instance, it goes into (nano)vLLM internals and doesn’t mention PagedAttention once (one of the core ideas that vLLM is based on)[1]. Also mentions that Part 2 will cover dense vs MoE’s, which is weird because nanovllm hardcodes a dense Qwen3 into the source. Here are better (imo) explainers about how vLLM works: - https://hamzaelshafie.bearblog.dev/paged-attention-from-firs... - https://www.aleksagordic.com/blog/vllm - https://huggingface.co/blog/continuous_batching…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — HN submission</title><link>https://news.ycombinator.com/item?id=43837916</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.06180:43837916</guid><pubDate>Tue, 29 Apr 2025 20:51:44 GMT</pubDate><description>&lt;p&gt;Efficient Memory Management for Large Language Model Serving with PagedAttention&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — mentioned by jmorgan</title><link>https://news.ycombinator.com/item?id=42833836</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.06180:42833836</guid><pubDate>Sun, 26 Jan 2025 20:38:28 GMT</pubDate><description>&lt;p&gt;Sorry this isn&amp;#x27;t more obvious. Ideally VRAM usage for the context window (the KV cache) becomes dynamic, starting small and growing with token usage, whereas right now Ollama defaults to a size of 2K which can be overridden at runtime. A great example of this is vLLM&amp;#x27;s PagedAttention implementation [1] or Microsoft&amp;#x27;s vAttention [2] which is CUDA-specific (and there are quite a few others). 1M tokens will definitely require a lot of KV cache memory. One way to reduce the memory footprint is to use KV cache quantization, which has recently been added behind a flag [3] and will 1/4 the memory…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — mentioned by AaronFriel</title><link>https://news.ycombinator.com/item?id=40369939</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.06180:40369939</guid><pubDate>Wed, 15 May 2024 17:32:21 GMT</pubDate><description>&lt;p&gt;The PagedAttention paper is a good starting point as it represents the first major open source inference engine that had &amp;quot;pretty good&amp;quot; batch performance for transformers. https://arxiv.org/pdf/2309.06180&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — mentioned by AaronFriel</title><link>https://news.ycombinator.com/item?id=39854164</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.06180:39854164</guid><pubDate>Thu, 28 Mar 2024 16:49:40 GMT</pubDate><description>&lt;p&gt;It indeed is. An attention mechanism&amp;#x27;s key and value matrices grow linearly with context length. With PagedAttention[1], we could imagine an external service providing context. The hard part is the how, of course. We can&amp;#x27;t load our entire database in every conversation, and I suspect there are also challenges around training (perhaps addressed via LandmarkAttention[2]) and building a service efficiently retrieve additional key-value matrices. The external service vector database may require tight timings necessary to avoid stalling LLMs. To manage 20-50 tokens/sec, answers must arrive within…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Efficient Memory Management for Large Language Model Serving with PagedAttention — HN submission</title><link>https://news.ycombinator.com/item?id=37509659</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.06180:37509659</guid><pubDate>Thu, 14 Sep 2023 14:42:03 GMT</pubDate><description>&lt;p&gt;Efficient Memory Management for Large Language Model Serving with PagedAttention&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;102 points; 16 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.06180/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
