Problem
In a given heirarchical memory with a Level 1 Cache size of 32K Bytes and a Block size of 4 words. Using the formula (2^n x (32x2^m + 31-n-m):
a) What is the value of n?
b) What is the value of m?
c) How many bits are needed in total for the cache and overhead (including tags & valid bits)?
d) What is the overhead percentage (cache bits/total bits)?