Suppose that the virtual page reference stream contains repetitions of long sequences of page references followed occasionally by a random page reference. For example, the sequence: 0, 1, … , 511, 431, 0, 1, … , 511, 332, 0, 1, … consists of repetitions of the sequence 0 , 1 , . . . , 511 followed by a random reference to pages 431 and 332.
(a) Why won”t the standard replacement algorithms (LRU, FIFO, Clock) be effective in handling this workload for a page allocation that is less than the sequence length?
(b) If this program were allocated 500 page frames, describe a page replacement approach that would perform much better than the LRU, FIFO, or Clock algorithms.