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
Define thrashing. Thrashing is the accident of high page traffic and low CPU utilization. It is observed that the cause of thrashing is an under-commitment of memory to program

Before proceeding with its execution, every process must obtain all the resources it needs is called Hold and wait

Question: a) What special measures must be taken to ensure the reliability, availability, and security of electronic commerce and digital business process? b) What are the c

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

What is internal fragmentation? Consider holes of 20k assume the process requests 18 bites. If we allocate accurately the request block, we are left with a hole of 2k. The over

How is it different from the unbounded buffer algorithm ? Explain.

Define Segmentation  The memory allocation method subject to “external” fragmentation is Segmentation.

Determine the equation for the y and truth table for the circuits

Question 1 Explain the following with respect to Resource Management in Distributed Systems- Task assignment Approach Load - Balancing Approach Load - Sharing Approach

Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are