Sir you are literally saving our lives and grades....our college teacher teaches us for an hour and makes everything seem so difficult but your 10 min lectures are so easy to understand...thank you very much
I found Indian are good at comp architecture, many videos of computer architecture are made by them, I don’t know why. And even my professor is an Indian. What makes them topically good at this section? By the way, love this video, good explanation.
🎯 Key Takeaways for quick navigation: 00:00 🧠 Introduction to Cache Memory Mapping - The video introduces the concept of cache memory mapping. - Cache memory mapping involves how main memory data is mapped onto the cache memory. - Three categories of cache mapping are mentioned: direct mapping, associative mapping, and set-associative mapping. 01:09 🗺️ Direct Mapping Example - An example is presented using direct mapping. - The main memory is divided into pages, and the main memory has 4096 pages, each with 16 locations. - The video discusses the concept of locality of reference and how it impacts caching. 05:11 📊 Cache and Main Memory Size - Cache memory is divided into 128 frames, with each frame's size matching that of a page. - The video explains the relationship between cache memory size (C) and main memory space (P). 06:08 📉 Direct Mapping Details - Details about direct mapping are explained, such as how the main memory is divided into 32 blocks. - The relationship between page numbers and frame numbers in direct mapping is elaborated. 09:19 🚫 No Page Replacement in Direct Mapping - Direct mapping does not involve a page replacement algorithm. - The video provides an analogy to illustrate why page replacement is unnecessary in direct mapping. - It is emphasized that the page number directly determines the frame number in this mapping scheme. Made with HARPA AI
1. Page p in the main memory gets mapped to frame f in the cache if and only if p mod 128 = f. 2. Since many pages in the main memory can get mapped to the same frame f in the cache, we need some way to identify which page is in a frame. If the frame is f, the possible pages are all those p in the range 0 to 4095 where p mod 128 is f. For instance, pages 0,128 and 256 all get mapped to frame 0. Define tag = p/32. So, if tag for frame 0 is 0, it means frame 0 has page 0. If tag for frame 0 is 1, it means frame 0 has page 128. If tag for frame 0 is 2, it means frame 0 has page 256.
The main memory size is 16 bits, size must be equal to that of cache memory size, then how can cache memory size is (7+4) and main memory size be (12+4) ?
MAR page number can be further divided into sub sections namely TAG(5 bits) and frames per set(here only one set so we require 7 bits to represent total frames) 7+5+4 = 12+ 4 = 16 again
Thanks for this. Where is the five bits of the tag stored. Cache seems to have space only for the data pages. Say I get a main memory page I do the division and get to my cache page number . To make sure I got a hit I need to compare the tag right?
you supposed the 16 location per page, and after calculation that comes to be 16 bit address. You just got lucky or what i dont know. But, if I assume 11 location per page what will be the scenario? Do we have to just assume that location or there is certain way to calculate it?
How am I getting the formula Cache size= 2^n*(2^m*32+(32-n-m-2)+1) bits question A 32 bits byte address direct mapped cache defined as Cache size = 2^n block, n bits used for index Block size = 2^m block,m bits for word between block,2 used for byte part of address Size of tag field 32-(m+n+2) One valid bit field is used in cache Find the direct mapped cache size Plz answer ASAP🤔🙏🙏🙏
Get Certification in Computer Organization : bitly.ws/VGY4
Use coupon ""RUclips12"" to get “FLAT 12%’’ OFF at Checkout.
i love indians on youtube. computer engineering can't exist without your help guys. Thank you so much.
The indian gods of youtube always deliver
i mean there are a billion and a half of them and they like engineering a lot for some reason, so it's expected to be mostly by Indian
i'm not complaining lol, these videos are a huge huge help for all of us :D
Sir you are literally saving our lives and grades....our college teacher teaches us for an hour and makes everything seem so difficult but your 10 min lectures are so easy to understand...thank you very much
same here, from Germany!
Thank you very much. You were the ones who finally taught me the reason why caches blocks are divided in frames. Thank you very much!
Watch a video of an Indian teacher in 10 mins is much better than learn at university class, thank you Sir.
One of the most succinct explanations of cache memory I've seen in a while.
Sir u have the best time efficiency of teaching cache memory direct mapping among all youtubers(virtual teachers)
One of the best videos i have come across on cache memory mapping. Thank you Sir.
this gentleman teach everything in the computer
The way you introduce TAG...phenemonal....
This is premium education
This is the best video for explaining direct cached map
Sir g.. enddd 🔥
I have my finals tomorrow and here I'm studying from this channel
Last memory location of first row of main memory will be 128*31 = 3968 and last memory location of last of main memory will be 3964+127=4095
I am very lucky to get your guidance when you were in Jalpaiguri Town of West Bengal.
Gourab Deb
Is the lecturer from Jalpaiguri? :O
Great way of explaining direct cache. Thanks.
I found Indian are good at comp architecture, many videos of computer architecture are made by them, I don’t know why. And even my professor is an Indian.
What makes them topically good at this section?
By the way, love this video, good explanation.
Just Awesome Explanation,Thank You Tutorialspoint
🎯 Key Takeaways for quick navigation:
00:00 🧠 Introduction to Cache Memory Mapping
- The video introduces the concept of cache memory mapping.
- Cache memory mapping involves how main memory data is mapped onto the cache memory.
- Three categories of cache mapping are mentioned: direct mapping, associative mapping, and set-associative mapping.
01:09 🗺️ Direct Mapping Example
- An example is presented using direct mapping.
- The main memory is divided into pages, and the main memory has 4096 pages, each with 16 locations.
- The video discusses the concept of locality of reference and how it impacts caching.
05:11 📊 Cache and Main Memory Size
- Cache memory is divided into 128 frames, with each frame's size matching that of a page.
- The video explains the relationship between cache memory size (C) and main memory space (P).
06:08 📉 Direct Mapping Details
- Details about direct mapping are explained, such as how the main memory is divided into 32 blocks.
- The relationship between page numbers and frame numbers in direct mapping is elaborated.
09:19 🚫 No Page Replacement in Direct Mapping
- Direct mapping does not involve a page replacement algorithm.
- The video provides an analogy to illustrate why page replacement is unnecessary in direct mapping.
- It is emphasized that the page number directly determines the frame number in this mapping scheme.
Made with HARPA AI
6:23 Direct Mapping
Really Wonderful example which cleared all. But II think There must be 3968 at top instead of 3098.
Give reply pls anyone
kya samjhate ho sir ji...dil kush kar deta....
i am from an nit and my prof earns around 2.5 lakhs per month but he teaches so bad
its great that you do it for us virtually for free
AWWW
Amazing Explanation...Everyone like :)
1. Page p in the main memory gets mapped to frame f in the cache if and only if p mod 128 = f.
2. Since many pages in the main memory can get mapped to the same frame f in the cache, we need some way to identify which page is in a frame. If the frame is f, the possible pages are all those p in the range 0 to 4095 where p mod 128 is f. For instance, pages 0,128 and 256 all get mapped to frame 0. Define tag = p/32. So, if tag for frame 0 is 0, it means frame 0 has page 0. If tag for frame 0 is 1, it means frame 0 has page 128. If tag for frame 0 is 2, it means frame 0 has page 256.
good lecture sir and easy way of explanation.........
The railway example at the last moment was marvelous.
Cache me passing my exams, how bout dat lol
omg i hope you dont, jk
Catch the Raptors choking in the playoffs, how bout dat?
underrated comment of the year
Bruhhhhhh
I dont knw if i shud be proud of myself for knowing this reference.
Great explanation!! Why college teachers aren't like this?!
thank you very much. Every semester i am getting A+ scores as a result of your helpful tutorial videos
Work harder . Try to get an O
@@tathagatabanerjee8226 A+ is highest in most colleges
I love you sir.....jabbardast teaching i have ever seen....thank you Sir
The main memory size is 16 bits, size must be equal to that of cache memory size, then how can cache memory size is (7+4) and main memory size be (12+4) ?
this video was very helpful.
Please provide the link for the other videos as well
You can watch this link "www.tutorialspoint.com/videotutorials/userview.php?userid=MTExMjYwNjMxNTA0NTEw".
This video helped me a lot. Thank you.
You gave me a great idea about this context. Thank you sir. Best regarts
Good lectures Prof. Arnab Chakraborty. Can you please upload new videos?
Thank you.
Thank you sir. This video is really good.
its awsm Sir...best lecture i ever seen. Sashtang Parnaam.
Sir so nice explanation.Nice example of train coach....is same as direct mapping.Superb!!!!!!
Easily done. Didn't expect that it will be so easy.
MAR page number can be further divided into sub sections namely TAG(5 bits) and frames per set(here only one set so we require 7 bits to represent total frames)
7+5+4 = 12+ 4 = 16 again
you know this video is amazing when you keep saying "OHHHHHHH that's what it was"
Sir I Really Like Your Lecture Attitude... I Really Enjoy
Thank you sir, very helpful explanation.
best explanation ever
vry good explanation sir...thanks...
Amazing video sir.. this truly cleared my doubt.
the vedio is quite helpful...
hats off sir!!! extra ordinary explanation!!!
🙌 great teaching!
Explanation is Great though .. Can't ignore ❤️
nyc explanations ,sir
thanks for making it
Main memory last column should start from 3968 (pls correct me if I am wrong) because 3968+128=4096, or 128x31=3968
Good introduction of direct mapping
thank you sir this video help me a lot plz explain associative mapping
Very nice explanation
Thank you
Clearly understood now!wow, what a clear explaination!
explain associative mapping sir please
Why is this video, not in the playlist with other videos? please add the these necessary videos to the playlist.
The video was a bit helpful but please explain both the remaining mappings also.
Nicely expressed ❤️👌😇
Physical memory is divided into frames and logical memory into pages,unlike as said in the video. However,the rest part of the lecture is fine. :D
Thanks for this.
Where is the five bits of the tag stored. Cache seems to have space only for the data pages.
Say I get a main memory page I do the division and get to my cache page number . To make sure I got a hit I need to compare the tag right?
exellent video, thank you
Amazing explanation.
plz upload video for memory hierarcy by Prof. Arnab Chakraborty plz plzz.................
sir your explain is very good but direct memory la main memory 3 answer is 511 sir but your answer is 411 sir
i request you that video upload in lecture wise(i.e proper lecture numbering)
Very helpful, thank you Sir
Thank u sir. U have cleared all my doubts
about associative mapping
why direct mapping`s performance is directly proportional to the Hit ratio?
Wow thank you very much sir
welcome my child
Sir, good explanation
very helpful content
Thank you sir. it really helped me.
very excellent tutorial sir can we have remaining ones
kitna padhega vikram lol
Shubham Soni bahut badiya tut hai yaar
Shubham Soni aur tum bhi is tut me ho to iska matlab tumne dekha hoga
Is he doing word addressing or byte addressing?
Really awsome
Locaaa li tea of refaaarence😂 3:34
我太强了，我能听懂老师讲的是什么
great video helped alot
sir cashe me frames nahi hotein hein wo cashe lines hein
frame are available on ram
Aur block kaha hotein hai main memory mein na
you supposed the 16 location per page, and after calculation that comes to be 16 bit address. You just got lucky or what i dont know. But, if I assume 11 location per page what will be the scenario? Do we have to just assume that location or there is certain way to calculate it?
Superb sir
Thank you! But I think the numbers in the main memory, block 31 should be 3968, 3969, 3970, not 3098,... right?
You are Right
tqq for the lecture sir
384 and 256 want to load same time,then what is the process?? Please let me know sir..
Simply overwrite 384 ??
Very good tutorial. Thank you very much =]
sir could u plz explain why we placed 3098 at that coloum
Good explanation
sir where your next video?
nice video 👍
Kindly explain why 4096 was multiplied by 16 ,i thought it was supposed to be 2^2 ×2^10
really helpful
how many bits are needed for tag,block,word field?
If question is asked in exam .this is enough to write it sir????
Sir background noise in vedio please verify for NXT vedioes
How am I getting the formula
Cache size= 2^n*(2^m*32+(32-n-m-2)+1) bits
question
A 32 bits byte address direct mapped cache defined as
Cache size = 2^n block, n bits used for index
Block size = 2^m block,m bits for word between block,2 used for byte part of address
Size of tag field 32-(m+n+2)
One valid bit field is used in cache
Find the direct mapped cache size
Plz answer ASAP🤔🙏🙏🙏
Thank you so much sir 😀