Page replacement Algorithms | LRU | Example | OS | Lec-27 | Bhanu Priya

Operating system ( OS )
Page replacement methods
Least Recently Used (LRU ) explained with example

#operatingsystems #paging #computersciencecourses #computerscience #engineering #computerscienceducation #engineeringvideos #educationalvideos #education #computerengineering

Class Notes ( pdf )

Complete Playlist : OPERATING SYSTEM ( OS )

Complete playlist : ARTIFICIAL INTELLIGENCE ( AI )

Complete Playlist : Theory of Computation ( TOC )

Complete playlist : DBMS

Complete Playlist : COA

Complete Playlist : C Programming

Complete Playlist : OOP's in C++

Complete Playlist : DATA STRUCTURES ( DS )

Complete playlist : Design and Analysis of algorithms (DAA)

Complete Playlist : SOFTWARE ENGINEERING ( SE )

Complete Playlist : OBJECT ORIENTED SOFTWARE ENGINEERING ( OOSE )

Complete Playlist : OOP's in C++

Complete Playlist : STLD

Complete Playlist : Mobile computing

Complete Playlist : CSS

[t.asoubanaadi]

It's really helpful for us even after 5 year's

[vidyasagarananthabotla]

I always watch these videos in 1.75x speed.Very helpful.Thanks

[harikagottumukkala]

Finally I understood this topic by your video. Thank you mam.

[az]

The only online resource that could finally explain it in detail! Thank you so much!

[anuraktaghosh]

Your explanation is good ma'am, this example is sufficient for exams, but if someone really wants to know how LRU works then this is the gist:
1. Memory Management Unit has page table.
2. All the pages in the page table form a linked list
3. LRU algorithm requires an extremely fast hardware (obviously expensive), to segregate the pages into most recently used and least recently used pages. This segregation is done in every clock tick or page fault, thus the need for the hardware to be extremely fast. The software implementation of this is known as NFU (Not Frequently Used) which uses an aging algorithm to determine least frequently used page.

4. LRU is said to be extremely efficient but it is also equally difficult to implement, that's why people came up with work arounds.

[lakshman]

She's explaining us it's a great thing presentation don't matter if the students are able to understand. as we all know we are very very familiar with her explanation and Don't try to change that familiarity . Hope you don't mind 😁😀 .And we always support Bhanu madam

[ovipanda]

Today i'll take seminar abt lru... By saw ur vedio. It was so easy to understand.. Ur mam applause&appreciate me.I am so happy bcoz of u mam.. All credits goes to u.... Tq mam❤❤❤❤❤❤❤❤

[zaydabdulnasir]

i have a test in some few hours, and this was very helpful. thanks.

[rijanthapa]

best explaination ever on internet wow

[Rick_Aye]

Best way to memorize how many digits you look back is by the N frames and UNIQUE values. So, if you have 3 frames, like in the example, you reference the third least recently used unique value to the left. If it's 4 frames, then it's 4th unique value.

[gdguru]

Thank you mam ::
Today July 13 at 10am I'm having OS semester examination
I'm learning page replacement clearly from you than my Os mam..
Thanx for it❤❤

[vickymronga]

Best greetings from Germany. We love your videos!

[johnaspire]

at 5:24 why we checked with 4 digits to replace? in rest of the algorithm we always check from the last 3 digits before removing...???

[devaratharaisaarAD]

Thank you for helping a lot mam, it is midnight and morning i have my sem exam, i understood the concept clearly .

[hikaru_e]

Thaaanks our teacher couldn't explain the logic quite well 10 min here everything was understood

[catalinobajado]

Well done maam! Please teach us how to compute for the failure and success ratios. Thanks❤️😊

[mohammadyeasinalfahad]

Thank you very much, the video was quite helpful.
Thumbs up. Love from Bangladesh.

[smmahadi]

coloring is good, makes a nice presentation. good job & thank you

[jananiv]

Thank you so much mam 🙏this video is very easy to understand and useful thanks for uploading.. make more subject related viedo

[indigosparkle]

Thanku so much today is my os exam😀😀😀😀