Optimal replacement policy, Operating System

The optimal replacement policy, called OPT, is to evict the page which will be accessed farthest into the future. Since we can't predict the future precisely, we can't implement OPT in any real system. We can, however, run OPT on a saved trace of memory accesses, to measure how our real algorithm compares with OPT for a given trace.

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







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

Write discussion on Optimal replacement policy
Your posts are moderated
Related Questions
Process States A total of nine states are acknowledged by the UNIX system. They are like as follow: User running                                                   Executing

Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for

Define semaphore A semaphore is a protected abstract or variable data type that constitutes the classic method for restricting access to shared resources like shared memory in

Describe the purpose of the checkpoint mechanism. How habitually must checkpoints be performed? Explain how the frequency of checkpoints affects: System performance while no

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. With the notes under code. Its exactly "programming project 1 - Unix Shell and History Fea

Resolution of externally defined symbols is carried out by    Resolution of externally defined symbols is carried out by Linker

What is a buddy system? We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecti

List sample file types, based on use, on the VAX under VMS.  source programs (.BAS, .FOR, .COB, .PLI, .PAS, .MAR)  data files (.DAT)  text files (.TXT)  command proced

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