13 t chilimbi m hill and j larus cache conscious

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: can really understand how caches work. Ñ Ë Ø × 1. 2. 3. 32 32 32 1024 1024 1024 4 8 32 1 4 32 256 32 1 22 24 27 8 5 0 2 3 5 Problem 6.7 Solution: [Pg. 312] The padding eliminates the conflict misses. Thus ¿ Problem 6.8 Solution: [Pg. 313] Sometimes, understanding why something is a bad idea helps you understand why the alternative is a good idea. Here, the bad idea we are looking at is indexing the cache with the high order bits instead of the middle bits. A. With high-order bit indexing, each contiguous array chunk consists of ¾Ø blocks, where Ø is the number of tag bits. Thus, the first ¾Ø contiguous blocks of the array would map to Set 0, the next ¾Ø blocks would map to Set 1, and so on. B. For a direct-mapped cache where ´Ë ѵ ´ ½¾ ½ ¿¾ ¿¾µ, the cache capacity is 512 32-byte blocks, and there are Ø ½ tag bits in each cache line. Thus, the first ¾½ blocks in the array would map to Set 0, the next ¾½ blocks to Set 1. Since our array consists of only ¼...
View Full Document

This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online