(Solved) : Consider Cache Lru Least Recently Used Fifo First First Cache Replacement Policies 4 Block Q38104074 . . .
Consider a cache with LRU (Least-Recently Used) and FIFO (First-In-First-Out) cache replacement policies. There are 4 blocks in the cache, numbered as 1 to 4. The cache blocks are initially empty. There are 5 main memory locations (A to E) that are being cached The 5. (2 points) Shown below is a table describing the behavior of cache with LRU policy. The sequence of memory reference is shown in the top row. The first few columns have been filled. Your task is to complete the table by filling in the remaining columns. If cache hit, place mark on the hit cache line, and if cache miss, place memory location letter on the cache block it replaces. s, place meme yemaining column few columns kth LRU Reference A B AC B D A D E D A E B A C 2 3 4 Show transcribed image text
Expert Answer
Answer to Consider Cache Lru Least Recently Used Fifo First First Cache Replacement Policies 4 Block Q38104074 . . .
OR