91. Suppose we have a byte-addressable computer using direct mapping with 16-bit
ID: 645559 • Letter: 9
Question
91. Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 8 bytes, determine the size of the tag field.
a 4 b. 8 c. 3 d. 2 e. 10
92. Suppose we have a byte-addressable computer using fully associative mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes, determine the size of the offset field.
a. 4 b. 8 c. 3 d. 5 e. 10
93. Suppose we have a byte-addressable computer using fully associative mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes, determine the size of the tag field.
a 4 b. 8 c. 12 d. 2 e. 10
94. Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 8 bytes, determine the size of the offset field.
a 4 b. 8 c. 3 d. 2 e. 10
95. Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 8 bytes, determine the size of the set field.
a 4 b. 8 c. 3 d. 2 e. 12
Explanation / Answer
91. b (tag = 16 - (5 + 3) = 8 bits)
92. a, 4 bits
93. c. 12 bits
94. c. 3bits
95. a. 4 bits
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.