AboutHow we built thisSponsorshipShop
SearchSubscribeDecision ToolsBusiness ModelsFrameworksReading Lists
Privacy PolicyTerms of UseCookie PolicyRefund PolicyAccessibilityDisclaimer

© 2026 Faster Than Normal. All rights reserved.

Faster Than Normal
DecisionsPeopleBusinessesNewsletterSubscribe
Start reading →
  1. Home
  2. Mental models
  3. Least Recently Used
Computer Science & Algorithms

Least Recently Used

Model #0667Category: Computer Science & AlgorithmsDepth to apply:
4 min read

On this page

  • Core Idea
  • How to See It
  • How to Use It
  • Founders & Leaders
  • Connected Models
  • One Key Quote
  • Summary & Further Reading

Contents

  1. 1. Core Idea
  2. 2. How to See It
  3. 3. How to Use It
  4. 4. Founders & Leaders
  5. 5. Connected Models
  6. 6. One Key Quote
  7. 7. Summary & Further Reading
·Computer Science & Algorithms
Section 1

Core Idea

LRU (Least Recently Used) is a cache eviction policy: when the cache is full, evict the item that was used longest ago. It assumes temporal locality—recently used items are more likely to be used again. Simple to implement (e.g. doubly linked list + hash map) and often near-optimal in practice for request sequences with locality. Belady's algorithm (evict the page used farthest in the future) is optimal but unrealisable without a crystal ball; LRU is a practical heuristic that performs well when the workload has recency. Used everywhere: CPU caches, CDNs, in-memory caches, and any bounded buffer where you must choose what to keep.
Section 2

How to See It

Deciding & Judging
You're seeing Least Recently Used when a system with limited capacity (cache, queue, attention) drops or deprioritises whatever hasn't been touched lately—"use it or lose it" by recency. Prioritisation is effectively LRU when the rule is "keep the recently active, drop the rest."
Section 3

How to Use It

When you have a fixed-size store and must evict something, LRU is the default when recency predicts future use. Implement with O(1) lookup and move-to-front on access. If the workload has different locality (e.g. scan-heavy), consider variants (LRU-K, adaptive) or a different policy. In decisions: "what have we not looked at lately?" often identifies candidates to deprioritise or drop.
Decision filter
"Do we have a bounded resource and a stream of requests? If recency predicts future need, evict least recently used. If the access pattern is different, choose or adapt the policy accordingly."
As a founder
Backlogs, feature lists, and partner pipelines are caches: limited slots, constant churn. LRU thinking—deprioritise or drop what hasn't been touched recently—keeps focus on what's active. Avoid hoarding "someday" items; if it hasn't been used lately, it's a candidate to evict.
Section 5

Founders & Leaders

Jensen HuangCo-founder & CEO, NVIDIA
Huang built NVIDIA around high-throughput memory hierarchies and caching at scale. LRU and its variants are central to GPU memory management and data pipelines—what to keep in fast memory, what to evict. Founders can take the lesson: bounded capacity means eviction policy; recency is a strong default when the future resembles the recent past.
Section 7

Connected Models

Reinforces
Belady's Algorithm
Belady's algorithm is the optimal offline eviction policy (evict the page used farthest in the future). LRU is a practical online approximation; when locality holds, LRU performs close to Belady. Same problem, different information.
Tension
Scheduling & Prioritization
Scheduling orders work by priority or due date; LRU orders eviction by recency. The tension: scheduling is about "what to do next"; LRU is "what to drop." Both allocate scarce capacity under a simple rule.
Leads-to
Binary Search
Caches make search fast by keeping hot data in a small, fast store. LRU decides what stays in that store. Binary search assumes sorted data; caching (with LRU) assumes locality. Together they reduce cost of repeated access.
Section 8

One Key Quote

"LRU exploits temporal locality: the assumption that recently referenced items are more likely to be referenced again." When that holds, it's simple and effective; when it doesn't, adapt or switch policy.
— Classic systems literature
Section 11

Summary & Further Reading

LRU evicts the least recently used item when capacity is full. It assumes temporal locality and is easy to implement with O(1) operations. Use it for caches and any bounded buffer where recency predicts future use; tune or replace when the access pattern differs.
01
Introduction to Algorithms — CLRS (2009)
Book
Covers cache policies, amortised analysis, and data structures for LRU-style eviction.
02
Algorithms to Live By — Christian & Griffiths (2016)
Book
Applies caching and LRU to human attention, storage, and prioritisation.
03
Belady's Algorithm — FTN
Internal
Optimal offline eviction; LRU is the practical online counterpart.

Why this matters next

mental modelsBelady's Algorithm

Least Recently Used applied the Belady's Algorithm mental model

mental modelsScale

Least Recently Used applied the Scale mental model

mental modelsLeast Recently Used

Least Recently Used applied the Least Recently Used mental model

mental modelsBuffer

Least Recently Used applied the Buffer mental model

mental modelsBinary Search

Least Recently Used applied the Binary Search mental model

mental modelsScheduling & Prioritization

Least Recently Used applied the Scheduling & Prioritization mental model

Frequently asked questions

What is Least Recently Used?+

Least Recently Used is a mental model used for better thinking and decision-making.

How do you apply Least Recently Used?+

To apply Least Recently Used, identify situations where this framework is relevant, then use it as a lens to evaluate your options and decisions. The model is most useful when combined with other complementary mental models.

What category does Least Recently Used fall under?+

Least Recently Used falls under the Computer Science & Algorithms category of mental models. Other models in this category can be found on the Computer Science & Algorithms hub page.

Why is Least Recently Used important?+

Least Recently Used is important because it provides a structured way to think about problems that would otherwise be approached with intuition alone. Understanding this model helps you avoid common reasoning errors and make better decisions.

Continue exploring

AB

Mental model

Abstraction

The practice of hiding complexity behind a simpler interface, enabling reasoning

ET

Mental model

Explore-exploit Tradeoff

The fundamental tension between gathering new information (exploring) and levera

ML

Mental model

Metcalfe's Law

The value of a network grows proportionally to the square of the number of its u

ML

Mental model

Moore's Law

The observation that transistor counts on integrated circuits double roughly eve

MM

Mental model

Mythical Man Month

Brooks's Law: adding people to a late software project makes it later due to com

TD

Mental model

Technical Debt

The accumulated cost of expedient decisions in software and systems that must ev

More like this, in your inbox

I send a newsletter every week — free, no spam, unsubscribe anytime.

Or open the full subscribe page.

On this page

  • Core Idea
  • How to See It
  • How to Use It
  • Founders & Leaders
  • Connected Models
  • One Key Quote
  • Summary & Further Reading

Popular Mental Models

First Principles ThinkingOccam's RazorCircle of CompetenceInversionConfirmation BiasSecond-Order ThinkingDunning-Kruger EffectSurvivorship BiasPareto PrincipleOpportunity Cost