Question: 3. Assume we have a 4-way set associative cache with 16 byte blocks (Memory is byte addressable). The cache uses a Least Recently Used replacement
3. Assume we have a 4-way set associative cache with 16 byte blocks (Memory is byte addressable). The cache uses a Least Recently Used replacement policy and write back write policy. For simplicity, we will say the total cache size is 128 bytes. Answer the following questions about this cache. Assume each address is 8 bits total. Show work.
3.1 How long is the tag field of this cache?
3.2 How long is the index field of this cache?
3.3 How long is the block offset of this cache?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
