answersLogoWhite

0

Subjects>Science>Engineering

Explain the lru algorithm from the page replacement algorithm?

User Avatar

Anonymous

 ∙ 14y ago
Updated: 8/10/2023

First In First Out (FIFO) – This is the simplest page replacement algorithm. ...

Optimal Page replacement – In this algorithm, pages are replaced which would not be used for the longest duration of time in the future. ...

Least Recently Used – In this algorithm page will be replaced which is least recently used.First In First Out (FIFO) – This is the simplest page replacement algorithm. ...

Optimal Page replacement – In this algorithm, pages are replaced which would not be used for the longest duration of time in the future. ...

Least Recently Used – In this algorithm page will be replaced which is least recently used.

User Avatar

josephmk

Lvl 2
∙ 4y ago

Still curious? Ask our experts.

Chat with our AI personalities

EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
More answers

LRU occurs when page fault occurs such that some page has been not used for longest period of time then we have to replace that page when next page comes. this stargey is known as so.

User Avatar

Wiki User

 ∙ 14y ago
User Avatar

The Optimal Page Replacement Algorithm:The best possible page replacement algorithm is easy to describe but impossible to implement.

User Avatar

Wiki User

 ∙ 14y ago
User Avatar

Add your answer:

Earn +20 pts
Q: Explain the lru algorithm from the page replacement algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What is LRU in gas turbine engines?

Line replacement units

How is it possible for a program to execute with only a subset of these pages residing in main memory at any given time?

There is a concept called as Virtual memory. Here, The pages which are not present in the RAM are placed in the hard disk. Whenever the CPU tries to access a page which is not in RAM, it results in a "Page Fault". Then, the required page is searched in the hard disk and then a victim page is selected in the RAM which is to be replaced. This is done using algorithms like LRU, FIFO, etc. Now, the victim page in RAM is swapped with the new page which is taken from the hard disk. After that, the CPU resumes the execution.

Trending Questions
What is an early communication system that uses continuous wave modulation? What is hard floor? How long do plumbers live? Why was the python language created? What is the Shear strength of a sixteen penny nail? What is the best paint to paint my rusty barbecue pit? Importance of knowledge of genetic disorder in family? How is nanotechnology similar to current technology? What is a CD amplifier? What construct can you use to define an array? Can a solar cell be an alternative source of energy? What is the relationship between voltage and current and resistance in a simple circuit? Is miscibility a extrinsic or intrinsic? What is the flow rate equation? What do you mean by tilling or ploughing? How much a does a military engineer earn? Who was the native new yorker who invented the elevator on 1850? What is Result set in java? Why user defined applet class declared public? What are the methods of changing the frequency of Wien Bridge Oscillator?

Resources

Leaderboard All Tags Unanswered

Top Categories

Algebra Chemistry Biology World History English Language Arts Psychology Computer Science Economics

Product

Community Guidelines Honor Code Flashcard Maker Study Guides Math Solver FAQ

Company

About Us Contact Us Terms of Use Privacy Policy Disclaimer Cookie Policy IP Issues
Answers Logo
Copyright ©2025 Infospace Holdings LLC, A System1 Company. All Rights Reserved. The material on this site can not be reproduced, distributed, transmitted, cached or otherwise used, except with prior written permission of Answers.