Quiz submission record for quiz6-2-1 at Wed Jul 28 00:09:21 2004:

Your Answer for Question 1:
Block address = byte address/ bytes per block

Block address = 53/ 32bytes per block

Block address = 1

Since the size of the cache is unspecified, we can assume that the cache has at least two blocks which means that the tag is all 0's because 53 is the second block in the cache. Since 53 is such a low number, the higher bits have to be 0's because the off bytes and index takes care of the 53. The off bytes will take care of 32 and the index will take care of 64 because the block is at least 2.

Tag = 0

Your Answer for Question 2:
The optimization is that for the second loop the program is accessing x[i] for 20 times and it will become all hits because the first index to the array is whats important because x is an array of array so as long as you are accessing x[i][?] then it will be hitting the same memory in cache. However in the first loop before optimization each inner loop changes x[i] so each time it will be a miss because it would have to fetch from memory what x[i] is causing a slower processing time.


Your unique submission ID is quiz6-2-1-cs61c-aj-1090998561-285.