Least-recently used, Operating System

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the recent past is a good prediction of the future, which is often true in real programs. Variants of the LRU policy are currently used in all real operating systems. We will discuss LRU further below. For certain patterns of memory accesses, however, LRU can be quite bad. For example, the worst case for LRU is a loop which is larger than the cache size (physical memory size in this case). In this situation, LRU will miss, or page fault, on every page access. So perhaps there are alternatives which are better than LRU?

Posted Date: 3/12/2013 5:57:54 AM | Location : United States







Related Discussions:- Least-recently used, Assignment Help, Ask Question on Least-recently used, Get Answer, Expert's Help, Least-recently used Discussions

Write discussion on Least-recently used
Your posts are moderated
Related Questions
We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to

What is an I/O subsystem? The control of devices connected to the computer is a main issue while designing operating systems. Since I/O devices differ widely in their function


The questions ask List four major functions of an OS. My answer: Function 1: Provide a user interface Function 2: Manage files Function 3: Manage hardware Function 4: Manage appli

Define the DosSleep(ms) Function used in the os/2 DosSleep()  suspends the currently executing  thread for some time interval specified in the  ms parameter. If a value of 0 is

Demand paging gives that pages could only be brought into memory if the running process acts them. This is usually referred to as lazy evaluation as only those pages operated by

The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s

Is it probable to have a deadlock involving only one single process? Describe your answer. Answer: No This pursue directly from the hold-and-wait condition.

Extend task 1 so that the requests are issued by the clients instead of the server. The server now do not use the "all_requests.dat" file. Instead every client thread reads from

Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator