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
What are the four necessary conditions of deadlock prevention?       Ans:  Four essential conditions for deadlock prevention: a. The meaning of removing the mutual exclusio

Explain the various page replacement strategies. Page replacement-basic scheme with diagram Optimal page replacement LRU page replacement FIFO page replacement LRU

Explain the Architecting For Threads When available, threads are an integral part of any multitasking server application program. It is important that the operating system prov

Define the Global vs. local variables It is also important to discuss the scope of resources being granted to the application program.  Variable scoping is defined as the acces

Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is

Define request edge and assignment edge. Answer:  A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance

Usually memory is allocated from a large pool of unused memory area called the heap. In C++, dynamic allocation/deallocation must be manually performed using commands like malloc,

Explain the concept of Reentrancy? It is a useful, memory-saving method for multiprogrammed timesharing systems. A Reentrant Procedure is one in which many users can share a si

Question: a) Illustrate with the help of a diagram, the difference between two tier and three tier architectures. b) Explain in what kind of environment, a peer to peer envi

Explain Chaining to Handle Collision Chaining:  One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision