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
Which are the different states of a process?   Different status of a process is: New: When the process is created. Running: When instructions are executed. Wait

What are turnaround time and response time? Turnaround time is the interval among the submission of a job and its completion. Response time is the interval among submission

When we download a movie from the Internet, we don't care about, say, packet sizes. However, even ifwe are not aware of howlow-level details of networks are implemented, our data i

Process states in Linux OS Running:  Process is either ready to run or running Interruptible:  a Blocked part of a process and waiting for a signal or an event from anothe

In a  p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

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 rec

what do you mean by starvation?explain in detail

Describe the following allocation algorithms: a. First fit b. Best fit c. Worst fit   a. First-fit: search the list of available memory and all

Contiguous allocation: Every file will be allocated contiguous space in the memory. Allow the block size be 1K If a 50K files desires to be allocated space after t