LearnViz CompSci
Home / Learn / Computer Architecture & Logic / Cache Mapping

Intermediate Topic 27 of 51 Computer Architecture & Logic

Cache Mapping

Direct, set-associative and fully associative placement policies.

How it works

Cache mapping decides which cache lines a memory block may occupy. In a direct-mapped cache each block maps to exactly one line, determined by the index bits of the address; in a fully associative cache it can go anywhere; in an n-way set-associative cache it maps to one set and can occupy any of n lines within it. The address splits into tag, index and offset fields.

Step-by-step walkthrough

  1. Direct mapped: each memory block has exactly one possible line.
  2. Blocks 0 and 4 both want line 0 and keep evicting each other.
  3. Set associative: a block may go in any way of its set.
  4. Both blocks can now stay in the cache.
  5. Fully associative allows any line but needs the most comparators.

Where it is used

CPU caches mostly use set-associative designs, which balance cost and conflict misses. TLBs and some software caches use similar mappings. Understanding the tag, index and offset helps compute hit rates in exam problems and in performance analysis.

Common pitfall

Direct-mapped caches suffer conflict misses when two hot addresses map to the same line. Higher associativity reduces conflicts but increases latency, area and power. Miscomputing the number of index bits is a common error. Power-of-two array strides can alias to the same sets.

Where it fits in the course

Cache Mapping is topic 27 of 51 in Computer Architecture & Logic, rated Intermediate. It follows Cache Memory. The next topic is Cache Replacement Policies.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Computer Architecture & Logic quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Cache Mapping?
Direct, set-associative and fully associative placement policies. It belongs to Computer Architecture & Logic and is an intermediate-level topic.
Where do people use Cache Mapping?
CPU caches mostly use set-associative designs, which balance cost and conflict misses.
What is the most common mistake with Cache Mapping?
Direct-mapped caches suffer conflict misses when two hot addresses map to the same line.
What should I learn before this topic?
Start with Cache Memory, the topic just before it in Computer Architecture & Logic.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Computer Architecture & Logic quiz.
Is Cache Mapping hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Cache Mapping?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Cache Mapping?
Cache Memory, Cache Replacement Policies, Memory Hierarchy are closely connected. The full list is in the related topics section of this page.
What should I study after Cache Mapping?
Continue with Cache Replacement Policies, the next topic in Computer Architecture & Logic.

Related topics