Least Frequently Used (LFU) Page Replacement Algo
Vložit
- čas přidán 15. 03. 2015
- 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/blog/priyanka0304
Google+ : plus.google.com/u/0/b/1059702...
Twitter : / androidacademy1
Facebook : AndroidAcade... - Jak na to + styl
Not going to lie, this whole video made the LFU understandable to a T. Thanks so much.
very good explanation,
content was clear and very helpful.
Thank you for this explanation.
so far best explanation of lfu i found here. many thanks!
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.
I love your voice! This is the best solution for LFU I've ever seen. Thank you!
Thank you :-)
THANK YOU, GREAT EXPLANATIONS
So clearly explain the concept that there is no need to see video repeatatively. Thanks 👍🏻😊
Fake
Thx that was helpful
thank you so much for explaining the concept so clearly..... thanks again.
Thank you mam for your nice explanation.
I watched more videos no one can explain in this format 😇
Thank you so much.
thanks for your best explanation
Very helpful ty
Thank you very much for your illustrating video :)
brilliant explanation
Nicely explained!!👌
Thank you!
Thank you.
Brilliant!
Thank you so much 💝
thanks your teaching is best
✌thanks for the video
When you recet a page decrease by one why u r assumed to 0 ?
Thank you :)
*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.
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.
Yes I agree
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.
I was searching for a comment like this, I agree with you
Nah, she used FIFO for tie breaker instead of LRU it's correct according to her algo
Nice explaination
Nice explanation ❤
Thanks
Thank you
thank you
Will u please explain Optimal page replacement kindly ?
very nice
nice video
very nice video
Very very very good.
설명좋구연
#LFU #Pagereplacement #algo #algorithm #os #operatingsystems #leastfrequentlyused #notfrequentlyused
best explanation of LFU thank you so much
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
When frequencies are same then we have to use fifo principle
tnx good teching....
Thank's
Will u please explain Optimal page replacement kindly
Can u tell abt most frequently used
thanks
At 6:55 we have replace the 3 na??why 2 is replaced?
ty mam..
Great presentation
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
tnq mam g
thanks!.. good one 😉
that is concept are very easy
i confusion thise method is clear
thank you so much .....
plz make a video about mfu
why you has used fifo?
don't use LRU?
your voice is so sweet mam...
What was the meaning of the crosses afterall ?
The next time you'll need to use FIFO instead of the frequency, you do not take the ones with the cross into consideration.
👌👌👌👌👌👌
Wrong plz check
ur voice is so sweet luv u so much :*
in this way, can Belady's anomaly be created?
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.
@@studentcommenter5858 I couldnt find the input not yet...
good explanantion! (Y)
the result should have been 102 instead of 301....3 should have been replaced instead of 2 in the 3rd last step
+Rishav Mishra Yep I got the same result.
+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"
+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
nice voice
this is more like mfu
it should select a page which has not been used frequently in past
Rohit Sharma that is lru
Answer in 102
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.
mende kau aku x pham.
Mam ap nazar q nai a rhi apki awaz to bht piyari ha mgr ap kahan hooo ?
the video is wrong. the counter does not reset to 0 after being replaced.
Even I felt the same. Is there any proper example available in the Internet?
Is this an Indian accent?
yes, it is
you made a mistake at 5:43 !
look, 0 came before 4. so, 0 should have been removed instead of 4 !
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.
ghalat ha ye pora
that accent is terrible.. my ears are bleeding
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.
Andrija Durutovic i find it awesome.
I'm sure your accent is wonderful. :)
At least it's understandable comparing to others making CS videos and has subtitles too.
Thank you
Thanks