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
Explain in detail about ipc in linux

What are two differences among user-level threads and kernel-level threads? Under what circumstances is one type better than the other? (1) User-level threads are unknown by th

Q. If each the access rights to an object are deleted the object can no longer be accessed. At this stage the object should also be deleted and the space it occupies should be ret

#questionThe Fibonacci sequence is the series of numbers 0,1,1,2,3,5,8,… Formally, it can be expressed as: fib0 = 0 fib1 = 1 fibn = fib n-1 + fib n-2 Write a C program u

What is degree of multiprogramming ? Degree of multiprogramming signifies the number of processes in memory. If the degree of Multiprogramming is steady after that the average

Q. Can a system detect that some of its processes are starving? If you answer "yes," explain how it can. If you answer "no," explain how the system can deal with the starvation pro

Explain the Advantages and Drawback of Multiple Processes Application architected to take advantage of multiple processes will certainly see performance gains. Functions and Fe

The dynamic memory allocator is a layer between the application and the OS, managing heap objects. When a program requests memory from the allocator (via malloc(), for instance), t

Explain Load Balancing Client Server Components When migration functionality from the client - only model to the client - server model, care must be taken not over-or underutil

What is a Dispatcher? The dispatcher is the module that gives control of the CPU to the process selected by the short- term scheduler. This function includes: Switching