Most-recently used algorithm, Operating System

Evicting the most-recently used (MRU) page does very well on LRU's worst case. In general, however, MRU is a bad idea, since many programs exhibit temporal locality in their memory accesses, and MRU is effectively assuming that memory accesses will not exhibit locality.Another possibility is First-In, First-Out, or FIFO. At ?rst, this seems like it would be competitive with LRU, but it is not, since it also ignores temporal locality. For example, with a cache size of three, and the access pattern ABCAD, A would be evicted when D is loaded into the cache, which generally is not a good idea. (FIFO also has an unusual property called Belady's Anomaly in which for contrived examples, means that adding more memory to a system can cause more paging. So adding more physical memory to a computer using FIFO replacement could in theory make it slower. This cannot happen with LRU replacement.

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







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

Write discussion on Most-recently used algorithm
Your posts are moderated
Related Questions
This assignment is based on Programming Project 6.40 in Silbershatz. Implement the ProducerXConsumer program according to the instructions for Project 6.40 for both Linux and Win32

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

Explain the ThreadSwitchWithDelay Function used in Netware ThreadSwitchWithDelay( )   This command is used when threads are waiting for an event or resource but don't want t

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit

VoIP (Voice over Internet Protocol), also called Internet telephone, was once a novelty on the Internet, but not very useful because of all the problems with poor voice quality and

Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

draw a state diagram showing the transissions of a process from creation to termination

The physical memory acts as a cache backed by the disk. When the physical memory is full, and we want to read in another page from disk, we have to evict a page from physical memor

What are interrupts? Interrupts are in some ways the mainly "famous" system resources, ever since almost everyone who's used a computer has heard of them even if they don't k

What is a process? A process is a program in implementation. It is an active entity and it contains the process stack, having temporary data and the data section includes globa