Com 19 c cowan p wagle c pu s beattie and j walpole

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ¿¾ ½¾ blocks, all of the blocks in the array map to Set 0. Thus the cache will hold at most 1 array block at any point in time, even though the array is small enough to fit entirely in the cache. Clearly, using high-order bit indexing makes poor use of the cache. Problem 6.9 Solution: [Pg. 316] of the references are hits. 720 APPENDIX B. SOLUTIONS TO PRACTICE PROBLEMS The two low order bits are the block offset (CO), followed by three bits of set index (CI), with the remaining bits serving as the tag (CT). 12 11 10 9 8 7 6 5 4 3 2 1 0 CT CT CT CT CT CT CT CT CI CI CI CO CO Problem 6.10 Solution: [Pg. 317] Address: 0x0E34 A. Address format (one bit per box): 12 11 10 9 8 7 6 5 4 3 2 1 0 0111000110100 CT CT CT CT CT CT CT CT CI CI CI CO CO B. Memory reference: Parameter Cache block offset (CO) Cache set index (CI) Cache tag (CT) Cache hit? (Y/N) Cache byte returned Value 0x0 0x5 0x71 Y 0xB Problem 6.11 Solution: [Pg. 318] Address: 0x0DD5 A. Address format (one bit per box): 12 11 10 9 8 7 6 5 4 3 2 1 0 0110111010101 CT CT CT CT CT C...
View Full Document

Ask a homework question - tutors are online