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

Describe the differences among short-term and medium-term, Describe the dif... Describe the differences among short-term, medium-term, and long-term scheduling.   Short-term (CPU scheduler)-selects from jobs in memory those jobs that are ready to execu

Linear Programing, . A paper mill produces two grades of paper viz., X and ... . A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Difference between internal and external fragmentation, Explain the differe... Explain the difference between internal and external fragmentation. Internal Fragmentation is the area in a region or a page that is not used by the job occupying that region o

What is direct access, Normal 0 false false false EN-IN... Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain the demand paging system, Question : (a) In the demand paging ... Question : (a) In the demand paging system, when a process tries to access a page that was not brought into memory, a page fault occurs that involves a series of actions. The

#title.Kernal, Ask questiWhat is dispatcheron #Minimum 100 words accepted# Ask questiWhat is dispatcheron #Minimum 100 words accepted#

Write a note on semaphores, Write a note on semaphores A semaphore is a... Write a note on semaphores A semaphore is a tool meant for synchronizing multiple processes trying to access a shared variable. That is a semaphore is used to deal with the cri

Explain hierarchical paging method, Hierarchical paging method Most mo... Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

How many cubic feet of storage space would require, Q. Presume that we agr... Q. Presume that we agree that 1 kilobyte is 1,024 bytes 1 megabyte is 1,0242 bytes and 1 gigabyte is 1,0243 bytes. This progression carries on through terabytes, petabytes, and ex

Internal fragmentation, what is internal fragmentation? what is internal fragmentation?