Assume lru least recently used replacement algorithm is


Suppose we have a 16 block cache. Each block of the cache is one word wide. When a given program is executed, the processor reads data from the following sequence of decimal addresses:

0, 15, 2, 8, 14, 15, 26, 2, 0, 19, 7, 10, 8, 14, 11

Show the contents of the cache at the end of the above reading operations if:

  • the cache is direct mapped
  • the cache is 2-way set associative
  • the cache is 4-way set associative
  • the cache is fully associative

The content at address 0 can be shown as [0]. Assume LRU (Least Recently Used) replacement algorithm is used for block replacement in the cache, and the cache is initially empty.

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: Assume lru least recently used replacement algorithm is
Reference No:- TGS02267569

Now Priced at $10 (50% Discount)

Recommended (97%)

Rated (4.9/5)