Cache Replacement Policies - RR, FIFO, LIFO, & Optimal

แชร์
ฝัง
  • เผยแพร่เมื่อ 6 ต.ค. 2024

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

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

    I studied digital electronics from your channel 4 years ago and got good marks in my btech . I could not thanked you at that time. Happy teacher's day sir ❤️

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

    amazingly educational: easy to follow, slides carefully crafted, teacher's voice is very dynamic, makes it fun to listen!
    small remark: at 9:06, the 100% should be 100 without the % sign
    despite that, content is 1+ thanks so much!

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

    Cso oh god 💥💥💥💥💥💥
    Bro who ever ece student watches you definitely will subscribe you.
    I'll recommend all ece cs it student or aspirants to it ce to watch your channel.

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

    I want to know who unliked this video and for what reason? It is such a great lecture... respect to you with lots of love sir...

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

    Thank you so much for this informative video
    Really appreciable

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

    Happy teacher's day ❤️

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

    Thank you...

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

    Please continue ur Aptitude & Reasoning classes & update ur Playlist, coz I think some of the Discrete Maths classes are also part of Aptitude...

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

    heeeeeelooo everyone and weeeeeeelcome baaaack

  • @mokoepa
    @mokoepa 3 ปีที่แล้ว

    I like... 👍🏾

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

    can you explain why RR is not implemented in ARM anymore?

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

    Is the optimal algorithm totally infeasible? I am thinking it might be possible if we at least assume the future can be predicted from the recent past.
    What comes to mind is that a recurrent random event, such as hitting a memory page or database record, can be modeled as a Poisson distribution. Hence, given its average occurrence over previous time intervals {t_0, t_1, t_2, .... t_n}, we can calculate the probability of it occurring x times over the next interval t_n+1. Then prioritize the blocks (or records) with the highest probability. The one with the lowest probability will be eligible for eviction first.

  • @tulikagupta3998
    @tulikagupta3998 3 ปีที่แล้ว

    are you uploding more videos on this playlist??

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