Virtual memory explained as a dialogue between a process and the Linux kernel
The article explores virtual memory in Linux through a dialogue between a process named Alloca and the kernel, explaining how memory management impacts system performance. It covers core concepts such as page tables, TLBs, demand paging, and memory isolation in a narrative format. The piece serves as an in-depth guide for understanding and optimizing memory usage in data-intensive applications.
- ▪Virtual memory provides process isolation, memory protection, and the illusion of abundant memory for each process.
- ▪The article uses a dialogue format between a process and the Linux kernel to explain complex memory management concepts incrementally.
- ▪Key mechanisms covered include demand paging, copy-on-write, memory-mapped I/O, page reclaim, and performance effects from TLBs and NUMA topology.
- ▪Address translation relies on hierarchical page tables and hardware components like the MMU and TLB to map virtual addresses to physical memory.
- ▪The article includes practical observability techniques for monitoring VMAs, page faults, RSS/PSS, and NUMA placement on Linux systems.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Hacker News (Newest) |
| Canonical URL | https://blog.codingconfessions.com/p/virtual-memory |
| Publication time | Sat, 16 May 2026 14:33:53 +0000 |
| Retrieval time | 2026-05-16T14:40:18.792Z |
| Last seen | 2026-05-16T14:40:18.792Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | OoCxaiXV1GuI |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Virtual Memory: A Deep Dive into Page Tables, TLBs, and Linux InternalsFrom page faults to NUMA topology: how the Linux kernel manages memory, and what that means for the performance of data-intensive systems.Abhinav UpadhyayMay 10, 202653112ShareA quick note before we begin: I’ve been absent here for a while. Life happened, and I had to step away from publishing for longer than I expected.This article is my way of getting back into rhythm. It is much larger than my usual pieces: roughly 25,000 words, compared to the 4,000–6,000 words I normally publish.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Hacker News (Newest).
Discussion
0 commentsMore from Hacker News (Newest)
