Direct Memory Mapping - Solved Examples

แชร์
ฝัง
  • เผยแพร่เมื่อ 2 ต.ค. 2024
  • COA: Direct Memory Mapping - Solved Examples
    Topics discussed:
    For Direct-mapped caches
    1. How to calculate P.A. Split?
    2. How to find out Tag Directory size?
    3. Significance of Tag bits & unique method of calculating the number of Tag bits.
    4. How to find out Cache size?
    Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
    Contribute: www.nesoacademy...
    Memberships: bit.ly/2U7YSPI
    Books: www.nesoacademy...
    Website ► www.nesoacademy...
    Forum ► forum.nesoacad...
    Facebook ► goo.gl/Nt0PmB
    Twitter ► / nesoacademy
    Music:
    Axol x Alex Skrindo - You [NCS Release]
    #COAByNeso #ComputerOrganizationAndArchitecture #DirectMemoryMapping

ความคิดเห็น • 61

  • @dushananuradha1098
    @dushananuradha1098 2 ปีที่แล้ว +110

    My confusion is never ending on why these youtubers can explain these difficult stuff in very clear and concise way, while our university lectures suck at it.

    • @pragatsharma1580
      @pragatsharma1580 2 ปีที่แล้ว +3

      exactly lol we get better quality for free than we get by paying a huge amount of money lol

    • @tuantranluuquoc2910
      @tuantranluuquoc2910 2 ปีที่แล้ว +9

      man this seems to happen in every country, mine isn't exception too. The lecturer is atrocious!

    • @willemhekman1788
      @willemhekman1788 9 หลายเดือนก่อน +5

      Having worked as a teacher professionally, I can tell you that most teachers do not (a) find the time/energy to make their educational content in this way (I can imagine each short video on this channel took 2 hours to make i.e. a university lecture = ~8 short videos = 16 hours of effort vs 1.5 hours of plain lecturing) and more importantly (b) fail to place themselves in the shoes of the learner i.e. as a beginner (this is called expert blindness).
      In practice you need someone crazy enough/talented enough to make content like this --- imagine taking 2-4 hours out of your day to make this powerpoint a 10 minutes video? and/or an economy of scale.

    • @fianyeku-kokonumichael4182
      @fianyeku-kokonumichael4182 5 หลายเดือนก่อน

      @@willemhekman1788 well said

  • @AnuthaOneShields
    @AnuthaOneShields 2 ปีที่แล้ว +82

    Wow, this is an amazing lecture... far better than the three 1h 30m lectures that my professor gives. Once I start my career, I can't wait to donate to this channel. It's been SUCH a lifesaver for me!

    • @rahulsyt_
      @rahulsyt_ 2 ปีที่แล้ว +3

      Same thought!

    • @tanugupta9333
      @tanugupta9333 ปีที่แล้ว +2

      Actually same ......

    • @tanugupta9333
      @tanugupta9333 ปีที่แล้ว +3

      Hum sb fees dete h college m pdhte youtube ss haii.... uske baad bhi clg balo ko placement nhi diye jte... etne paise ke baad bhi...

  • @kamikamen_official
    @kamikamen_official 11 หลายเดือนก่อน +1

    For the last one, while I at first failed monumentally, after rewatching the video (and hopefully understanding better) I realized (to me at least) there's a simpler way to find the cache size.
    You are told the # of tag bits is 10. So you know you need 2^10 different tags, and by the same token that the cache fits 2^10 times into the MM. So you get this equation 2^34/2^x = 2^10. Since you know algebra, you know you can convert the system to (just use exponent laws) 34-x = 10. Solving for x you get 24.

  • @siddharthmagadum16
    @siddharthmagadum16 3 ปีที่แล้ว +17

    third one can be done by 2^#tag bits= MM size/ Cache size , we know MM size and Cache size

  • @angel.persaud
    @angel.persaud 5 หลายเดือนก่อน +1

    my head hurts

  • @EzeroXP
    @EzeroXP ปีที่แล้ว +5

    Screw it. Im'm going to fail

  • @ishuanand4840
    @ishuanand4840 ปีที่แล้ว +1

    i dont know why but the concepts are not clear might be too much vagueness is there..i have been watching neso for a long time now but only this time i m left with the doubts.

  • @himanshurana5880
    @himanshurana5880 ปีที่แล้ว +1

    Consider a main memory of the size 64 kB with each word being of 8 bits (one byte) only and a direct mapping Cache memory of size 4 kB also having data word size of 8 bits. Find the following :
    (i) What is the size of tag and index fields of cache ?
    (ii) In what location of Cache, hexadecimal address to main memory (AABB) (if exists in cache) will be located ?
    what's answer of this question, can anyone tell..?

  • @sherazarain871
    @sherazarain871 3 ปีที่แล้ว +7

    Great explanation in just 10mins.
    keep it up.
    I recommended this lecture series to my children's XD

  • @gatecomputerscience1484
    @gatecomputerscience1484 2 ปีที่แล้ว +3

    Thanks for covering every kind of questions 🙂🙂🙂🙂❤️❤️❤️❤️🙂🙂🙂🙂

  • @rahulchattopadhyay226
    @rahulchattopadhyay226 2 หลายเดือนก่อน +1

    Totally confused very confusing

  • @TheChargingCap
    @TheChargingCap 2 ปีที่แล้ว +6

    fabulous!! very clearly understood in less time!! thank you neso!!

  • @gourisworld4081
    @gourisworld4081 ปีที่แล้ว

    Amazing🙏

  • @VinyZikss
    @VinyZikss ปีที่แล้ว +2

    Awesome video and teacher. Thank you so much for these easy-to-understand videos.
    There's one thing I haven't understood, isn't 1Kb the same as 1000 bytes, and not 1024 like in your examples? I thought 1Kib was 1024 bytes

  • @sunyuting7330
    @sunyuting7330 ปีที่แล้ว +1

    example 3: 10 tag bits..... So 2*34/2^10 = 2^24 =16MB. no need other info i think

  • @bob461
    @bob461 2 ปีที่แล้ว +4

    Very informative and amazing lecture. Can you please suggest a good book also for computer architecture and to solve more numerical based problems like this

  • @himanshurana5880
    @himanshurana5880 ปีที่แล้ว +2

    8:07 Consider a main memory of the size 64 kB
    with each word being of 8 bits (one byte) only and a direct mapping Cache memory of size 4 kB also having data word size of
    8 bits. Find the following :
    (i) What is the size of tag and index fields of cache ?
    (ii) In what location of Cache, hexadecimal address to main memory (AABB) (if exists in cache) will be located ?
    can anyone solve this question..?
    @Nesco Academy can you solve it..?

    • @kedharguhan
      @kedharguhan 7 หลายเดือนก่อน +1

      Without knowing block size, I am gonna assume arbitrarily that it is 1kB. So 10 lines for block offset, and 4 lines in cache. So AABB will be in line#1 of cache since AABB ends with 01.
      If you take a different block size, AABB will still end up in line#1 (01) but there may be more lines in the cache.

  • @asterdogma
    @asterdogma 3 ปีที่แล้ว +4

    Right on time for my exams

  • @livesdebug8225
    @livesdebug8225 2 ปีที่แล้ว +2

    where can i find your course ppt or pdf ? can you share it? thanks

  • @anonfromearth
    @anonfromearth 3 หลายเดือนก่อน

    So basically, the number of caches that can be fit in main memory = number of blocks that can fit in a cache

  • @anjaligupta-ew6ns
    @anjaligupta-ew6ns 3 ปีที่แล้ว +2

    Please complete lecture video on Compiler design plsss sir really need

  • @durasaksham
    @durasaksham 2 ปีที่แล้ว +1

    I didn't get the concept of tag directory. Can anyone help me out?

  • @elmokretarasma665
    @elmokretarasma665 11 หลายเดือนก่อน

    I love TH-cam porofessors. They always save my poor life ... Thank you so much for your effort sir

  • @onlyintellectuals
    @onlyintellectuals ปีที่แล้ว

    so tag bits represent the log(times the cache would fit in the ram). if ram is 4 times the cache size, then the tag bits are 2. in above case, 2^10 times x cache size = ram size. therefore. cache size is ram size/2^10= 16 x 2^10 x 2^10 x 2^10 bytes. = 16 MB.

  • @rajarshimondal1343
    @rajarshimondal1343 8 หลายเดือนก่อน

    you should have taken one example for word size != 0
    that would be much helpfull

  • @shalkar_mukazhan
    @shalkar_mukazhan 7 หลายเดือนก่อน +1

    Thank you so much!!!

  • @ritamghosh7622
    @ritamghosh7622 2 ปีที่แล้ว +1

    MM size = 4GB =2^2*2^30Bytes=2^32bytes=2^32*2^3bits=2^35 bits right?

  • @rahulsyt_
    @rahulsyt_ 2 ปีที่แล้ว +1

    Bow down 🙇🏻‍♂️ to him ❤

  • @krambow1509
    @krambow1509 ปีที่แล้ว

    Thank you, You all are really blessed. Thank you, one thousand times Thank You.

  • @geheron1946
    @geheron1946 2 ปีที่แล้ว +1

    You saved me, LOVE YOU ❤️

  • @kuntalbatabyal6676
    @kuntalbatabyal6676 3 ปีที่แล้ว +1

    First viewer.. 👍🏾

  • @mrincognito2371
    @mrincognito2371 4 หลายเดือนก่อน

    you made this so easy to understand, thank you sir!!

  • @baloneypopo9609
    @baloneypopo9609 5 หลายเดือนก่อน

    👍

  • @gpsewtohul7652
    @gpsewtohul7652 7 หลายเดือนก่อน

    Unbelievable explanation. The best one so far

  • @Masakkalii
    @Masakkalii 5 หลายเดือนก่อน

    Got it

  • @thecritiquer9407
    @thecritiquer9407 24 วันที่ผ่านมา

    ❤❤❤

  • @_Who_u_are
    @_Who_u_are ปีที่แล้ว

    WORD is 1 or 2 Bytes?

  • @shubhamdas6519
    @shubhamdas6519 ปีที่แล้ว

    Thanks for the video sir ....

  • @sachinsudaraka6397
    @sachinsudaraka6397 3 ปีที่แล้ว +1

    ❤️

  • @mdshahnawaz645
    @mdshahnawaz645 3 ปีที่แล้ว +1

    👍

  • @sinekad5132
    @sinekad5132 11 หลายเดือนก่อน

    Thank you sir❤

  • @asherhabib5276
    @asherhabib5276 2 ปีที่แล้ว

    disliked because of cringe voice. taking lecture at 3 in night for exam at 8 and this boy sound so cheerful

  • @kunalsharma3099
    @kunalsharma3099 2 ปีที่แล้ว +1

    hates off

  • @annafebland4460
    @annafebland4460 ปีที่แล้ว

    8:44

  • @sweetjimmy
    @sweetjimmy 3 ปีที่แล้ว +2

    Hey! I noticed one thing that size of cache is equal to the no. of blocks in MM. Is this true for every computer?

  • @yutaitadori7318
    @yutaitadori7318 3 ปีที่แล้ว +2

    This playlist is progressing too slow.If possible please fast a little bit.

  • @aaronmbuzi3369
    @aaronmbuzi3369 2 ปีที่แล้ว

    You're too quick, slow down