ConceptEngineering
Memory hierarchy
A structure of different memory types in a computer organized by capacity, speed, and cost, resembling a funnel from large/slow storage to fast/small processor storage.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Computer architecture basics3CPU2RAM2Bandwidth1Basic computer architecture1Cache memories1DRAM1Hard disk drive1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Onur Mutlu
A hierarchical structure organizing memory from large, slow storage to small, fast caches and registers.Erik Demaine
The organization of computer storage into multiple levels with increasing capacities and increasing access latencies as you move further from the CPU.
Lectures that assume it
26The first 12 are shown.
- Cache-Oblivious Algorithms
- Let's Reproduce GPT-2 (124M): Distributed PyTorch, FlashAttention & FineWeb
- Bit Hacks
- Green HPC: Paving the Way for Sustainable Supercomputing
- Sorting & Aggregation Algorithms
- Dynamic Connectivity Lower Bound
- History of Memory Models
- Memory Controller Microarchitecture, Row Policies & Request Scheduling
- Cache-Oblivious Algorithms: Searching & Sorting
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Modern Systems Programming in Pure C: Memory Ownership, APIs & Debugging
- R2. 2-3 Trees and B-Trees
Connections
39The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures32
- Cache-Oblivious Algorithms: Medians and Matrices
- Memory Organization, Technology, Hierarchy & Caches (ETH Zürich, Digital Design and Computer Architecture, Lecture 21)
- Hardware
- GPU Architectures II & Memory Overview and Technology (ETH Zürich, Digital Design and Computer Architecture, Lecture 20)
- Caches (Digital Design and Computer Architecture, ETH Zürich, Spring 2025, Lecture 22)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
Show 26 moreShow fewer
- Cache-Oblivious Algorithms
- Let's Reproduce GPT-2 (124M): Distributed PyTorch, FlashAttention & FineWeb
- Bit Hacks
- Green HPC: Paving the Way for Sustainable Supercomputing
- Sorting & Aggregation Algorithms
- Dynamic Connectivity Lower Bound
- History of Memory Models
- Memory Controller Microarchitecture, Row Policies & Request Scheduling
- Cache-Oblivious Algorithms: Searching & Sorting
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Modern Systems Programming in Pure C: Memory Ownership, APIs & Debugging
- R2. 2-3 Trees and B-Trees
- Memory Hierarchy Models
- Sirius: A GPU-Native SQL Engine
- Processing Inside NAND Flash Memory
- Prefetching II, Processing-in-Memory, and Parting Thoughts (ETH Zürich: Digital Design and Computer Architecture, Lecture 25)
- Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
- Parallel Computing: Why Parallelism? Why Efficiency?
- How I Learned to Stop Worrying and Love the Transformer
- Caches II and Prefetching (ETH Zürich, Digital Design and Computer Architecture, Lecture 23)
- Virtual Memory
- Load-Store Handling in Out-of-Order Execution
- Data-Oriented Design for Mortals
- From Unicorns to Centaurs: Powering the AI Moonshot
- Topics in Algorithms Research
- Porting Ideas, Not Code: Reimagining Clojure and Datomic Concepts in a Language-Agnostic Data Platform