Question: Consider the expected competitive ratio in LRU. Problem Consider a cache that uses the Least Recently Used (LRU) page replacement policy. Suppose that our computer
Consider the expected competitive ratio in LRU.

Problem Consider a cache that uses the Least Recently Used (LRU) page replacement policy. Suppose that our computer program requests completely random pages: Every second it picks a random number r from 1 to n and requests page number r. Find the competitive ratio of the LRU policy: expected competive ratio = E # LRU page misses # page misses in OPT] The total number of pages is n; the size of the cache is k pages; and the total number of requests is T. A. Find the expected competitive ratio of LRU assuming that T > n and n > k. B. Find the expected competitive ratio of LRU assuming that T > n and n = k +1. In the both parts, you can assume that k, n, and T are sufficiently large
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
