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 steps followed in testing, What are the steps followed in test... What are the steps followed in testing? i. Unit testing - The individual components are tested in this type of testing. ii. Module testing - Related collection of independen

Explain about operating system services, Q. Explain about Operating System ... Q. Explain about Operating System Services? An operating system offers services to programs and to users of those programs. It provided by one environment for execution of

What are the objectives and functions of operating system, What are the obj... What are the objectives and functions of operating system? Functions of operating systems 1.      It allocates the resources and acts as a supervisor. 2.      It hides th

Explain the various methods for handling deadlocks, Explain the various met... Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Describe demand-paged environment, Q. Which of the subsequent programming ... Q. Which of the subsequent programming techniques and structures are good for a demand-paged environment? Which aren't good? Describe your answers. a. Stack b. Hashed symbol

Define enforcing modularity for c, Define Enforcing Modularity for C Ad... Define Enforcing Modularity for C Additionally, in C it is sometimes necessary to create modularity of design. C++  is very natural model for component based application design

What is a sequential file, What is a sequential file? A file that is re... What is a sequential file? A file that is read one record or block or parameter at a time in order, based on a tape model of a file.

Write pseudo code to implement the pthread create wrapper, Write pseudo cod... Write pseudo code to implement the pthread_create wrapper of the Tern memoizer. Note you need to describe your data structure for maintaining deterministic thread IDs. In addition,

Explain short term scheduling, Short term scheduling The short term sch... Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th

Structures for a file''s data, Q. Likewise some systems support many types ... Q. Likewise some systems support many types of structures for a file's data while others simply support a stream of bytes. What are the merits in addition to demerits? Answer: