The physical memory acts as a cache backed by the disk. When the physical memory is full, and we want to read in another page from disk, we have to evict a page from physical memory. How do we choose which page to evict? This is determined by the cache replacement policy. Note that in a theoretical algorithms course, you are generally interested in the worst-case asymptotic performance of an algorithm. In building systems, worst-case performance can be important (for instance, in systemswith real-time requirements), but oftenwe canmost about the algorithm's performance for the most common case. If a particular algorithm has good worst-case performance, but bad common-case performance, it is a bad algorithm.

Posted Date: 3/12/2013 5:57:09 AM | Location : United States

Ask an Expert

Related Discussions:- Cache replacement policies, Assignment Help, Ask Question on Cache replacement policies, Get Answer, Expert's Help, Cache replacement policies Discussions

Write discussion on Cache replacement policies
Your posts are moderated

Write your message here..

Related Questions

What are the multithreading models, What are the multithreading models? ... What are the multithreading models? There are three models:- a) Many-to-One model b) One-to-One model c) Many-to-Many model

Determine a critical section is a program segment, Determine a critical sec... Determine a critical section is a program segment  Critical section is where shared resources are accessed

Problem of unbalanced loads, Present your own fully documented and tested p... Present your own fully documented and tested programming example illustrating the problem of unbalanced loads. Describe the use of OpenMP's scheduler as a means of mitigating this

Address operator and pointers, We are use to using variables within C witho... We are use to using variables within C without thinking about where they are stored. Most variables are dynamic i.e. can change, therefore they are stored in Ram, unlike a program

priority-based scheduling algorithm , Your task is to replace the round ro... Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the ori

Difference between preemptive and nonpreemptive scheduling, Define the diff... Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul

Batch system, what is a batch system give me answer in simple words so that... what is a batch system give me answer in simple words so that i can understand

Define the windowsnt, Define the WindowsNT WindowsNT provides a two-lev... Define the WindowsNT WindowsNT provides a two-level approach to resource management: process and thread. The process is the uppermost level and contains most of the application

Define inter process communication (ipc), The term IPC (Inter-Process Commu... The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.

Relationship among the capabilities of domain level j and i, Q. In a ring-... Q. In a ring-protection system the level 0 has the greatest access to objects and level n (greater than zero) has fewer access rights. The access rights of a program at a partic