Well I always become out of words to appreciate the work done by you guys.. Your work has made difference in every engineering student technical journey.. Keep up the good work 😊
Your question solving strategy after the lecture is actually brings clarity on the topics. You explained every question different from another question. That's actually very useful to think on every aspects of the topic.
In Q1, in case of a cache miss, your calculation assumes you go to the very last word in a block. Since they ask for average time, wouldn't you average the memory search as [ 20 * 1 + (2^5 - 1) * 5 ] /2? And have your average time be: Tave = 0.94 * 3 + 0.06 * (3 + (20 * 1 + (2^5 - 1) * 5 )/2) Sometimes it would miss cache, but the first word in the block would hit, sometimes the third, sometimes the 2^3 word, and sometimes the last one which is 2^5-1. Please let me know what you think.
For the Q1, from my understanding, on the left bottom of the video, Tmm = 20 ns for the 1st and 5 ns for the rest (for every WORD instead of every block). Am I right?
I guess that if the tag isn't a multiple of 4, you would just add leading zeros to make it a multiple of 4. For example, if the tag length is of 5 bits, and this are the 5 bits: 10101, you would represent the address in hexadecimal as this: 15, that would be this at binary: 00010101.
Can you please suggest a good for computer architecture, to practice the numerical problems related to memory hierarchy, caches, dram etc. Inclusive of coherency (MESI/MESIF). Related problems
Well I always become out of words to appreciate the work done by you guys.. Your work has made difference in every engineering student technical journey.. Keep up the good work 😊
Your question solving strategy after the lecture is actually brings clarity on the topics. You explained every question different from another question. That's actually very useful to think on every aspects of the topic.
Till now the whole concept looking like table of 1.(means very simple 😊)
Thankyou for your Hard efforts 💚💚
Eminent channel. I proud of you Sir
Very helpful videos for engineering students, thank you so much, I highly appreciate your efforts.
Wao! You are providing priceless lectures.....free of cost ❤️❤️❤️❤️❤️❤️🙂🙂🙂🙂🙂🙂
This channel is such a resource. I keep checking if i subscribed after every video 😅 Thank you!
Complete this playlist as fast as possible it may useful for us...🙏
Just loving your work. Thank you so much for your work.
In Q1, in case of a cache miss, your calculation assumes you go to the very last word in a block.
Since they ask for average time, wouldn't you average the memory search as
[ 20 * 1 + (2^5 - 1) * 5 ] /2?
And have your average time be:
Tave = 0.94 * 3 + 0.06 * (3 + (20 * 1 + (2^5 - 1) * 5 )/2)
Sometimes it would miss cache, but the first word in the block would hit, sometimes the third, sometimes the 2^3 word, and sometimes the last one which is 2^5-1.
Please let me know what you think.
Thanks for uploading such a beautiful videos
Good video, bro. Please add english subtitles like in your previous videos.
Good work
For the Q1, from my understanding, on the left bottom of the video, Tmm = 20 ns for the 1st and 5 ns for the rest (for every WORD instead of every block). Am I right?
I want to ask about Q2 in 6'53s. If Tag bit dont mod 4 == 0, how to determine the tag, if tag size is 5 and a part of it sequence is 0001 0 ?
I guess that if the tag isn't a multiple of 4, you would just add leading zeros to make it a multiple of 4.
For example, if the tag length is of 5 bits, and this are the 5 bits: 10101, you would represent the address in hexadecimal as this: 15, that would be this at binary: 00010101.
@@watpo__5440 duo to long reply time, I had understood how it actived. Thanks for your support 🧡
Can you please suggest a good for computer architecture, to practice the numerical problems related to memory hierarchy, caches, dram etc. Inclusive of coherency (MESI/MESIF). Related problems
2:40 how to know it is leval wise organization or not ???
He already said that unless stated otherwise, it's a level-wise organization.
Dear Sir, Kindly make videos on Software engineering.
Why Tc is added with Tmm in the first question..It has told that during cache miss time taken is 20ns.
Because tc is not included in the cache miss time
Nice
is this a diploma IT student question?
plz make a video on time and space complexity
👍
why this video cannot display english suntitle?annoying😭😭
Thanks for the nice explanation❤❤