Clear example, thank you a lot. But is there any example with the offset separated in two : block offset and byte offset ? The block offset I think I understand it but I don't see the point to have the byte offset.
Very, very delayed in my response, the byte offset just refers to the 4 bytes for a number (assuming a 32 bit number). (If it was a 64 bit (8 byte) system, then there would be 3 bits for this portion.)
I don't know why in your example with the same tag we always have the same set ? What will be happen when we have the addresses with the same tag and the different set ?
I have a question. What if the addresses in memory are not all uniform bit size. Each of your addresses in the example are 12 bit. But what if they differ, such as between 12 - 16 bits? Will the process you are using here work on addresses of varying bits? Such as 0x408ed4, 0x10019d94, 408ed8...
Assuning you are refering to immediate values (bit positation 15-0 for the immediate values portion) they are all 16 bits. It may only show a smaller number if the higher order bits are all zero. As a further extendion, in MIPS, all addresses are 32 bits (with immediate values of 16 bits). Does that address your question?
can anyone please explain why we initially set the valid bit to 1 or 0. Every video I come across "so we set this bit to 1" with no further reasoning behind it. Otherwise everything was super helpful!
Thank you so much for this video lol my CS classes have been kicking my ass since coronavirus started
man its so hard to find channels like this where exactly what you're searching for is there. Thanks man!
Thank you so much for this. English is my second language and I have a huge problem understanding indian English, so this is extremely valuable for me
Indian English lets me forgets standart english as you can see
English is my third language, and understanding my Chinese professor was very hard :D
Great video! I feel like I finally begin to understand this!
I know right. I mean no offence, but it's hard to perceive an Indian accent.
wonderful , this would be the last time i would need to look for cache hit and miss info
thank you so much, I have a prototyping final tomorrow and this video helped me a lot
Finally!!! An amazing explanation, huge thanks 🙏🏼
Really appreciate this video, helping me clear up how this works before my final tomorrow, thanks.
You would do much better than my current cse230 teacher. thank you.
This is absolutely great, thank you!
this helps out a lot, thank you
So clear and informative, thanks!
thanks for the great explanation!
Very nicely explained. Thank you so much.
You saved me life with this, thank you.
Also Me! there is no one who have examples of this
thank you so muchhh!!! I have exam in 2hr and this video just saved me.
Exactly what I need for my exam next week, thanks
Thanks a million for creating this video.
Thank you, very detailed explanation!
goat no one explains it better and got a final tomorrow wish me luck
Thank you a lot, you cleared the holes in my mind.
Thank you clear and simple
FINALLY a great video!
perfect example!!!!!!! you saved me thank u!!!!
thanks a ton.. one question ... what did you mean by 'V ' in the table?
the table of addr,tag,set,offset of the left is memory or cache? The table on the right side is cache right?
one of the best explanations
How about the data? Is there any changes? When we change the tag
thank you bro this is super helpful for me!
Made it easy to understand, thanks ;)
Very good content!!!!
Thank you very much!
great example, thank you!
thank you for saving my life
Man you are a life saver
Much better than the Udemy video.
Clear example, thank you a lot. But is there any example with the offset separated in two : block offset and byte offset ? The block offset I think I understand it but I don't see the point to have the byte offset.
Very, very delayed in my response, the byte offset just refers to the 4 bytes for a number (assuming a 32 bit number). (If it was a 64 bit (8 byte) system, then there would be 3 bits for this portion.)
Thank you so much .. it's very useful
set = line?
this helps me a lot, thx
Thank you so much!!
Thanks man appreciated
GOD BLESS YOU FOR THIS!!!💪
Literally the only explanation on the internet for this shit
So is the valid bit always set to 1 when we're leading data into the cache? When is it set to zero?
It's always zero at the start. It becomes 1 once referenced
very helpful!!
What is the purpose of the offset bits? I’m confused on that point.
The offset bits are the least significant portion of the number. The number as a whole has three portions, the offset, the set, and the tag.
Thanks for the video! (PS. you sound just like Tony Stark/RDJ!)
i cant unhear it now lol
I don't know why in your example with the same tag we always have the same set ? What will be happen when we have the addresses with the same tag and the different set ?
Oh now i understood we must look at the set first before we compare the tags
beautiful
vs me in smash rn
thanks
Muito obrigado !
thank you
I have a question. What if the addresses in memory are not all uniform bit size. Each of your addresses in the example are 12 bit. But what if they differ, such as between 12 - 16 bits? Will the process you are using here work on addresses of varying bits? Such as 0x408ed4, 0x10019d94, 408ed8...
Assuning you are refering to immediate values (bit positation 15-0 for the immediate values portion) they are all 16 bits. It may only show a smaller number if the higher order bits are all zero. As a further extendion, in MIPS, all addresses are 32 bits (with immediate values of 16 bits). Does that address your question?
@@matthewwatkins88 yes ok thank you very much for your answer!
can anyone please explain why we initially set the valid bit to 1 or 0. Every video I come across "so we set this bit to 1" with no further reasoning behind it. Otherwise everything was super helpful!
By the nature of the system every bit must have a value, which in our case must be either a zero or a one. Does that help any?
god bless u !!
Save me from the poor lecture notes but advanced question sheet
👍👍👍👍👍
You shouldn't get 5 Bits from an logarithm of Bytes, seems like killing kitten
thnx bro (=
thanks man, you really helped a nigga out
amazing example. university lecturer is not as good as you
Professor explains concept for 3 hours... *doesn't make sense*
5 minutes into CZcams video... "This shit is so easy wtf"
using a cache with only 5 blocks really makes it something simple enough you can visualize and understand
Poor explanation. You should state if we are using byte addressing, word addressing, or what.
Explanation is fine, get your intellect up
thanks