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

Ask an Expert

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

Write your message here..

Related Questions

Explain the threadswitchwithdelay function used in netware, Explain the Thr... 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

Plot a function for value of heights, The performance of a file system depe... The performance of a file system depends upon the cache hit rate (fraction of blocks found in the cache). If it takes 1 msec to satisfy a request from the cache, but 40 msec to sat

Context switching, short note on context switching short note on context switching

Write a note on deadlocks, Write a note on deadlocks. The proper defini... Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

Explain secondary-storage management, What are the three main activities of... What are the three main activities of an operating system in regard to secondary-storage management? a) Free-space management. b) Storage allocation. c) Disk scheduling.

Explain acyclic-graph directories, Acyclic-graph directories An acyclic... Acyclic-graph directories An acyclic graph permits directories to have shared subdirectories and files. The similar file or subdirectory may be in two dissimilar directories. A

What is a dispatcher, What is a Dispatcher? The dispatcher is the modul... 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

Define a public key encryption system, Define a public key encryption syste... Define a public key encryption system Allows just the correct receiver to decode the data

Explanation of modern cpu architectures, Your CTO liked your proposal from ... Your CTO liked your proposal from Unit 2 so much he only trusts you to explain complex concepts to his managers. He now wants you to write him a four page paper explaining the CPU,

Write on short note dma., Write on short note DMA. Direct M emory... Write on short note DMA. Direct M emory Access (DMA) is a technique for transferring data from  main to a device without passing it through the CPU. Computers that have