L-3.6: Direct Mapping with Example in Hindi | Cache Mapping | Computer Organisation and Architecture

TL;DR

This video explains the concept of direct mapping in computer architecture, including block division, cache size, line number, block offset, address generation, and cache hit/miss.

Transcript

Hello friends, welcome to Gate Smashers In today's video we are going to discuss Direct Mapping As in last video we discussed about cache Mapping How many ways we can do mapping Either it is Direct, Fully Associative or K-way Set Associative So in this video we are going to talk about Direct Mapping And in this video I am going to discuss a... Read More

Key Insights

• 🫥 Direct mapping is a cache mapping technique that assigns each block of the main memory to a specific line in the cache based on the formula K mod N.
• 🚫 The main memory is divided into fixed-size blocks, with this example using 4 words per block, and the cache is divided into lines to accommodate the blocks.
• 🚫 CPU generates physical addresses to access specific words in the main memory, and the address is divided into block number and block offset.
• 🎁 Cache hit occurs when the requested block or word is already present in the cache, while cache miss occurs when it is not present, requiring replacement.

Summary & Key Takeaways

• Direct mapping is a cache mapping technique that involves dividing the main memory into fixed-size blocks and mapping them to specific lines in the cache.

• The size of the main memory is 128 words, with 4 words per block, resulting in a total of 32 blocks.

• CPU generates addresses for accessing specific words in the memory and can determine the corresponding line and block offset using the direct mapping formula.