Question: Consider the following page access sequence: 1, 2, 3, 1, 0, 2, 3, 1, 3, 0. We define success of an algorithm with respect to
Consider the following page access sequence: 1, 2, 3, 1, 0, 2, 3, 1, 3, 0.
-
We define success of an algorithm with respect to an access sequence
as the ratio between its hit rate and Beladys algorithms hit rate on this sequence. What is the success of LRU on the given sequence? First calculate the LRU hit rate assuming that the cache size is 3. Again, you must draw a table to show the behavior of LRU on this sequence.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
