BestHub
Sign in
Tagged articles

page replacement

7 articles · Page 1 of 1
IT Learning Made Simple
IT Learning Made Simple
Sep 1, 2026 · Fundamentals

Why LRU Evicts the Least Recently Used Page First

The article explains the LRU (Least Recently Used) page‑replacement algorithm, its basis in the locality principle, hit‑rate example, various exact and approximate implementations—including counter, stack, linked‑list, Clock, Aging and Working‑Set methods—its hardware requirements, pros and cons, and practical uses such as a Python cache and Redis eviction policies.

LRUPythonRedis
0 likes · 10 min read
Why LRU Evicts the Least Recently Used Page First
IT Learning Made Simple
IT Learning Made Simple
Aug 27, 2026 · Fundamentals

How Virtual Memory Lets Your Disk Pretend to Be RAM

The article explains how operating systems use virtual memory to extend physical RAM with disk space, covering concepts like paging, page tables, multi‑level tables, swap space, replacement algorithms (LRU, FIFO, LFU), and practical Python and JVM examples.

SwapVirtual Memorymemory management
0 likes · 8 min read
How Virtual Memory Lets Your Disk Pretend to Be RAM
Code Wrench
Code Wrench
Aug 21, 2024 · Fundamentals

OS Memory Management Explained: Allocation Strategies & Page Replacement in Go

This article delves into operating system memory management, covering continuous and fragmented allocation strategies such as First‑Fit, Next‑Fit, Best‑Fit, and Worst‑Fit, explains swapping and overlay techniques, analyzes page replacement algorithms like Optimal, FIFO, and LRU, and offers practical Go implementations and optimization tips.

Memoryallocationos
0 likes · 12 min read
OS Memory Management Explained: Allocation Strategies & Page Replacement in Go
IT Services Circle
IT Services Circle
Jun 10, 2022 · Fundamentals

Page Replacement Algorithms: OPT, FIFO, LRU, CLOCK, and LFU

This article reviews virtual memory concepts and explains five page replacement algorithms—Optimal (OPT), First‑In‑First‑Out (FIFO), Least Recently Used (LRU), CLOCK (including a simple and improved version), and Least Frequently Used (LFU)—detailing their principles, operation, advantages, drawbacks, and illustrative examples.

FIFOLRUOPT
0 likes · 14 min read
Page Replacement Algorithms: OPT, FIFO, LRU, CLOCK, and LFU
Liangxu Linux
Liangxu Linux
Jan 10, 2021 · Fundamentals

Why Does Your Computer Need Virtual Memory? A Deep Dive into Memory Management

This article explains the fundamentals of operating‑system memory management, covering physical memory limits, the need for address spaces, base‑limit protection, paging, virtual memory mapping, page‑fault handling, and a comprehensive review of page‑replacement algorithms such as FIFO, LRU, Clock, and Working‑Set.

TLBVirtual Memoryaddress translation
0 likes · 26 min read
Why Does Your Computer Need Virtual Memory? A Deep Dive into Memory Management