Consider a hypothetical machine that implements a set-associative cache. Each set in the cache consists of...

Transcribed Image Text:

Consider a hypothetical machine that implements a set-associative cache. Each set in the cache consists of 4 lines, and each cache line holds 2 bytes. The cache can store 16 Kbytes of data. The main memory is byte-addressable and can store 4 Mbytes. How is the memory address divided into tag, set number and byte number, giving, respectively, the number of bits for each? The most significant bits are used for the tag, the middle bits are used for the set number, and the least significant bits are used for the byte number. Provide your answers in Base 10 numbers (and only write down the number). Marks will only be awarded if ALL answers are correct. Consider a hypothetical machine that implements a set-associative cache. Each set in the cache consists of 4 lines, and each cache line holds 2 bytes. The cache can store 16 Kbytes of data. The main memory is byte-addressable and can store 4 Mbytes. How is the memory address divided into tag, set number and byte number, giving, respectively, the number of bits for each? The most significant bits are used for the tag, the middle bits are used for the set number, and the least significant bits are used for the byte number. Provide your answers in Base 10 numbers (and only write down the number). Marks will only be awarded if ALL answers are correct.

Answer rating: 100% (QA)

Tag 8 set number 12 byte number 1 Tag Set Number Offset Block size ... View the full answer