In class, we saw that an optim
In class, we saw that an optimal greedy strategy for the paging problem was to reject the page the
furthest in the future (ff). The paging problem is a classic online problem, meaning that algorithms
do not have access to future requests. Consider the following online eviction strategies for the paging
problem, and provide counter-examples that show that they are not optimal offline strategies.
(a) FWF is a strategy that, on a page fault, if the cache is full, it evicts all the pages.
(b) LRU is a strategy that, if the cache is full, evicts the least recently used page when there is a page
fault.