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

Ask an Expert

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

Write your message here..

Related Questions

Explain segmentation hardware?, Explain segmentation hardware? We defin... Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means

Process Management, In a table format, discuss the differences between th... In a table format, discuss the differences between the fixed partition and the variable partition memory organization in terms of the basic idea, memory structure, advantages

What are the advantages of contiguous allocation, What are the advantages o... What are the advantages of Contiguous allocation? The advantages are a. Supports direct access b. Supports sequential access c. Number of disk seeks is minimal.

Write a linux script to add name in class list, For this exercise I wanted ... For this exercise I wanted to give you some real-world examples of useful bash scripts. Therefore, you will write a couple of scripts that I actually use in my teaching to automate

Define cpu scheduling, Define CPU scheduling. CPU scheduling is the met... Define CPU scheduling. CPU scheduling is the method of switching the CPU among several processes. CPU scheduling is the basis of multiprogrammed operating systems. By switching

integrator circuit, Referring to Figure below, discuss how you would alter... Referring to Figure below, discuss how you would alter the circuit to obtain: 1. a straightforward amplifier with gain 1, 2. a straightforward amplifier with gain 10, 3. a

Multiprogramming, explain how response time are reduced by allowing time sh... explain how response time are reduced by allowing time sharing on top of multiprogramming

Explain drawbacks of fixed partitioning, The drawbacks of fixed partitionin... The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re

Explain multitasking operating system, Multitasking - An Operating systems... Multitasking - An Operating systems that is proficient of allowing multiple software processes to be run at the same time. Below are some instances of multitasking Operating Syste

Define the division of labour between client and server, Define the Divisio... Define the Division of Labour between Client and Server Given our definition of client - server as the interaction between dispersed application logic components it must be not