Problem
I. Explain the six basic cache optimizations mentioned.
II. For the simple implementation given above, this execution order would be nonideal for the input matrix; however, applying a loop interchange optimization would create a nonideal order for the output matrix. Because loop interchange is not sufficient to improve its performance, it must be blocked instead.
i. What should be the minimum size of the cache to take advantage of blocked execution?
ii. How do the relative number of misses in the blocked and unblocked versions compare in the minimum sized cache above?
iii. Write code to perform a transpose with a block size parameter B which uses B × B blocks.
iv. What is the minimum associativity required?