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
explain about design issues of network operating system


we need an information about the different graph directory systems in detail by using shell sort . we also application part of directory systems in practical life. please help us i

what is hashed page tables & explain of there work & figure

what is the function of operation management?

advantages and disadvantages of monolithic and layered approach

Explain multilevel feedback queue in detail A process can move among the various queues; aging can be executed this way Multilevel-feedback-queue scheduler explained b

Suppose your process starts up, and allocates some memory with malloc(). The allocator will then give part of a memory page to your process. The OS then updates the corresponding p

Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll

Define buffering. A buffer is a memory area that keeps data whereas they are transferred among two devices or among a device and an application. Buffering is done for three rea