Scribd
Upload
26 views1 page

Detailed Notes On Cache Mapping and Cache Mapping Techniques

Uploaded by

satyaki.mandal2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views1 page

Detailed Notes On Cache Mapping and Cache Mapping Techniques

Uploaded by

satyaki.mandal2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Detailed Notes on Cache Mapping and

Cache Mapping Techniques

Abstract
This document provides a comprehensive overview of cache mapping and its various
techniques, which are crucial for optimizing memory access in computer systems. It includes
detailed explanations of different cache mapping methods, important questions that may
arise in examinations, and their corresponding answers. Examples are provided to illustrate
the concepts effectively, ensuring a thorough understanding of the topic.

---

What is Cache Mapping?

Cache mapping refers to the method used to determine how data from the main memory is
stored in the cache memory. Cache memory is a small-sized type of volatile computer
memory that provides high-speed data access to the processor. The primary goal of cache
mapping is to improve the speed of data retrieval by keeping frequently accessed data
closer to the CPU.

Importance of Cache Mapping


• Speed: Reduces the time taken to access data.
• Efficiency: Optimizes the use of cache memory.
• Performance: Enhances overall system performance by minimizing latency.

Cache Mapping Techniques

There are three primary cache mapping techniques:

1. Direct Mapping
2. Associative Mapping
3. Set-Associative Mapping

1. Direct Mapping

In direct mapping, each block of main memory maps to exactly one cache line. The mapping
is done using a simple modulo operation.

#### Example:
• Suppose we have a cache with 4 lines and main memory with 16 blocks.
• The mapping formula is: Cache Line = (Block Number) mod (Number of Cache Lines)

• For Block 5: Cache Line = 5 mod 4 = 1


• Block 5 will be stored in Cache Line 1.

#### Advantages:
• Simple and easy to implement.
• Low hardware cost.

#### Disadvantages:
• High conflict misses if multiple blocks map to the same cache line.

2. Associative Mapping

In associative mapping, a block can be placed in any cache line. The cache uses a tag to
identify which block is stored in which line.

#### Example:
• If a block from main memory is loaded into the cache, it can go into any line.
• The cache checks all lines to find the block using its tag.

#### Advantages:
• Reduces conflict misses.
• More flexible than direct mapping.

#### Disadvantages:
• More complex and expensive due to the need for additional hardware to search the
cache.

3. Set-Associative Mapping

Set-associative mapping is a hybrid of direct and associative mapping. The cache is divided
into several sets, and each set contains multiple lines. A block can be placed in any line within
a specific set.

#### Example:
• If we have a 4-line cache divided into 2 sets (2 lines per set), Block 5 can go into either
line of Set 1 or Set 2 based on the mapping.
• The mapping formula is: Set Number = (Block Number) mod (Number of Sets)

#### Advantages:
• Balances the benefits of both direct and associative mapping.
• Reduces conflict misses while being less complex than fully associative mapping.

#### Disadvantages:
• More complex than direct mapping.
• Slightly higher cost due to additional hardware.

Important Exam Questions

Short Questions

1. What is cache mapping?


• Answer: Cache mapping is the method used to determine how data from the
main memory is stored in the cache memory, optimizing data retrieval speed.

2. Name the three cache mapping techniques.


• Answer: The three cache mapping techniques are Direct Mapping, Associative
Mapping, and Set-Associative Mapping.

Long Questions

1. Explain Direct Mapping with an example.


• Answer: Direct Mapping is a cache mapping technique where each block of
main memory maps to exactly one cache line. For instance, if a cache has 4 lines
and main memory has 16 blocks, the mapping can be calculated using the
formula: Cache Line = (Block Number) mod (Number of Cache Lines). For Block
5, it would be 5 mod 4 = 1, meaning Block 5 is stored in Cache Line 1. This
method is simple but can lead to high conflict misses.

2. Discuss the advantages and disadvantages of Associative Mapping.


• Answer: Associative Mapping allows any block to be placed in any cache line,
using a tag to identify the block. The advantages include reduced conflict
misses and greater flexibility. However, it is more complex and expensive due
to the additional hardware required for searching the cache. For example, if a
block from main memory is loaded, the cache checks all lines to find the block
using its tag, which can slow down access times compared to direct mapping.

3. Compare Set-Associative Mapping with Direct Mapping.


• Answer: Set-Associative Mapping is a hybrid technique that divides the cache
into sets, allowing a block to be placed in any line within a specific set. In
contrast, Direct Mapping restricts each block to a specific cache line.
Set-Associative Mapping reduces conflict misses and balances complexity and
cost, while Direct Mapping is simpler and cheaper but may suffer from higher
conflict misses. For example, in a 4-line cache divided into 2 sets, a block can
go into either line of a set, providing more flexibility than direct mapping.

---

This document serves as a detailed guide for understanding cache mapping and its
techniques, providing essential information for exam preparation.

You might also like