COA | Cache | Problems on Associative Mapping | Ravindrababu Ravula | Free GATE CS Classes

[@terigopula]

I hope this will help many people, 1KB = 2^10 bytes 1MB = 2^20 bytes 1GB = 2^30 bytes 1TB = 2^40 bytes the power of 2 for a KB starts with 10 and increases by 10 for every next higher magnitude.

[@prerna3404]

sir, there are some videos on your channel on CO , which are not included in this playlist , namely disadvantage of direct mapping and introduction to set associative mapping, please add them in the playlist too.

[@ishfaqrather1198]

videos r worth watching!!! plz do some hard pblms from gate previous years that will be great

[@priyak1146]

Awesome sir. I Understood Set Associativity only because of you sir. Thanks.

[@kittysharma5088]

how we know about the exact sequence of lectures

[@sharadjain2910]

thanks u very much sir your video is very help full plz upload more video of CSO....

[@devanshudahiya3246]

Sir! as physical address contains 3 fields naming 'tag', 'cache lines', 'block offset'.... so in very first example we got the physical address of 17 bits and 'block offset' of 8 bits and you said here that 'tag' is of 9 bits. then where are the bits acquired by 'cache lines' ????????? need urgent reply

[@vaishnavitatti3764]

sir, In associative mapping, is 2^(Tag bits) = No of lines in cache?

[@RoneyYelda]

thanx alot u saved me with ur tutorials

[@avinashsastry6858]

in the problem solved from the associative mapping introduction lecture, the number of comparaters we used were equal to the number of tag bits. But now the number of comparators is equal to the number of lines. Number of lines makes more sense but i would like to know which one is right, and if my guess is right, then how am i going to find the PD of the comparator in the first problem??....

[@marvellousmusademba794]

thanks for clear explanations But im lost on how you are doing the conversions from KB to bits

[@Dartingale]

2kB = 2 * 1024 (k, in power of 2) * 8 (B, 8 bits per byte). The minimum amount of bits to represent a number is ceiling(log2(number)), and thus the maximum number of element you can index with n bytes is 2^n.

[@keerthireddy6763]

when somethings is given in bytes like 128KB then 128 is 2^7 and K is 2^10 that makes 128 KB= 2^17 B so no of bits will be = 17 (which is the power of 2)

[@code-911]

Nice state/address analogy at the end.

[@YASOTHATBIT]

very nice teaching.....tq sir

[@RehanKhan-ri7ie]

First u are saying that memory is byte addressable and then u are solving the answer in bit. Bit should be bytes in this case

[@harikaperneti1464]

Sir,what about cache line number 1:26

[@shreyanair7347]

Sir this video is confusing for me because you are not explaining how to convert KB to bits and GB to bits. I am feeling that All are done in the same way. Little bit confused

[@RohitRoy-mu9it]

12:14 : Did he just cut the video for the line "cache of the size". xD { Anyways, great video Sir. }

[@keshavshinde8886]

Sir how we write PA directly. I can't understand plz tell me

[@stm2614]

thanks keep it up

[@ankitgupta8797]

I want to roam entire India

[@louerleseigneur4532]

Thanks sir

[@Englishonmytongue]

great sir

[@akarshsrivastava1483]

sir u r so smart

[@learning-from-bs]

kB is KebiByte = 1024 byte!!! I think it's not kilobyte!!!

[@hemanegikhatri6075]

how 64line, i think it should 6line isn't??

[@preethidurga1257]

yes i think so

[@subhajitsen8248]

no it should be 64, because each tag information is going to be 9 bits, then every line is going to contain tag. Now 2^6 lines are there. So, Tag directory size is (9*2^6) or (9*64) as 2^6=64.

[@anjaybruss]

rename the video please for other to be able to easily find it thanks

[@AnkitaYadav-qp4wn]

#CFBR

[@eggiewie2998]

shouldn't the tag size be in bytes? i'm confused

[@keerthireddy6763]

actually tag size in the video is no of bits in tag size so its given in bits. if you want the size in bytes then go with 2 power those no of bits.

[@ritiksinha5651]

If you have a letter for me You could Call me ,note my address and mail that letter to me its that simple pal