Least Frequently Used (LFU) Page Replacement Algo

Подписаться 32 тыс.

Просмотров 312 тыс.

50% 1

This video teaches you Least Frequently Used (LFU) Page replacement algorithm using an example. It is also called as Not Frequently Used (NFU).
The difference between LFU and LRU is that LFU needs a smaller history.
It replaces the page which has the least frequency. If the frequencies are equal then it select the page using FIFO.
You can check FIFO and LRU tutorials here :
FIFO explanation : • FIFO/FCFS Page Replace...
LRU explanation : • Least Recently Used (L...
Find me here :
Tumblr : www.tumblr.com...
Google+ : plus.google.co...
Twitter : / androidacademy1
Facebook : www.facebook.c...

Хобби

Опубликовано:

4 окт 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 114

@swordofll9599 Год назад

Not going to lie, this whole video made the LFU understandable to a T. Thanks so much.

@hamlinhamlinmcgill630 8 лет назад

so far best explanation of lfu i found here. many thanks!

@pabloamaelwiwi Год назад

After having his reputation ruined in the field of law, Howard decides to get into computer engineering. Truly one of the Howard moments of all time.

@SakshiSharma-zy4ie 3 года назад

So clearly explain the concept that there is no need to see video repeatatively. Thanks 👍🏻😊

@Aaftab.19 2 года назад

Fake

@oldcoolbroqiuqiu6593 7 лет назад

I love your voice! This is the best solution for LFU I've ever seen. Thank you!

@TechAcademy8 7 лет назад

Thank you :-)

@AFLIXATV 7 лет назад

*THERE IS AN ERROR IN YOUR DEMONSTRATION* Towards the end, you had two page hits *3* 0 2 and 3 0 *2* when you loaded 3 and 2 respectively. Since the frequency of 3 and 2 are equal, you should have used LRU to break the tie. *3* should have been replaced when you loaded *1* . Therefore the final page presentation should be *1 0 2* . Thank you for your efforts.

@jayantakumarroy543 6 лет назад

we were using fifo in case frequency where same, from the start.but i have same doubts as yours,as similar question from google have same answer as you said.

@merlinthomas4553 5 лет назад

Yes I agree

@studentcommenter5858 5 лет назад

What ever she has done is 100% correct as per her assumptions. She has been using FIFO right from the beginning in case there is a tie in frequency. You can have your own implementations. But according to her problem statement and algorithm the solution is correct.

@abanoubhany3413 3 года назад

I was searching for a comment like this, I agree with you

@vighneshchavan9226 2 года назад

Nah, she used FIFO for tie breaker instead of LRU it's correct according to her algo

@sandeepsingh-ns3gr 6 лет назад

very good explanation, content was clear and very helpful.

@gunatejatompala1139 2 года назад

Thank you mam for your nice explanation. I watched more videos no one can explain in this format 😇

@rizwankhan2534 5 лет назад

best explanation of LFU thank you so much

@mehmoodali8431 3 года назад

thanks for your best explanation

@imveryhungry112 6 лет назад

Thank you for this explanation.

@SM7620 2 года назад

THANK YOU, GREAT EXPLANATIONS

@sowparnikam8812 7 лет назад

thank you so much for explaining the concept so clearly..... thanks again.

@rachitchitnis6367 8 лет назад

thanks your teaching is best

@littlebabymonster97 6 лет назад

brilliant explanation

@mucahitkatrc3285 7 лет назад

Thank you very much for your illustrating video :)

@deepkalariya7769 Год назад

Nice explanation ❤

@anubutikhazanchi5710 5 лет назад

Nicely explained!!👌

@ashwinkarki8112 8 лет назад

ur voice is so sweet luv u so much :*

@XYZ9630 5 лет назад

Nice explaination

@rptechnology2935 7 лет назад

that is concept are very easy i confusion thise method is clear thank you so much .....

@uppalaadarshkumar6936 7 лет назад

At 7.03 sec 2's frequency is 2 and u reset by zero , my question is why u reset as zero ( there is chance for 1 also) or any rule is there to reset as zero . Answer me quickly .Please

@ThulasiMannem 5 месяцев назад

When frequencies are same then we have to use fifo principle

@lahirujeewantha3870 11 месяцев назад

Thank you so much 💝

@MegaMido777 8 лет назад

Thx that was helpful

@uppalaadarshkumar6936 7 лет назад

When you recet a page decrease by one why u r assumed to 0 ?

@Itmasters822 3 года назад

Very very very good.

@CodedXtreme 7 лет назад

Thank you.

@diwang4572 2 года назад

Thank you!

@Xavierrex3 6 лет назад

Very helpful ty

@creativeworks98 7 лет назад

Thank you so much.

@Tanya-yh1un 3 года назад

Brilliant!

@TechAcademy8 9 лет назад

#LFU #Pagereplacement #algo #algorithm #os #operatingsystems #leastfrequentlyused #notfrequentlyused

@sabafatima1483 9 месяцев назад

Thank you

@manjubindass7769 7 лет назад

very nice video

@omkarkadam6854 7 лет назад

tnx good teching....

@tarunithamraju4094 6 лет назад

Great presentation

@gigabel1 3 года назад

Thank you :)

@smalltugz 9 лет назад

very nice

@VIKRAMSINGH-qu4qq 7 лет назад

✌thanks for the video

@sapramtejaravind6239 4 года назад

At 6:55 we have replace the 3 na??why 2 is replaced?

@moinqureshi4989 6 лет назад

Will u please explain Optimal page replacement kindly ?

@Tecwithjawad_bahi 7 месяцев назад

Thanks

@rishavmishra7955 9 лет назад

