Question1. [15] Assume that you have a cache with the following specifications: Fully-associative Total size = 64 words (256 bytes).

Please help me with this question

URGENT!

Question1. [15] Assume that you have a cache with the following specifications:

⢠Fully-associative

⢠Total size = 64 words (256 bytes).

⢠Block size = 8 words (32 bytes).

⢠The cache is initially empty.

⢠The Least Recently Used (LRU) replacement policy is used.

(a) Show how a 16-bit memory address would be divided into the tag, index, and block-offset

fields for the fully-associative cache. Assume byte-addressable memory.

(b) Determine the number of data bits stored in this cache.

(c) Determine the total number of bits needed to implement this cache.

(d) Create a table. Identify each memory reference (given above) as either a cache hit or

a cache miss for the fully-associative cache.

(e) Show the final contents of the fully-associative cache.

Question2. [15] Assume that you have a cache with the following specifications:

⢠Direct-mapped

⢠Total size = 64 words (256 bytes).

⢠Block size = 8 words (32 bytes).

⢠The cache is initially empty.

(a) Show how a 16-bit memory address would be divided into the tag, index, and block-offset

fields for the direct-mapped cache. Assume byte-addressable memory.

(b) Determine the number data bits stored in this cache.

(c) Determine the total number of bits needed to implement this cache.

(d) Create a table. Identify each memory reference (given above) as either a cache hit or

a cache miss for the direct-mapped cache.

(e) Show the final contents of the direct-mapped cache.