5.10 A computer system has a main memory consisting of 1M 16-bit words. It also has a
4K-word cache organized in the block-set-associative manner, with 4 blocks per set
and 64 words per block.
(a) Calculate the number of bits in each of the TAG, SET, and WORD fields of the
main memory address format.
(b) Assume that the cache is initially empty. Suppose that the processor fetches 4352
words from locations 0, 1, 2, \dots, 4351, in that order. It then repeats this fetch
sequence nine more times. If the cache is 10 times faster than the main memory,
estimate the improvement factor resulting from the use of the cache. Assume that
the LRU algorithm is used for block replacement.
5.11 Repeat Problem 5.10, assuming that whenever a block is to be brought from the main
memory and the corresponding set in the cache is full, the new block replaces the most
recently used block of this set.