the result should have been 102 instead of 301....3 should have been replaced instead of 2 in the 3rd last step

@Toodaloo 8 лет назад

+Rishav Mishra Yep I got the same result.

@SianGoldofsky 8 лет назад

+Rishav Mishra assuming you are referring to the changes made in the 2nd to last column: From what I understand, you may be confusing LFU with LRFU. With LFU, once the least frequently used value is not unique (i.e. 2 & 3 = 2) the algorithm chooses what to remove based off FIFO - First in First Out of those values. So in our case "2" entered our cache prior to "3" and therefore was removed. This happened despite "2" being called from the cache (NOT removed or added) more recently compared to "3"

@dewdropk-dl5tv 3 года назад

+Rishav Mishra , you are using least recently used item( ie how the questions is asked in leetcode) to break the tie (thats why its 102) where as in the video she is using first in first out to break the tie.so its 301 for her

@SuperfiveGP 8 лет назад

nice video

@jameskurakula8560 5 лет назад

your voice is so sweet mam...

@moinqureshi4989 6 лет назад

Will u please explain Optimal page replacement kindly

@rayanenasri 3 года назад

Thank's

@aishwaryamuthukumar2235 4 года назад

Can u tell abt most frequently used

@ankitathakur5989 4 года назад

tnq mam g

@houseofareem7436 7 лет назад

ty mam..

@yashbehara7525 6 лет назад

thanks!.. good one 😉

@daruk6878 Месяц назад

I believe you

@firstbay4024 6 лет назад

the video is wrong. the counter does not reset to 0 after being replaced.

@studentcommenter5858 5 лет назад

Even I felt the same. Is there any proper example available in the Internet?

@박주형-f4e 5 лет назад

why you has used fifo? don't use LRU?

@mehmoodali8431 3 года назад

plz make a video about mfu

@RohitSharma-jo5vr 8 лет назад

this is more like mfu it should select a page which has not been used frequently in past

@mythilisaran3961 8 лет назад

Rohit Sharma that is lru

@이윤선-j9b 7 лет назад

설명좋구연

@SalisburyJoshuaer-b1m 17 дней назад

Marian Alley

@mathscs3789 5 лет назад

Hi, I've got a doubt that I want to clarify, You said whenever any page is removing then make it frequency to reset but actually you one have to decrease it by 1. I mean, there may be cases where if A, B, C are pages present main memory and all are having equal frequencies 5 then as per your concern the frequency of the page to be removed must be kept 0 but it must just be decreased to 4. Thank you.

@김소빈-o4r 5 лет назад

in this way, can Belady's anomaly be created?

@studentcommenter5858 5 лет назад

Belady's anomaly may exist in this. Because I can't think of stack implementation for this algorithm. LRU and Optimal are the only algorithms I know as of now which are not effected by belady's anomaly because they are stack algorithms. If you got any inputs do comment. I would like to know.

@김소빈-o4r 5 лет назад

@@studentcommenter5858 I couldnt find the input not yet...

@hello_world_0 7 лет назад

What was the meaning of the crosses afterall ?

@οκμπος 7 лет назад

The next time you'll need to use FIFO instead of the frequency, you do not take the ones with the cross into consideration.

@ManuelSimpson-m9t 23 дня назад

Felicia Cliff

@codemonkey01 8 лет назад

Hi, Thanks for the well explained video tutorial, I tried it on my end with increase page frames of 4 and with different frequency strings, and it happened that there are two ties. e.g. 2 and 5 both got 1 (count) 3 and 4 also got 2 (count) So in that case which is which? should I apply FIFO on both and check for frequency string that came first? e.g. in my case 2 and 5, 2 came first (2) in 3 and 4, 3 came first (3) BUT, 2 came first before 3, should I replace 2 since it came before 3? Hope to hear you soon, thanks again

@WilliamJerome-f4c 22 дня назад

Emard Isle

@ChildMonica-b1z 16 дней назад

Schneider Gardens

@DenaReeves-i2x 15 дней назад

Bernardo Village

@LauraRobinson-o7l 14 дней назад

Walsh Pike

@BellamyDoris-x4d 20 дней назад

Johnson Camp

@adityawadekar6273 8 лет назад

good explanantion! (Y)

@BillyMildred-k2x 25 дней назад

Crystel Valley

@broosakaa1151 7 месяцев назад

Mam ap nazar q nai a rhi apki awaz to bht piyari ha mgr ap kahan hooo ?

@sumanthkumar7921 6 лет назад

Answer in 102

@manyamnandeeshreddy6153 7 лет назад

nice voice

@vishnuvishnu4306 3 года назад

Wrong plz check

@sudhapinky6275 6 лет назад

👌👌👌👌👌👌

@bipinkhatiwada 7 лет назад

you made a mistake at 5:43 ! look, 0 came before 4. so, 0 should have been removed instead of 4 !

@TechAcademy8 7 лет назад

Bipin Khatiwada This is least frequently used algorithm. So you remove the least frequently used page. 0 has the highest frequency and 4 and 2's frequency was same. So we check which one came first and we remove that one.

@fatayyfatii6 8 дней назад

I got FAILED after watching her video

@kevinmao8609 8 лет назад

Is this an Indian accent?

@RanaKshitij 7 лет назад

yes, it is

@akramnazri1306 6 лет назад

mende kau aku x pham.

@crixketeditz8279 2 года назад

ghalat ha ye pora

@이름이없어-d3g 2 месяца назад

누나 나 죽어❤

@Пургер 8 лет назад

that accent is terrible.. my ears are bleeding

@noddyboffin2988 7 лет назад

Did you really think this comment would accomplish anything? I don't care if this was 5 months ago, you can fuck right off for making fun of someone's accent.