Question: Thinking about cache. Assume cache with C = 10, B = 6, S = 0. Think that this cache implements write allocate, write back policy,

Thinking about cache. Assume cache with C = 10, B = 6, S = 0. Think that this cache implements write allocate, write back policy, system addresses are 32- bits wide. Explain about following: a) In this Cache, how many bits make up, Tag, Index, and Block Offset of an address accessing this Cache? (i.e. show the address split for accessing this cache) b) In this Cache, how many bits are there in Data Store? c) In this Cache, how many bits are there in Tag Store
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
