Most-recently used algorithm, Operating System

Assignment Help:

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.


Related Discussions:- Most-recently used algorithm

Multilevel page table, what is multilevel page table and its applications?

what is multilevel page table and its applications?

List sample file types, List sample file types, based on use, on the VAX un...

List sample file types, based on use, on the VAX under VMS.  source programs (.BAS, .FOR, .COB, .PLI, .PAS, .MAR)  data files (.DAT)  text files (.TXT)  command proced

What is linked allocation, What is linked allocation, as detailed in text? ...

What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.

Components of the r/e system, What components of the R/e system initiate th...

What components of the R/e system initiate the start of background jobs at the specified time? The batch scheduler initiates the begin of background job.  The dispatcher then s

Explain disk scheduling algorithms-shortest seek time first, SSTF (Shortest...

SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv

Explain kernel activity for ults, KERNEL ACTIVITY FOR ULTS: The kernel...

KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl

Explain optimal page replacement, Optimal page replacement An optimal ...

Optimal page replacement An optimal page replacement algorithm has the least page fault rate of all algorithms. The algorithm states that a 'replace the page that will not be

Main advantage of the layered approach to system design, What is the main a...

What is the main advantage of the layered approach to system design? As in all cases of modular design, designing an operating system in a modular way has several benefits. Th

Calculate maximum average bandwidth, You have a system with two primary wor...

You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd