The article explains paging as a memory‑management technique that divides physical memory into fixed‑size pages, maps virtual pages to page frames via page tables, uses multi‑level tables and a TLB for speed, and discusses its advantages, drawbacks, and practical workflow.
This article traces the evolution from real‑mode segmentation to modern paging, explains segment and page‑table structures on x86 and ARM, dissects kernel macros such as PGDIR_SHIFT and PUD_SHIFT, and demonstrates a kernel module that translates a process's virtual address to its physical address.
This article explains how Linux organizes physical memory, introduces virtual addressing, describes the structure of pages, zones, and nodes, and details the mechanisms of big‑ and small‑memory allocation, virtual address layout, page‑table translation, TLB caching, and virtual memory swapping.
This article provides an in‑depth exploration of the Linux mmap system call, covering its role in virtual memory management, page table structures, various mapping types (anonymous, file‑backed, shared, private), flag options, and advanced concepts such as huge pages and transparent huge pages, with kernel‑level diagrams and code examples.
This article explains how Linux manages memory by organizing physical pages, using zones and nodes, allocating memory with the buddy system and SLUB, structuring user and kernel virtual address spaces, and translating virtual addresses to physical ones via page tables, TLBs, and dynamic mapping.
The article explains the role of a Memory Management Unit (MMU) in translating virtual to physical addresses, managing page tables, providing memory protection and sharing, and why modern operating systems like Linux rely on it while some embedded systems can operate without one.
Async‑fork shifts the costly page‑table copying from Redis’s parent process to its child, allowing the parent to resume handling queries instantly and cutting snapshot‑induced latency spikes by over 98%, thereby dramatically improving tail latency during AOF rewrites, RDB backups, and master‑slave synchronizations.
This article explains the role of the Translation Lookaside Buffer (TLB) in virtual‑to‑physical address translation, details multi‑level page‑table walks, discusses aliasing and ambiguity issues across processes, and explores techniques such as ASID and global mappings to minimize costly TLB flushes.
This article explains the fundamentals of Translation Lookaside Buffers (TLB), their relationship with MMU and multi‑level page tables, how alias and ambiguity issues arise in multi‑process environments, and practical techniques such as ASID and global mapping to minimize costly TLB flushes.
This article explains the fundamentals of virtual memory, including paging, page tables, swap, and Linux management commands, highlighting how virtual memory abstracts physical addresses, resolves process memory conflicts, and enhances security and data sharing while providing practical tips for monitoring and tuning memory usage.
This article explains the fundamentals of computer memory, covering linear addresses, virtual memory translation, paging mechanisms, page size queries, and the structure of multi‑level page tables used by Linux to efficiently map virtual to physical memory.
