Cache replacement policies, Operating System

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







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
Related Questions
Introduction of linux

What are the common strategies to select a free hole from a set of available holes? The most common methods are a. First fit b. Best fit c. Worst fit

Multitasking - An Operating systems that is proficient of allowing multiple software processes to be run at the same time. Below are some instances of multitasking Operating Syste

What criteria are important in choosing a file organisation?

A friend has promised to log in at a particular time. However, he needs to be contacted as soon as he logs in. The shell script checks after every minute whether he has logged in o

What is the exclusive feature of UNIX Shell is the exclusive feature of UNIX.

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

Central to implementation of a modern memory management system is the page replacement algorithm. Modern virtual memory systems break memory up into pages and map (via a page table

List the Coffman's conditions that lead to a deadlock. Mutual Exclusion : Only one process might be use a critical resource at a time. Hold & Wait: A process may be alloc

what are the factors influencing the choice of a mode of transportation?