Good one. The optimal page replacement algorithm selects for removal the page that will not be referenced again for the longest span of executed instructions. Of course, this algorithm is only a theoretical device...
Define THE optima cache line/page replacement algorithm?
Highlight below for answer, try it first though
Replace the cache line/page that results in fewest cache misses/page faults in the future. Since it is imposible to know what programs will do in the future this is impossible, but still THE optimal algorithm. u're not expecting this huh?
There are currently 1 users browsing this thread. (0 members and 1 guests)